Michal Pilipczuk
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
124
Venues
15
Active years
2010–2026
Best venue rank
A*
Where they publish
Papers
124 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Dynamic Detours. | Daniel Dadush, Michal Pilipczuk, Amadeus Reinald, Marek Sokolowski, Michal Wlodarczyk |
| 2026 | IPCO | On Integer Programs That Look Like Paths. | Marcin Brianski, Alexandra Lassota, Kristna Pekrkov, Michal Pilipczuk, Janina Reuter |
| 2026 | LICS | Low Rank MSO. | Mikolaj Bojanczyk, Michal Pilipczuk, Wojciech Przybyszewski, Marek Sokolowski, Giannos Stamoulis |
| 2026 | SODA | Planar Disjoint Shortest Paths is Fixed-Parameter Tractable. | Michal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk |
| 2026 | STOC | Efficient Reversal of Transductions of Sparse Graph Classes. | Jan Dreier, Jakub Gajarsk, Michal Pilipczuk |
| 2026 | STOC | Pattern-Sparse Tree Decompositions in H-Minor-Free Graphs. | Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2025 | ICALP | Separability Properties of Monadically Dependent Graph Classes. | douard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mhlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2025 | ICALP | Faster Diameter Computation in Graphs of Bounded Euler Genus. | Kacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Giannos Stamoulis |
| 2025 | LICS | 3D-grids are not transducible from planar graphs. | Jakub Gajarsk, Michal Pilipczuk, Filip Pokrvka |
| 2025 | SODA | Embedding Planar Graphs into Graphs of Treewidth | Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michal Pilipczuk |
| 2025 | WG | On Graphs Coverable by Chubby Shortest Paths. | Meike Hatzel, Michal Pilipczuk |
| 2024 | ESA | Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. | Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki |
| 2024 | ESA | Parameterized Dynamic Data Structure for Split Completion. | Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz |
| 2024 | FOCS | First-Order Model Checking on Monadically Stable Graph Classes. | Jan Dreier, Ioannis Eleftheriadis, Nikolas Mhlmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk |
| 2024 | FOCS | Minor Containment and Disjoint Paths in Almost-Linear Time. | Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis |
| 2024 | LICS | Elementary first-order model checking for sparse graphs. | Jakub Gajarsk, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk |
| 2024 | SODA | Sparse induced subgraphs in | Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2024 | SODA | Parameterized algorithms for block-structured integer programs with large entries. | Jana Cslovjecsek, Martin Kouteck, Alexandra Lassota, Michal Pilipczuk, Adam Polak |
| 2024 | SODA | A polynomial-time OPT | Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki |
| 2024 | SODA | Cliquewidth and Dimension. | Gwenal Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak |
| 2024 | SODA | Fully dynamic approximation schemes on planar and apex-minor-free graphs. | Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski |
| 2024 | SODA | Shortest Disjoint Paths on a Grid. | Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski |
| 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 | Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane. | Katarzyna Anna Kowalska, Michal Pilipczuk |
| 2023 | ESA | Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. | Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kant, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen |
| 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 | FOCS | Dynamic treewidth. | Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski |
| 2023 | ICALP | Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. | Hans L. Bodlaender, Carla Groenland, Michal Pilipczuk |
| 2023 | ICALP | Flipper Games for Monadically Stable Graph Classes. | Jakub Gajarsk, Nikolas Mhlmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk |
| 2023 | ICALP | Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. | Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2023 | STACS | On Rational Recursive Sequences. | Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk |
| 2023 | STACS | Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number. | Konrad Majewski, Michal Pilipczuk, Marek Sokolowski |
| 2023 | STACS | Dynamic Data Structures for Parameterized String Problems. | Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz |
| 2022 | ESA | Polynomial Kernel for Immersion Hitting in Tournaments. | Lukasz Bozyk, Michal Pilipczuk |
| 2022 | ESA | Computing Treedepth in Polynomial Space and Linear FPT Time. | Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz |
| 2022 | ICALP | Twin-Width and Types. | Jakub Gajarsk, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2022 | ICALP | Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures. | Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny |
| 2022 | LICS | Treelike Decompositions for Transductions of Sparse Graphs. | Jan Dreier, Jakub Gajarsk, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk |
| 2022 | LICS | Stable graphs of bounded twin-width. | Jakub Gajarsk, Michal Pilipczuk, Szymon Torunczyk |
| 2022 | STOC | Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. | Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2022 | STACS | Isolation Schemes for Problems on Decomposable Graphs. | Jesper Nederlof, Michal Pilipczuk, Cline M. F. Swennenhuis, Karol Wegrzycki |
| 2022 | STACS | Compact Representation for Matrices of Bounded Twin-Width. | Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz |
| 2021 | ESA | Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. | Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel |
| 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 | Rankwidth meets stability. | Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2021 | STOC | Finding large induced sparse subgraphs in | Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2020 | ESA | Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. | Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl |
| 2020 | ICALP | On Polynomial Recursive Sequences. | Michal Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Graud Snizergues |
| 2020 | MFCS | VC Density of Set Systems Definable in Tree-Like Graphs. | Adam Paszke, Michal Pilipczuk |
| 2020 | SODA | Shorter Labeling Schemes for Planar Graphs. | Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk |
| 2020 | SODA | Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in | Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stphan Thomass |
| 2020 | STOC | An exponential time parameterized algorithm for planar disjoint paths. | Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi |
| 2020 | WG | Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. | Jesper Nederlof, Michal Pilipczuk, Cline M. F. Swennenhuis, Karol Wegrzycki |
| 2019 | CONCUR | Reachability for Bounded Branching VASS. | Filip Mazowiecki, Michal Pilipczuk |
| 2019 | ESA | On Geometric Set Cover for Orthants. | Karl Bringmann, Sndor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen |
| 2019 | ESA | Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs. | Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk |
| 2019 | FOCS | A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. | Vincent Cohen-Addad, Michal Pilipczuk, Marcin Pilipczuk |
| 2019 | IPCO | Integer Programming and Incidence Treedepth. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna |
| 2019 | SODA | Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. | Andrzej Grzesik, Tereza Klimosov, Marcin Pilipczuk, Michal Pilipczuk |
| 2019 | SODA | Polynomial bounds for centered colorings on proper minor-closed graph classes. | Michal Pilipczuk, Sebastian Siebertz |
| 2019 | STACS | Progressive Algorithms for Domination and Independence. | Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2019 | STACS | Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. | Dusan Knop, Michal Pilipczuk, Marcin Wrochna |
| 2018 | ESA | Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. | Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese |
| 2018 | FOCS | On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. | Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2018 | ICALP | First-Order Interpretations of Bounded Expansion Classes. | Jakub Gajarsk, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2018 | LICS | Definable decompositions for graphs of bounded linear cliquewidth. | Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk |
| 2018 | LICS | Parameterized circuit complexity of model-checking on sparse structures. | Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2018 | LICS | On the number of types in sparse graphs. | Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2018 | WG | On Directed Feedback Vertex Set Parameterized by Treewidth. | Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna |
| 2017 | ESA | Tight Lower Bounds for the Complexity of Multicoloring. | Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna |
| 2017 | ICALP | Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. | Florian Barbero, Christophe Paul, Michal Pilipczuk |
| 2017 | ICALP | Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. | Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2017 | ICALP | Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. | Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna |
| 2017 | LICS | Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. | Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz |
| 2017 | MFCS | On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk). | Michal Pilipczuk |
| 2017 | MFCS | Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. | Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese |
| 2017 | SODA | Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. | Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna |
| 2017 | STACS | Optimizing Tree Decompositions in MSO. | Mikolaj Bojanczyk, Michal Pilipczuk |
| 2017 | WG | On Low Rank-Width Colorings. | O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz |
| 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 | FOSSACS | Shortest Paths in One-Counter Systems. | Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar |
| 2016 | LICS | Definability equals recognizability for graphs of bounded treewidth. | Mikolaj Bojanczyk, Michal Pilipczuk |
| 2016 | MFCS | The Generalised Colouring Numbers on Classes of Bounded Expansion. | Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2016 | PODS | Schema Validation via Streaming Circuits. | Filip Murlak, Charles Paperman, Michal Pilipczuk |
| 2016 | SODA | Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems. | Ivan Bliznets, Marek Cygan, Pawel Komosa, Luks Mach, Michal Pilipczuk |
| 2016 | SODA | Subexponential parameterized algorithm for Interval Completion. | Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk |
| 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 |
| 2016 | STACS | On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. | Michal Pilipczuk, Marcin Wrochna |
| 2015 | ESA | A Polynomial Kernel for Trivially Perfect Editing. | Pl Grns Drange, Michal Pilipczuk |
| 2015 | ESA | Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. | Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk |
| 2015 | ESA | Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. | Dniel Marx, Michal Pilipczuk |
| 2015 | WG | Polynomial Kernelization for Removing Induced Claws and Diamonds. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna |
| 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 | ICDT | Synthesizing transformations from XML schema mappings. | Claire David, Piotr Hofman, Filip Murlak, Michal Pilipczuk |
| 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 |
| 2014 | STACS | Exploring Subexponential Parameterized Complexity of Completion Problems. | Pl Grns Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger |
| 2014 | STACS | Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). | Dniel Marx, Michal Pilipczuk |
| 2013 | ESA | Largest Chordal and Interval Subgraphs Faster Than 2 n. | Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger |
| 2013 | ESA | Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph. | Fedor V. Fomin, Michal Pilipczuk |
| 2013 | FOCS | An O(c^k n) 5-Approximation Algorithm for Treewidth. | Hans L. Bodlaender, Pl Grns Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk |
| 2013 | FOCS | The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable. | Marek Cygan, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |
| 2013 | SODA | Known algorithms for EDGE CLIQUE COVER are probably optimal. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk |
| 2013 | SODA | Jungles, bundles, and fixed parameter tractability. | Fedor V. Fomin, 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 | Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. | Michal Pilipczuk |
| 2013 | STACS | Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
| 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 | Minimizing Rosenthal Potential in Multicast Games. | Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk |
| 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 |
| 2012 | WG | How to Eliminate a Graph. | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Danil Paulusma, 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 | MFCS | Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach. | Michal Pilipczuk |
| 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 | WG | Kernelization Hardness of Connectivity Problems in | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |