Marcin Pilipczuk
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
75
Venues
13
Active years
2008–2026
Best venue rank
A*
Where they publish
Papers
75 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STOC | Pattern-Sparse Tree Decompositions in H-Minor-Free Graphs. | Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2025 | ICALP | Faster Diameter Computation in Graphs of Bounded Euler Genus. | Kacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Giannos Stamoulis |
| 2025 | ISAAC | Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number. | Maria Chudnovsky, Jadwiga Czyzewska, Kacper Kluk, Marcin Pilipczuk, Pawel Rzazewski |
| 2025 | MFCS | Graphs with No Long Claws: An Improved Bound for the Analog of the Gyrfs' Path Argument. | Romain Bourneuf, Jana Masarkov, Wojciech Nadara, Marcin Pilipczuk |
| 2025 | SODA | Bounding | Romain Bourneuf, Marcin Pilipczuk |
| 2025 | SODA | Embedding Planar Graphs into Graphs of Treewidth | Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michal Pilipczuk |
| 2024 | ESA | Parameterized Complexity of MinCSP over the Point Algebra. | George Osipov, Marcin Pilipczuk, Magnus Wahlstrm |
| 2024 | SODA | Sparse induced subgraphs in | Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2024 | STOC | Combinatorial Correlation Clustering. | Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang |
| 2024 | STOC | Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. | Peter Gartland, Daniel Lokshtanov, Toms Masark, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2024 | STACS | Max Weight Independent Set in Sparse Graphs with No Long Claws. | Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski |
| 2023 | AAAI | The Influence of Dimensions on the Complexity of Computing Decision Trees. | Stephen G. Kobourov, Maarten Lffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms |
| 2023 | FOCS | Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. | Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk |
| 2023 | SODA | Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2023 | SODA | 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, Toms Masark, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge |
| 2023 | SODA | A tight quasi-polynomial bound for Global Label Min-Cut. | Lars Jaffke, Paloma T. Lima, Toms Masark, Marcin Pilipczuk, Uverton S. Souza |
| 2022 | ESA | Taming Graphs with No Large Creatures and Skinny Ladders. | Jakub Gajarsk, Lars Jaffke, Paloma T. Lima, Jana Novotn, Marcin Pilipczuk, Pawel Rzazewski, Uverton S. Souza |
| 2022 | ICALP | Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyrfs' Path Argument. | Konrad Majewski, Toms Masark, Jana Novotn, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski |
| 2022 | STOC | Directed flow-augmentation. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2022 | STOC | Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. | Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2022 | WG | Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. | Hugo Jacob, Marcin Pilipczuk |
| 2021 | SODA | Induced subgraphs of bounded treewidth and the container method. | Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour |
| 2021 | SODA | Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. | Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wrblewski, Anna Zych-Pawlewicz |
| 2021 | SODA | Solving hard cut problems via flow-augmentation. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2021 | SODA | Optimal Discretization is Fixed-parameter Tractable. | Stefan Kratsch, Toms Masark, Irene Muzi, Marcin Pilipczuk, Manuel Sorge |
| 2021 | STOC | Finding large induced sparse subgraphs in | Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2021 | STACS | Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. | Shaohua Li, Marcin Pilipczuk, Manuel Sorge |
| 2020 | ISAAC | The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. | Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge |
| 2020 | SODA | Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in | Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stphan Thomass |
| 2019 | ESA | Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs. | Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk |
| 2019 | ESA | Improved Bounds for the Excluded-Minor Approximation of Treedepth. | Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk |
| 2019 | ESA | Packing Directed Circuits Quarter-Integrally. | Toms Masark, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge |
| 2019 | FOCS | A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. | Vincent Cohen-Addad, Michal Pilipczuk, Marcin Pilipczuk |
| 2019 | SODA | Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. | Andrzej Grzesik, Tereza Klimosov, Marcin Pilipczuk, Michal Pilipczuk |
| 2019 | STACS | 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 |
| 2018 | FOCS | On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. | Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2018 | WG | An Improved FPT Algorithm for Independent Feedback Vertex Set. | Shaohua Li, Marcin Pilipczuk |
| 2017 | ESA | Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. | Dniel Marx, Marcin Pilipczuk |
| 2017 | SODA | Approximation and Kernelization for Chordal Vertex Deletion. | Bart M. P. Jansen, Marcin Pilipczuk |
| 2016 | FOCS | Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. | Fedor V. Fomin, Daniel Lokshtanov, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2016 | ICALP | Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. | Chandra Chekuri, Alina Ene, Marcin Pilipczuk |
| 2016 | SODA | Subexponential parameterized algorithm for Interval Completion. | Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk |
| 2016 | SODA | Independence and Efficient Domination on | Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen |
| 2016 | SODA | Directed multicut is | Marcin Pilipczuk, Magnus Wahlstrm |
| 2016 | STACS | Kernelization and Sparseness: the Case of Dominating Set. | Pl Grns Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Snchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar |
| 2015 | STOC | The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. | Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych |
| 2015 | WG | Polynomial Kernelization for Removing Induced Claws and Diamonds. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna |
| 2014 | CSR | A Fast Branching Algorithm for Cluster Vertex Deletion. | Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk |
| 2014 | ESA | A Subexponential Parameterized Algorithm for Proper Interval Completion. | Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk |
| 2014 | FOCS | Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. | Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2014 | FOCS | Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
| 2014 | MFCS | Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth. | Marek Cygan, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2014 | STOC | Minimum bisection is fixed parameter tractable. | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2013 | FOCS | The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable. | Marek Cygan, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2013 | ICALP | Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree. | Marek Cygan, Marcin Pilipczuk |
| 2013 | SODA | Known algorithms for EDGE CLIQUE COVER are probably optimal. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk |
| 2013 | STACS | Tight bounds for Parameterized Complexity of Cluster Editing. | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger |
| 2013 | STACS | Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
| 2012 | ESA | A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. | Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski |
| 2012 | FOCS | Designing FPT Algorithms for Cut Problems Using Randomized Contractions. | Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk |
| 2012 | ICALP | Clique Cover and Graph Separation: New Incompressibility Results. | Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlstrm |
| 2012 | ICALP | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. | Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlstrm |
| 2012 | LATIN | Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2012 | MFCS | Sitting Closer to Friends Than Enemies, Revisited. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2012 | WG | On Group Feedback Vertex Set Parameterized by the Size of the Cutset. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk |
| 2011 | ESA | Scheduling Partially Ordered Jobs Faster Than 2 n. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2011 | FOCS | 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 |
| 2011 | ICALP | Subset Feedback Vertex Set Is Fixed-Parameter Tractable. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2011 | SODA | 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 |
| 2011 | WG | Parameterized Complexity of Eulerian Deletion Problems. | Marek Cygan, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildik Schlotter |
| 2010 | CIAC | Irredundant Set Faster Than | Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2010 | ESA | Fast Approximation in Subspaces by Doubling Metric Decomposition. | Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
| 2010 | WG | Kernelization Hardness of Connectivity Problems in | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2009 | ICALP | Exact and Approximate Bandwidth. | Marek Cygan, Marcin Pilipczuk |
| 2008 | WG | Faster Exact Bandwidth. | Marek Cygan, Marcin Pilipczuk |