Publikacje

Czasopismo: SIAM Journal on Computing

Liczba publikacji: 27

2024

• Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk , Paweł Rzążewski , Paul Seymour, Induced Subgraphs of Bounded Treewidth and the Container Method, SIAM Journal on Computing, 53 (3) 2024, s. 624-647. Zobacz w PBN
• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Internal Pattern Matching Queries in a Text and Applications, SIAM Journal on Computing, 53 (5) 2024, s. 1524-1577. Zobacz w PBN
• Maria Chudnovsky, Marcin Pilipczuk , Michał Pilipczuk , Stéphan Thomassé, Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in H -Free Graphs, SIAM Journal on Computing, 53 (1) 2024, s. 47-86. Zobacz w PBN

2023

• Jesper Nederlof, Jakub Pawlewicz , Céline M. F. Swennenhuis, Karol Węgrzycki, A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics, SIAM Journal on Computing, 52 (6) 2023, s. 1369-1412. Zobacz w PBN
• Andrei Krokhin, Jakub Opršal, Marcin Wrochna , Stanislav Živný, Topology and Adjunction in Promise Constraint Satisfaction, SIAM Journal on Computing, 52 (1) 2023, s. 38-79. Zobacz w PBN
• Tomasz Gogacz , Jerzy Marcinkowski, Andreas Pieris, Uniform restricted chase termination, SIAM Journal on Computing, 39th ACM SIGMOD-SIGACT-SIGART Conference on Principles of Database Systems, Portland, the United States of America, 14 czerwca 2020 - 19 czerwca 2020, 52 (3) 2023, s. 641-683. Zobacz w PBN

2022

• Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs, SIAM Journal on Computing, 51 (2) 2022, s. 254-289. Zobacz w PBN
• Arkadev Chattopadhyay, Marek Cygan , Noga Ron-Zewi, Christian Wulff-Nilsen, Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020), SIAM Journal on Computing, 52nd ACM Symposium on Theory of Computing, Chicago, the United States of America, 22 czerwca 2020 - 26 czerwca 2020, 51 (3) 2022, s. STOC20-i-STOC20-i. Zobacz w PBN
• Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering, SIAM Journal on Computing, 51 (6) 2022, s. 1866-1930. Zobacz w PBN

2021

• Harold N. Gabow, Piotr Sankowski , Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors, SIAM Journal on Computing, 50 (2) 2021, s. 440-486. Zobacz w PBN
• Harold N. Gabow, Piotr Sankowski , Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths, SIAM Journal on Computing, 50 (2) 2021, s. 555-601. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs, SIAM Journal on Computing, 50 (2) 2021, s. 487-508. Zobacz w PBN

2020

• Parinya Chalermsook, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan, Marek Cygan , From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More, SIAM Journal on Computing, 49 2020, s. 772--810. Zobacz w PBN
• Artur Czumaj, Jakub Ła̧cki, Aleksander Ma̧dry, Slobodan Mitrović, Krzysztof Onak, Piotr Sankowski , Round Compression for Parallel Matching Algorithms, SIAM Journal on Computing, 49 (5) 2020, s. STOC18-1-STOC18-44. Zobacz w PBN
• Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna , Stanislav Živný, The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems, SIAM Journal on Computing, 49 (6) 2020, s. 1232-1248. Zobacz w PBN

2019

• Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Minimum Bisection Is Fixed-Parameter Tractable, SIAM Journal on Computing, 48 (2) 2019, s. 417-450. Zobacz w PBN

2017

• Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, SIAM Journal on Computing, 46 (1) 2017, s. 161–189. Zobacz w PBN

2016

• Michał Pilipczuk , Hans L. Bodlaender, Pål Grønås Drange Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, A c^k n 5-Approximation Algorithm for Treewidth, SIAM Journal on Computing, 45 (2) 2016, s. 317-378. Zobacz w PBN
• Rajesh Chitnis, Marek Cygan , MohammadTaghi Hajiaghayi, Marcin Pilipczuk , Michał Pilipczuk , Designing FPT Algorithms for Cut Problems Using Randomized Contractions, SIAM Journal on Computing, 2016. Zobacz w PBN
• Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Known Algorithms for Edge Clique Cover are Probably Optimal, SIAM Journal on Computing, 2016. Zobacz w PBN

2015

• Eryk Kopczyński , Tony Tan, Regular Graphs and the Spectra of Two-Variable Logic with Counting, SIAM Journal on Computing, 2015. Zobacz w PBN

2013

• Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski , Mohit Singh, Set Covering with Our Eyes Closed, SIAM Journal on Computing, 2013. Zobacz w PBN

2012

• Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More), SIAM Journal on Computing, 2012. Zobacz w PBN
• Mikołaj Bojańczyk , Algorithms for regular languages that use algebra, SIAM Journal on Computing, 2012. Zobacz w PBN
• Jan Hidders, Paolo Missier, Jacek Sroka , Report from the first workshop on scalable workflow enactment engines and technology (SWEET'12), SIAM Journal on Computing, 2012. Zobacz w PBN

2008

• Mikołaj Bojańczyk , Thomas Colcombet, Tree-Walking Automata Do Not Recognize All Regular Languages, SIAM Journal on Computing, 2008. Zobacz w PBN

2001

• Grazyna Mirkowska, Andrzej Salwicki, Marian Srebrny, Andrzej Tarlecki , First order specifications of programmable data types, SIAM Journal on Computing, 2001. Zobacz w PBN