Faster Exact Bandwidth. - Marek Cygan; Marcin Pilipczuk (WG, 2008)

Exponential-Time Approximation of Hard Problems - Marek Cygan; Lukasz Kowalik; Marcin Pilipczuk; Mateusz Wykurz (CoRR, 2008)

Exact and Approximate Bandwidth. - Marek Cygan; Marcin Pilipczuk (ICALP (1), 2009)

Beyond O*(2^n) in domination-type problems - Marek Cygan; Marcin Pilipczuk; Jakub Onufry Wojtaszczyk (CoRR, 2009)

Irredundant Set Faster Than O(2n). - Marek Cygan; Marcin Pilipczuk; Jakub Onufry Wojtaszczyk (CIAC, 2010)

Fast Approximation in Subspaces by Doubling Metric Decomposition. - Marek Cygan; Lukasz Kowalik; Marcin Mucha; Marcin Pilipczuk; Piotr Sankowski (ESA (1), 2010)

An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (IPEC, 2010)

Capacitated Domination Faster Than O(2n). - Marek Cygan; Marcin Pilipczuk; Jakub Onufry Wojtaszczyk (SWAT, 2010)

Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (WG, 2010)

Scheduling Partially Ordered Jobs Faster Than 2 n. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (ESA, 2011)

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. - Marek Cygan; Jesper Nederlof; Marcin Pilipczuk; Michal Pilipczuk; Johan M. M. van Rooij; Jakub Onufry Wojtaszczyk (FOCS, 2011)

Approximation Algorithms for Union and Intersection Covering Problems. - Marek Cygan; Fabrizio Grandoni 001; Stefano Leonardi 001; Marcin Mucha; Marcin Pilipczuk; Piotr Sankowski (FSTTCS, 2011)

Subset Feedback Vertex Set Is Fixed-Parameter Tractable. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (ICALP (1), 2011)

On the Hardness of Losing Width. - Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (IPEC, 2011)

On Cutwidth Parameterized by Vertex Cover. - Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (IPEC, 2011)

On Multiway Cut Parameterized above Lower Bounds. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (IPEC, 2011)

The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem). - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (SODA, 2011)

Parameterized Complexity of Eulerian Deletion Problems. - Marek Cygan; Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk; Ildikó Schlotter (WG, 2011)

Subexponential fixed-parameter tractability of cluster editing - Fedor V. Fomin; Stefan Kratsch; Marcin Pilipczuk; Michal Pilipczuk; Yngve Villanger (CoRR, 2011)

On the Zagreb index inequality of graphs with prescribed vertex degrees. - Vesna Andova; Saso Bogoev; Darko Dimitrov; Marcin Pilipczuk; Riste Skrekovski (Discret. Appl. Math., 2011)

Capacitated domination faster than O(n2). - Marek Cygan; Marcin Pilipczuk; Jakub Onufry Wojtaszczyk (Inf. Process. Lett., 2011)

Breaking the 2n-barrier for Irredundance: Two lines of attack. - Daniel Binkele-Raible; Ljiljana Brankovic; Marek Cygan; Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedloff; Marcin Pilipczuk; Peter Rossmanith; Jakub Onufry Wojtaszczyk (J. Discrete Algorithms, 2011)

Dominating set is fixed parameter tractable in claw-free graphs. - Marek Cygan; Geevarghese Philip; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (Theor. Comput. Sci., 2011)

A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. - Marek Cygan; Fabrizio Grandoni 001; Stefano Leonardi 001; Marcin Pilipczuk; Piotr Sankowski (ESA, 2012)

Designing FPT Algorithms for Cut Problems Using Randomized Contractions. - Rajesh Hemant Chitnis; Marek Cygan; MohammadTaghi Hajiaghayi; Marcin Pilipczuk; Michal Pilipczuk (FOCS, 2012)

Clique Cover and Graph Separation: New Incompressibility Results. - Marek Cygan; Stefan Kratsch; Marcin Pilipczuk; Michal Pilipczuk; Magnus Wahlström (ICALP (1), 2012)

Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. - Stefan Kratsch; Marcin Pilipczuk; Michal Pilipczuk; Magnus Wahlström (ICALP (1), 2012)

Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n. - Marcin Pilipczuk; Michal Pilipczuk (IPEC, 2012)

Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (LATIN, 2012)

Sitting Closer to Friends Than Enemies, Revisited. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (MFCS, 2012)

Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs. - Stefan Kratsch; Marcin Pilipczuk; Ashutosh Rai 001; Venkatesh Raman 001 (SWAT, 2012)

On Group Feedback Vertex Set Parameterized by the Size of the Cutset. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk (WG, 2012)

On fixed-parameter algorithms for Split Vertex Deletion - Marek Cygan; Marcin Pilipczuk (CoRR, 2012)

Bandwidth and distortion revisited. - Marek Cygan; Marcin Pilipczuk (Discret. Appl. Math., 2012)

Kernelization hardness of connectivity problems in d-degenerate graphs. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (Discret. Appl. Math., 2012)

Some results on Vizing's conjecture and related problems. - Marcin Pilipczuk; Michal Pilipczuk; Riste Skrekovski (Discret. Appl. Math., 2012)

A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More). - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (SIAM J. Comput., 2012)

Even Faster Exact Bandwidth. - Marek Cygan; Marcin Pilipczuk (ACM Trans. Algorithms, 2012)

The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable. - Marek Cygan; Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk (FOCS, 2013)

Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree. - Marek Cygan; Marcin Pilipczuk (ICALP (1), 2013)

Known algorithms for EDGE CLIQUE COVER are probably optimal. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk (SODA, 2013)

Tight bounds for Parameterized Complexity of Cluster Editing. - Fedor V. Fomin; Stefan Kratsch; Marcin Pilipczuk; Michal Pilipczuk; Yngve Villanger (STACS, 2013)

Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. - Marcin Pilipczuk; Michal Pilipczuk; Piotr Sankowski; Erik Jan van Leeuwen (STACS, 2013)

Dynamic Steiner Tree in Planar Graphs. - Jakub Lacki; Jakub Ocwieja; Marcin Pilipczuk; Piotr Sankowski; Anna Zych (CoRR, 2013)

Towards optimal kernel for connected vertex cover in planar graphs. - Lukasz Kowalik; Marcin Pilipczuk; Karol Suchan (Discret. Appl. Math., 2013)

A bound on the number of perfect matchings in Klee-graphs. - Marek Cygan; Marcin Pilipczuk; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2013)

Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms. - Marek Cygan; Marcin Pilipczuk (Inf. Process. Lett., 2013)

A Fast Branching Algorithm for Cluster Vertex Deletion. - Anudhyan Boral; Marek Cygan; Tomasz Kociumaka; Marcin Pilipczuk (CSR, 2014)

A Subexponential Parameterized Algorithm for Proper Interval Completion. - Ivan Bliznets; Fedor V. Fomin; Marcin Pilipczuk; Michal Pilipczuk (ESA, 2014)

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. - Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (FOCS, 2014)

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. - Marcin Pilipczuk; Michal Pilipczuk; Piotr Sankowski; Erik Jan van Leeuwen (FOCS, 2014)

Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth. - Marek Cygan; Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk (MFCS (2), 2014)

Minimum bisection is fixed parameter tractable. - Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (STOC, 2014)

Kernelization and Sparseness: the case of Dominating Set. - Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Stephan Kreutzer; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Felix Reidl; Saket Saurabh 001; Fernando Sánchez Villaamil; Somnath Sikdar (CoRR, 2014)

Faster deterministic Feedback Vertex Set. - Tomasz Kociumaka; Marcin Pilipczuk (Inf. Process. Lett., 2014)

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. - Fedor V. Fomin; Stefan Kratsch; Marcin Pilipczuk; Michal Pilipczuk; Yngve Villanger (J. Comput. Syst. Sci., 2014)

Parameterized Algorithms - Marek Cygan; Fedor V. Fomin; Lukasz Kowalik; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (Springer, 2015)

The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. - Jakub Lacki; Jakub Ocwieja; Marcin Pilipczuk; Piotr Sankowski; Anna Zych (STOC, 2015)

Polynomial Kernelization for Removing Induced Claws and Diamonds. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Erik Jan van Leeuwen; Marcin Wrochna (WG, 2015)

Independence and Efficient Domination on P6-free Graph. - Daniel Lokshtanov; Marcin Pilipczuk; Erik Jan van Leeuwen (CoRR, 2015)

Edge Bipartization faster than 2k. - Marcin Pilipczuk; Michal Pilipczuk; Marcin Wrochna (CoRR, 2015)

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. - Fedor V. Fomin; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (FOCS, 2016)

Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. - Chandra Chekuri; Alina Ene; Marcin Pilipczuk (ICALP, 2016)

Edge Bipartization Faster Than 2^k. - Marcin Pilipczuk; Michal Pilipczuk; Marcin Wrochna (IPEC, 2016)

Subexponential parameterized algorithm for Interval Completion. - Ivan Bliznets; Fedor V. Fomin; Marcin Pilipczuk; Michal Pilipczuk (SODA, 2016)

Independence and Efficient Domination on P6-free Graphs. - Daniel Lokshtanov; Marcin Pilipczuk; Erik Jan van Leeuwen (SODA, 2016)

Directed multicut is W[1]-hard, even for four terminal pairs. - Marcin Pilipczuk; Magnus Wahlström (SODA, 2016)

Kernelization and Sparseness: the Case of Dominating Set. - Pål Grønås Drange; Markus Sortland Dregi; Fedor V. Fomin; Stephan Kreutzer; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Felix Reidl; Fernando Sánchez Villaamil; Saket Saurabh 001; Sebastian Siebertz; Somnath Sikdar (STACS, 2016)

Lower Bounds for Approximation Schemes for Closest String. - Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (SWAT, 2016)

On Routing Disjoint Paths in Bounded Treewidth Graphs. - Alina Ene; Matthias Mnich; Marcin Pilipczuk; Andrej Risteski (SWAT, 2016)

Exact Algorithms on Graphs of Bounded Average Degree. - Marcin Pilipczuk (Encyclopedia of Algorithms, 2016)

Planar Directed k-Vertex-Disjoint Paths Problem. - Marcin Pilipczuk (Encyclopedia of Algorithms, 2016)

Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. - Dániel Marx; Marcin Pilipczuk (ESA, 2017)

Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. - Bart M. P. Jansen; Marcin Pilipczuk; Marcin Wrochna (IPEC, 2017)

An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. - Nikolai Karpov; Marcin Pilipczuk; Anna Zych-Pawlewicz (IPEC, 2017)

Approximation and Kernelization for Chordal Vertex Deletion. - Bart M. P. Jansen; Marcin Pilipczuk (SODA, 2017)

Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2017)

The Erdős-Hajnal conjecture for caterpillars and their complements. - Anita Liebenau; Marcin Pilipczuk (CoRR, 2017)

A tight lower bound for Vertex Planarization on graphs of bounded treewidth. - Marcin Pilipczuk (Discret. Appl. Math., 2017)

Editorial. - Alexandr Andoni; Debmalya Panigrahi; Marcin Pilipczuk (ACM Trans. Algorithms, 2017)

Hardness of Approximation for Strip Packing. - Anna Adamaszek; Tomasz Kociumaka; Marcin Pilipczuk; Michal Pilipczuk (ACM Trans. Comput. Theory, 2017)

Planar Digraphs. - Marcin Pilipczuk; Michal Pilipczuk (Classes of Directed Graphs, 2018)

On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. - Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk (FOCS, 2018)

Multi-Budgeted Directed Cuts. - Stefan Kratsch; Shaohua Li 005; Dániel Marx; Marcin Pilipczuk; Magnus Wahlström (IPEC, 2018)

Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set. - Krzysztof Kiljan; Marcin Pilipczuk (SEA, 2018)

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. - Wojciech Nadara; Marcin Pilipczuk; Roman Rabinovich 001; Felix Reidl; Sebastian Siebertz (SEA, 2018)

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. - Michal Ziobro; Marcin Pilipczuk (SEA, 2018)

An Improved FPT Algorithm for Independent Feedback Vertex Set. - Shaohua Li 005; Marcin Pilipczuk (WG, 2018)

Excluding Hooks and their Complements. - Krzysztof Choromanski; Dvir Falik; Anita Liebenau; Viresh Patel; Marcin Pilipczuk (Electron. J. Comb., 2018)

Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs. - Gábor Bacsó; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Zsolt Tuza; Erik Jan van Leeuwen (CoRR, 2018)

Randomized contractions meet lean decompositions. - Marek Cygan; Pawel Komosa; Daniel Lokshtanov; Michal Pilipczuk; Marcin Pilipczuk; Saket Saurabh 001 (CoRR, 2018)

Experimental Evaluation of Parameterized Algorithms for Graph Separation Problems: Half-Integral Relaxations and Matroid-based Kernelization. - Marcin Pilipczuk; Michal Ziobro (CoRR, 2018)

Directed Multicut is W[1]-hard, Even for Four Terminal Pairs. - Marcin Pilipczuk; Magnus Wahlström (ACM Trans. Comput. Theory, 2018)

Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs. - Vincent Cohen-Addad; Marcin Pilipczuk; Michal Pilipczuk (ESA, 2019)

Improved Bounds for the Excluded-Minor Approximation of Treedepth. - Wojciech Czerwinski; Wojciech Nadara; Marcin Pilipczuk (ESA, 2019)

Packing Directed Circuits Quarter-Integrally. - Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (ESA, 2019)

A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. - Vincent Cohen-Addad; Michal Pilipczuk; Marcin Pilipczuk (FOCS, 2019)

Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (SODA, 2019)

A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. - Bart M. P. Jansen; Marcin Pilipczuk; Erik Jan van Leeuwen (STACS, 2019)

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. - Gábor Bacsó; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Zsolt Tuza; Erik Jan van Leeuwen (Algorithmica, 2019)

Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. - Bart M. P. Jansen; Marcin Pilipczuk; Marcin Wrochna (Algorithmica, 2019)

Deleting Vertices to Graphs of Bounded Genus. - Tomasz Kociumaka; Marcin Pilipczuk (Algorithmica, 2019)

Edge Bipartization Faster than $$2^k$$ 2 k. - Marcin Pilipczuk; Michal Pilipczuk; Marcin Wrochna (Algorithmica, 2019)

Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. - Maria Chudnovsky; Marcin Pilipczuk; Michal Pilipczuk; Stéphan Thomassé (CoRR, 2019)

Cluster Editing parameterized above the size of a modification-disjoint P3 packing is para-NP-hard. - Shaohua Li 005; Marcin Pilipczuk; Manuel Sorge (CoRR, 2019)

Jones' Conjecture in subcubic graphs. - Marthe Bonamy; François Dross; Tomás Masarík; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2019)

Caterpillars in Erdős-Hajnal. - Anita Liebenau; Marcin Pilipczuk; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2019)

Surprising Applications of Treewidth Bounds for Planar Graphs. - Marcin Pilipczuk (Treewidth, Kernels, and Algorithms, 2020)

The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. - Thomas Bellitto; Shaohua Li 005; Karolina Okrasa; Marcin Pilipczuk; Manuel Sorge (ISAAC, 2020)

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. - Lukasz Kowalik; Marcin Mucha; Wojciech Nadara; Marcin Pilipczuk; Manuel Sorge; Piotr Wygocki (IPEC, 2020)

Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. - Maria Chudnovsky; Marcin Pilipczuk; Michal Pilipczuk; Stéphan Thomassé (SODA, 2020)

Covering minimal separators and potential maximal cliques in Pt-free graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2020)

On Dynamic Parameterized k-Path. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Michal Pilipczuk; Marcin Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (CoRR, 2020)

Quasi-polynomial-time algorithm for Independent Set in Pt-free and C>t-free graphs via shrinking the space of connecting subgraphs. - Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (CoRR, 2020)

Two lower bounds for p-centered colorings. - Loïc Dubois 001; Gwenaël Joret; Guillem Perarnau; Marcin Pilipczuk; François Pitois (Discret. Math. Theor. Comput. Sci., 2020)

A Double Exponential Lower Bound for the Distinct Vectors Problem. - Marcin Pilipczuk; Manuel Sorge (Discret. Math. Theor. Comput. Sci., 2020)

On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five. - Maria Chudnovsky; Marcin Pilipczuk; Michal Pilipczuk; Stéphan Thomassé (SIAM J. Discret. Math., 2020)

Introduction to the Special Issue on SODA'18. - Yin Tat Lee; Marcin Pilipczuk; David P. Woodruff (ACM Trans. Algorithms, 2020)

Close Relatives (Of Feedback Vertex Set), Revisited. - Hugo Jacob 001; Thomas Bellitto; Oscar Defrain; Marcin Pilipczuk (IPEC, 2021)

Hardness of Metric Dimension in Graphs of Constant Treewidth. - Shaohua Li 005; Marcin Pilipczuk (IPEC, 2021)

Induced subgraphs of bounded treewidth and the container method. - Tara Abrishami; Maria Chudnovsky; Marcin Pilipczuk; Pawel Rzazewski; Paul D. Seymour (SODA, 2021)

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (SODA, 2021)

Solving hard cut problems via flow-augmentation. - Eun Jung Kim 002; Stefan Kratsch; Marcin Pilipczuk; Magnus Wahlström (SODA, 2021)

Optimal Discretization is Fixed-parameter Tractable. - Stefan Kratsch; Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Manuel Sorge (SODA, 2021)

Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths. - Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (SOSA, 2021)

Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. - Shaohua Li 005; Marcin Pilipczuk; Manuel Sorge (STACS, 2021)

Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time. - Peter Gartland; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (STOC, 2021)

Polynomial Treedepth Bounds in Linear Colorings. - Jeremy Kun; Michael P. O'Brien; Marcin Pilipczuk; Blair D. Sullivan (Algorithmica, 2021)

Jones' Conjecture in Subcubic Graphs. - Marthe Bonamy; François Dross; Tomás Masarík; Andrea Munaro; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk (Electron. J. Comb., 2021)

Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (Electron. J. Comb., 2021)

(Theta, triangle)-free and (even hole, K4)-free graphs. Part 2: Bounds on treewidth. - Marcin Pilipczuk; Ni Luh Dewi Sintiari; Stéphan Thomassé; Nicolas Trotignon (J. Graph Theory, 2021)

Randomized Contractions Meet Lean Decompositions. - Marek Cygan; Pawel Komosa; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001; Magnus Wahlström (ACM Trans. Algorithms, 2021)

Taming Graphs with No Large Creatures and Skinny Ladders. - Jakub Gajarský; Lars Jaffke; Paloma T. Lima; Jana Novotná 001; Marcin Pilipczuk; Pawel Rzazewski; Uéverton S. Souza (ESA, 2022)

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. - Konrad Majewski; Tomás Masarík; Jana Novotná 001; Karolina Okrasa; Marcin Pilipczuk; Pawel Rzazewski; Marek Sokolowski 001 (ICALP, 2022)

On the Complexity of Problems on Tree-Structured Graphs. - Hans L. Bodlaender; Carla Groenland; Hugo Jacob 001; Marcin Pilipczuk; Michal Pilipczuk (IPEC, 2022)

Directed flow-augmentation. - Eun Jung Kim 002; Stefan Kratsch; Marcin Pilipczuk; Magnus Wahlström (STOC, 2022)

Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. - Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (STOC, 2022)

Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. - Hugo Jacob 001; Marcin Pilipczuk (WG, 2022)

Preface to the Special Issue on Parameterized and Exact Computation. - Yixin Cao 001; Marcin Pilipczuk (Algorithmica, 2022)

On weighted graph separation problems and flow-augmentation. - Eun Jung Kim 002; Marcin Pilipczuk; Roohani Sharma; Magnus Wahlström (CoRR, 2022)

Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4. - Linda Cook; Tomás Masarík; Marcin Pilipczuk; Amadeus Reinald; Uéverton S. Souza (CoRR, 2022)

Highly unbreakable graph with a fixed excluded minor are almost rigid. - Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (CoRR, 2022)

Constant Congestion Brambles. - Meike Hatzel; Pawel Komosa; Marcin Pilipczuk; Manuel Sorge (Discret. Math. Theor. Comput. Sci., 2022)

A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs. - Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk (SIAM J. Comput., 2022)

Constant Congestion Brambles in Directed Graphs. - Tomás Masarík; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (SIAM J. Discret. Math., 2022)

Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (ACM Trans. Algorithms, 2022)

Packing Directed Cycles Quarter- and Half-Integrally. - Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (Comb., 2022)

The Influence of Dimensions on the Complexity of Computing Decision Trees. - Stephen G. Kobourov; Maarten Löffler; Fabrizio Montecchiani; Marcin Pilipczuk; Ignaz Rutter; Raimund Seidel; Manuel Sorge; Jules Wulms (AAAI, 2023)

Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. - Vincent Cohen-Addad; Hung Le 001; Marcin Pilipczuk; Michal Pilipczuk (FOCS, 2023)

Parameterized Complexity Classification for Interval Constraints. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov; Marcin Pilipczuk; Roohani Sharma (IPEC, 2023)

Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. - Eun Jung Kim 002; Stefan Kratsch; Marcin Pilipczuk; Magnus Wahlström (SODA, 2023)

Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. - Meike Hatzel; Lars Jaffke; Paloma T. Lima; Tomás Masarík; Marcin Pilipczuk; Roohani Sharma; Manuel Sorge (SODA, 2023)

A tight quasi-polynomial bound for Global Label Min-Cut. - Lars Jaffke; Paloma T. Lima; Tomás Masarík; Marcin Pilipczuk; Uéverton S. Souza (SODA, 2023)

Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$. - Linda Cook; Tomás Masarík; Marcin Pilipczuk; Amadeus Reinald; Uéverton S. Souza (Electron. J. Comb., 2023)

Sparse induced subgraphs in P_6-free graphs. - Maria Chudnovsky; Rose McCarty; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (CoRR, 2023)

Directed Symmetric Multicut is W[1]-hard. - George Osipov; Marcin Pilipczuk (CoRR, 2023)

The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. - Thomas Bellitto; Shaohua Li 005; Karolina Okrasa; Marcin Pilipczuk; Manuel Sorge (Algorithmica, 2023)

Parameterized Complexity of MinCSP over the Point Algebra. - George Osipov; Marcin Pilipczuk; Magnus Wahlström (ESA, 2024)

Sparse induced subgraphs in P6-free graphs. - Maria Chudnovsky; Rose McCarty; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (SODA, 2024)

Simple and tight complexity lower bounds for solving Rabin games. - Antonio Casares; Marcin Pilipczuk; Michal Pilipczuk; Uéverton S. Souza; K. S. Thejaswini (SOSA, 2024)

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. - Karthik C. S. 001; Dániel Marx; Marcin Pilipczuk; Uéverton S. Souza (SOSA, 2024)

Max Weight Independent Set in Sparse Graphs with No Long Claws. - Tara Abrishami; Maria Chudnovsky; Marcin Pilipczuk; Pawel Rzazewski (STACS, 2024)

Combinatorial Correlation Clustering. - Vincent Cohen-Addad; David Rasmussen Lolck; Marcin Pilipczuk; Mikkel Thorup; Shuyi Yan; Hanwen Zhang 003 (STOC, 2024)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. - Peter Gartland; Daniel Lokshtanov; Tomás Masarík; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (STOC, 2024)

Bounding ϵ-scatter dimension via metric sparsity. - Romain Bourneuf; Marcin Pilipczuk (CoRR, 2024)

Embedding Planar Graphs into Graphs of Treewidth O(log3 n). - Hsien-Chih Chang; Vincent Cohen-Addad; Jonathan Conroy; Hung Le 001; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2024)

Sparse induced subgraphs in P7-free graphs of bounded clique number. - Maria Chudnovsky; Jadwiga Czyzewska; Kacper Kluk; Marcin Pilipczuk; Pawel Rzazewski (CoRR, 2024)

Cluster Editing Parameterized above Modification-disjoint P3-packings. - Shaohua Li 005; Marcin Pilipczuk; Manuel Sorge (ACM Trans. Algorithms, 2024)

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in ( boldsymbol{H} )-Free Graphs. - Maria Chudnovsky; Marcin Pilipczuk; Michal Pilipczuk; Stéphan Thomassé (SIAM J. Comput., 2024)

On Weighted Graph Separation Problems and Flow Augmentation. - Eun Jung Kim 002; Tomás Masarík; Marcin Pilipczuk; Roohani Sharma; Magnus Wahlström (SIAM J. Discret. Math., 2024)

Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. - Meike Hatzel; Gwenaël Joret; Piotr Micek; Marcin Pilipczuk; Torsten Ueckerdt; Bartosz Walczak (Comb., 2024)

Flow-augmentation II: Undirected Graphs. - Eun Jung Kim 002; Stefan Kratsch; Marcin Pilipczuk; Magnus Wahlström (ACM Trans. Algorithms, 2024)

Faster Diameter Computation in Graphs of Bounded Euler Genus. - Kacper Kluk; Marcin Pilipczuk; Michal Pilipczuk; Giannos Stamoulis (ICALP, 2025)

Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument. - Romain Bourneuf; Jana Masaríková; Wojciech Nadara; Marcin Pilipczuk (MFCS, 2025)

Bounding ε-scatter dimension via metric sparsity. - Romain Bourneuf; Marcin Pilipczuk (SODA, 2025)

Embedding Planar Graphs into Graphs of Treewidth O (log3 n ). - Hsien-Chih Chang; Vincent Cohen-Addad; Jonathan Conroy; Hung Le 001; Marcin Pilipczuk; Michal Pilipczuk (SODA, 2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number. - Marcin Pilipczuk; Pawel Rzazewski (Discret. Math. Theor. Comput. Sci., 2025)

Polynomial-Time Approximation Schemes for Facility Location on Planar Graphs. - Vincent Cohen-Addad; Marcin Pilipczuk; Michal Pilipczuk (SIAM J. Comput., 2025)

On coarse tree decompositions and coarse balanced separators. - Tara Abrishami; Jadwiga Czyzewska; Kacper Kluk; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (CoRR, 2025)

Flow-augmentation I: Directed graphs. - Eun Jung Kim 002; Stefan Kratsch; Marcin Pilipczuk; Magnus Wahlström (J. ACM, 2025)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs. - Jadwiga Czyzewska; Marcin Pilipczuk (CoRR, 2025)