Homepage of Michał Pilipczuk: publications

Unpublished

Jakub Gajarský, Michał Pilipczuk, Szymon Toruńczyk,
Stable graphs of bounded twin-width,
unpublished, available at [arxiv]

Konrad Majewski, Michał Pilipczuk, Marek Sokołowski,
Maintaining CMSO₂ properties on dynamic structures with bounded feedback vertex number,
unpublished, available at [arxiv]

Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, Karol Węgrzycki,
Isolation schemes for problems on decomposable graphs,
unpublished, available at [arxiv]

Łukasz Bożyk, Oscar Defrain, Michał Pilipczuk, Karolina Okrasa,
On objects dual to tree-cut decompositions,
unpublished, available at [arxiv]

Łukasz Bożyk, Michał Pilipczuk,
On the Erdős-Pósa property for immersions and topological minors in tournaments,
unpublished, available at [arxiv]

Marthe Bonamy, Michał Pilipczuk, Jean-Sébastien Sereni,
On the effect of symmetry requirement for rendezvous on the complete graph,
unpublished, available at [arxiv]

Marthe Bonamy, François Dross, Tomáš Masařík, Wojciech Nadara, Marcin Pilipczuk, Michał Pilipczuk,
Jones' Conjecture in subcubic graphs,
unpublished, available at [arxiv]

Accepted

Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk, Moritz Venzin, Robert Weismantel,
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity,
accepted to ESA 2021, available at [arxiv]

Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk, Gabriele Puppis, Cristian Riveros,
The monitoring problem for timed automata,
accepted to IPEC 2021, available at [arxiv]

Published

Daniel Lokshtanov, Peter Gartland, Michał Pilipczuk, Marcin Pilipczuk, Paweł Rzążewski,
Finding large induced sparse subgraphs in C_>t-free graphs in quasipolynomial time,
STOC 2021, available at [arxiv]

Michał Pilipczuk, Marcin Pilipczuk, Paweł Rzążewski,
Quasi-polynomial-time algorithm for Independent Set in P_t-free graphs via shrinking the space of induced paths,
SOSA 2021, available at [arxiv]

Jiehua Chen, Wojciech Czerwiński, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michał Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartłomiej Wróblewski, Anna Zych-Pawlewicz,
On dynamic parameterized k-path,
SODA 2021, available at [arxiv]

Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk, Roman Rabinovich, Sebastian Siebertz,
Rankwidth meets stability,
SODA 2021, available at [arxiv]

Maria Chudnovsky, Jason King, Michał Pilipczuk, Paweł Rzążewski, Sophie Spirkl,
Finding large H-colorable subgraphs in hereditary graph classes,
ESA 2020, available at [arxiv]

Adam Paszke, Michał Pilipczuk,
VC density of set systems definable in tree-like graphs,
MFCS 2020, available at [arxiv]

Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk, Michał Pilipczuk,
Covering minimal separators and potential maximal cliques in P_t-free graphs,
Electronic Journal of Combinatorics 28(1): P1.29, available at [arxiv]

Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk, Xuding Zhu,
Clustering powers of sparse graphs,
Electronic Journal of Combinatorics 27(4): P4.17, available at [arxiv]

Maria Chudnovsky, Marcin Pilipczuk, Michał Pilipczuk, Stéphan Thomassé,
On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five,
SIAM Journal on Discrete Mathematics 34(2), available at [arxiv]

Marek Cygan, Paweł Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh,
Randomized contractions meet lean decompositions,
ACM Transactions on Algorithms 17(1): 6:1-6:30, available at [arxiv]

Michał Pilipczuk, Sebastian Siebertz,
Kernelization and approximation of distance-r independent sets on nowhere dense graphs,
European Journal of Combinatorics 94: 103309, available at [arxiv]

Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, Karol Węgrzycki
Hamiltonian Cycle parameterized by treedepth in single exponential time and polynomial space,
WG 2020, available at [arxiv]

Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michał Pilipczuk, Géraud Sénizergues
On polynomial recursive sequences,
ICALP 2020, available at [arxiv]

Daniel Lokshtanov, Pranabendu Misra, Michał Pilipczuk, Saket Saurabh, Meirav Zehavi,
An exponential time parameterized algorithm for Planar Disjoint Paths,
STOC 2020, available at [arxiv]

Marthe Bonamy, Michał Pilipczuk,
Graphs of bounded cliquewidth are polynomially chi-bounded,
Advances in Combinatorics, available at [arxiv]

Marthe Bonamy, Cyril Gavoille, Michał Pilipczuk,
Shorter labeling schemes for planar graphs,
SODA 2020, available at [arxiv]

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,
SODA 2020, available at [arxiv]

Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk,
A polynomial-time approximation scheme for Facility Location on planar graphs,
FOCS 2019, available at [arxiv]

Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak,
Subexponential-time algorithms for finding large induced sparse subgraphs,
IPEC 2019, available at [arxiv]

Karl Bringmann, Sándor Kisfaludi-Bak, Michał Pilipczuk, Erik Jan van Leeuwen,
On geometric Set Cover for orthants,
ESA 2019

Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk,
Efficient approximation schemes for uniform-cost clustering problems in planar graphs,
ESA 2019, available at [arxiv]

Filip Mazowiecki, Michał Pilipczuk,
Reachability for Bounded Branching VASS,
CONCUR 2019, available at [arxiv]

Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak, Michał Pilipczuk, Marcin Wrochna,
Integer programming and incidence treedepth,
IPCO 2019

Grzegorz Fabiański, Michał Pilipczuk, Szymon Toruńczyk, Sebastian Siebertz,
Progressive algorithms for domination and independence,
STACS 2019, available at [arxiv]

Dušan Knop, Michał Pilipczuk, Marcin Wrochna,
Tight complexity lower bounds for integer linear programming with few constraints,
STACS 2019, available at [arxiv]

Michał Pilipczuk, Sebastian Siebertz,
Polynomial bounds for centered colorings on proper minor-closed graph classes,
SODA 2019, available at [arxiv]

Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk, Michał Pilipczuk,
Polynomial-time algorithm for Maximum Weight Independent Set on P₆-free graphs,
SODA 2019, available at [arxiv]

Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk,
On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs,
FOCS 2018, available at [arxiv]

Florian Barbero, Christophe Paul, Michał Pilipczuk,
Strong immersion is a well-quasi-ordering for semi-complete digraphs,
Journal of Graph Theory, available at [arxiv]

Daniel Lokshtanov, Michał Pilipczuk, Saket Saurabh,
Below all subsets for Minimal Connected Dominating Set,
SIAM Journal on Discrete Mathematics (SIDMA), available at [arxiv]

Michał Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese,
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs,
ESA 2017, available at [arxiv]

Marthe Bonamy, Łukasz Kowalik, Jesper Nederlof, Michał Pilipczuk, Arkadiusz Socała, Marcin Wrochna,
On Directed Feedback Vertex Set parameterized by treewidth,
WG 2018, available at [arxiv]

Jakub Gajarský, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk, Sebastian Siebertz, Szymon Toruńczyk,
First-order interpretations of bounded expansion classes,
ICALP 2018, available at [arxiv]

Mikołaj Bojańczyk, Martin Grohe, Michał Pilipczuk,
Definable decompositions for graphs of bounded linear cliquewidth,
LICS 2018, available at [arxiv]

Michał Pilipczuk, Sebastian Siebertz, Szymon Toruńczyk,
Parameterized circuit complexity of model-checking on sparse structures,
LICS 2018, available at [arxiv]

Michał Pilipczuk, Sebastian Siebertz, Szymon Toruńczyk,
On the number of types in sparse graphs,
LICS 2018, available at [arxiv]

Michał Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese,
Approximation and parameterized algorithms for geometric independent set with shrinking,
MFCS 2017, available at [arxiv]

Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk, Arkadiusz Socała, Marcin Wrochna,
Tight lower bounds for the complexity of multicoloring,
ESA 2017, available at [arxiv]

Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michał Pilipczuk,
Hardness of approximation for strip packing,
ACM Transactions on Computation Theory (TOCT), available at [arxiv]

Florian Barbero, Christophe Paul, Michał Pilipczuk,
Exploring the complexity of layout parameters in tournaments and semi-complete digraphs,
ICALP 2017, available at [arxiv]

Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michał Pilipczuk, Roman Rabinovich, Sebastian Siebertz,
Neighborhood complexity and kernelization for nowhere dense classes of graphs,
ICALP 2017, available at [arxiv]

Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna,
Linear kernels for edge deletion problems to immersion-closed graph classes,
ICALP 2017, available at [arxiv]

O-joung Kwon, Michał Pilipczuk, Sebastian Siebertz,
On low rank-width colorings,
WG 2017, available at [arxiv]

Jan van den Heuvel, Stephan Kreutzer, Michał Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz,
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion,
LICS 2017, available at [arxiv], combined journal submission available here: [arxiv]

Mikołaj Bojańczyk, Michał Pilipczuk,
Optimizing tree decompositions in MSO,
STACS 2017, available at [arxiv]

Fedor V. Fomin, Daniel Lokshtanov, Michał Pilipczuk, Saket Saurabh, Marcin Wrochna,
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth,
SODA 2017, available at [arxiv]

Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna,
Cutwidth: obstructions and algorithmic aspects,
IPEC 2016, available at [arxiv]

Marcin Pilipczuk, Michał Pilipczuk, Marcin Wrochna,
Edge Bipartization faster than 2^k,
IPEC 2016, available at [arxiv]

Ivan Bliznets, Marek Cygan, Paweł Komosa, Michał Pilipczuk,
Hardness of approximation for H-free edge modification problems,
APPROX 2016, available at [arxiv]

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,
FOCS 2016, available at [arxiv]

Stephan Kreutzer, Michał Pilipczuk, Roman Rabinovich, Sebastian Siebertz
The generalised colouring numbers on classes of bounded expansion,
MFCS 2016, available at [arxiv]

Mikołaj Bojańczyk, Michał Pilipczuk,
Definability equals recognizability for graphs of bounded treewidth,
LICS 2016, available at [arxiv]

Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh,
Lower bounds for approximation schemes for Closest String,
SWAT 2016, available at [arxiv]

Charles Paperman, Filip Murlak, Michał Pilipczuk,
Schema validation via streaming circuits,
PODS 2016

Michał Pilipczuk, Szymon Toruńczyk,
On ultralimits of sparse graph classes,
Electronic Journal of Combinatorics 23(2): P2.32, available at [arxiv]

Dmitry Chistikov, Wojciech Czerwiński, Piotr Hofman, Michał Pilipczuk, Michael Wehar,
Shortest runs in one counter systems,
FoSSaCS 2016, available at [arxiv]

Michał Pilipczuk, Marcin Wrochna,
On space efficiency of algorithms working on structural decompositions of graphs,
STACS 2016, available at [arxiv]

Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar,
Kernelization and Sparseness: the case of Dominating Set,
STACS 2016, available at [arxiv] (new results and one more coauthor!)

Ivan Bliznets, Marek Cygan, Paweł Komosa, Lukáš Mach, Michał Pilipczuk,
Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems,
SODA 2016, available at [arxiv]

Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michał Pilipczuk,
A subexponential parameterized algorithm for Interval Completion,
SODA 2016, available at [arxiv]

Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk, Arkadiusz Socała
Linear kernels for outbranching problems in sparse digraphs,
IPEC 2015, available at [arxiv]

Pål Grønås Drange, Michał Pilipczuk,
A polynomial kernel for Trivially Perfect Editing,
ESA 2015, available at [arxiv]

Dániel Marx, Michał Pilipczuk,
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams,
ESA 2015, available at [arxiv]

Ariel Gabizon, Daniel Lokshtanov, Michał Pilipczuk,
Fast algorithms for parameterized problems with relaxed disjointness constraints,
ESA 2015, available at [arxiv]

Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michał Pilipczuk,
How to hunt an invisible rabbit on a graph,
European Journal of Combinatorics 52(A) (2016), presented at CTW 2015, available at [arxiv]

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna,
Polynomial kernelization for removing induced claws and diamonds,
WG 2015, available at [arxiv]

Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh,
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth,
FOCS 2014, available at [arxiv]

Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen,
Network sparsification for Steiner problems on planar and bounded-genus graphs,
FOCS 2014, available at [arxiv]

Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michał Pilipczuk,
A subexponential parameterized algorithm for Proper Interval Completion,
ESA 2014, available at [arxiv]

Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk,
Hitting forbidden subgraphs in graphs of bounded treewidth,
MFCS 2014, available at [arxiv]

Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh,
Minimum Bisection is fixed-parameter tractable,
STOC 2014, available at [arxiv]

Claire David, Piotr Hofman, Filip Murlak, Michał Pilipczuk,
Synthesizing transformations from XML schema mappings,
ICDT 2014

Pål Grønås Drange, Fedor V. Fomin, Michał Pilipczuk, Yngve Villanger,
Exploring Subexponential Parameterized Complexity of Completion Problems,
STACS 2014, available at [arxiv]

Dániel Marx, Michał Pilipczuk,
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism
(but were afraid to ask),
STACS 2014, available at [arxiv]

Hans L. Bodlaender, Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michał Pilipczuk,
An O(c^k n) 5-approximation algorithm for treewidth,
FOCS 2013, available at [arxiv]

Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk,
The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable,
FOCS 2013, available at [arxiv]

Fedor V. Fomin, Archontia C. Giannopoulou, Michał Pilipczuk,
Computing tree-depth faster than 2ⁿ,
IPEC 2013, journal version in Algorithmica online first (2014), available at [arxiv]

Ivan Bliznets, Fedor V. Fomin, Michał Pilipczuk, Yngve Villanger,
Largest chordal and interval subgraphs faster than 2ⁿ,
ESA 2013, revised version available at [arxiv]

Fedor V. Fomin, Michał Pilipczuk,
Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph,
ESA 2013, available at [arxiv]

Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen,
Subexponential-time parameterized algorithm for Steiner tree on planar graphs,
STACS 2013

Michał Pilipczuk,
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings,
STACS 2013, available at [arxiv]

Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, Yngve Villanger,
Tight bounds for parameterized complexity of Cluster Editing,
STACS 2013, journal version in JCSS 80(7) (2014) under the name
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters, available at [arxiv]

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk,
Known algorithms for Edge Clique Cover are probably optimal,
SODA 2013, available at [arxiv]

Fedor V. Fomin, Michał Pilipczuk,
Jungles, bundles, and fixed parameter tractability,
SODA 2013, available at [arxiv]

Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michał Pilipczuk,
Designing FPT algorithms for cut problems using randomized contractions,
FOCS 2012, available at [arxiv]

Fedor V. Fomin, Bart M. P. Jansen, Michał Pilipczuk,
Preprocessing subgraph and minor problems: when does a small vertex cover help?,
IPEC 2012, journal version in JCSS 80(2) (2014), available at [arxiv]

Marcin Pilipczuk, Michał Pilipczuk,
Finding a maximum induced degenerate subgraph faster than 2ⁿ,
IPEC 2012, available at [arxiv]

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Sitting closer to friends than enemies, revisited,
MFCS 2012, journal version in ToCS 56(2) (2015), available at [arxiv]

Marcin Pilipczuk, Michał Pilipczuk, Riste Škrekovski,
Some results on Vizing's conjecture and related problems,
DAM 160(16-17) (2012)

Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, Magnus Wahlström,
Clique cover and graph separation: New incompressibility results,
ICALP 2012 (track A), journal version in ACM TOCT 6(2):6 (2014), available at [arxiv]

Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, Magnus Wahlström,
Fixed-parameter tractability of multicut in directed acyclic graphs,
ICALP 2012 (track A), available at [arxiv]

Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michał Pilipczuk,
Minimizing Rosenthal potential in multicast games,
ICALP 2012 (track C), journal version in ToCS online first (2014), available at [arxiv]

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk,
On Group Feedback Vertex Set parameterized by the size of the cutset,
WG 2012 (best student paper award), journal version in Algorithmica online first (2014), available at [arxiv]

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michał Pilipczuk,
How to eliminate a graph,
WG 2012, journal version in Algothmica online first (2013) under the name Modifying a Graph Using Vertex Elimination

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Solving the 2-Disjoint Connected Subgraphs problem faster than 2ⁿ,
LATIN 2012, journal version in Algorithmica 70(2) (2014)

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Scheduling partially ordered jobs faster than 2ⁿ,
ESA 2011, journal version in Algorithmica 68(3) (2014), available at [arxiv]

Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh,
On the hardness of losing width,
IPEC 2011, journal version in ToCS 54(1) (2014)

Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh,
On cutwidth parameterized by vertex cover,
IPEC 2011, journal version in Algorithmica 68(4) (2014)

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
On Multiway Cut parameterized above lower bounds,
IPEC 2011, journal version in ACM TOCT 5(1):3 (2013), available at [arxiv]

Marek Cygan, Michał Pilipczuk, Riste Škrekovski,
On the inequality between radius and Randić index for graphs,
MATCH Commun. Math. Comput. Chem., Volume 67 (2012) number 2

Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Ildikó Schlotter,
Parameterized Complexity of Eulerian Deletion Problems,
WG 2011, journal version in Algorithmica 68(1) (2014)

Michał Pilipczuk,
Problems parameterized by treewidth tractable in single exponential time: a logical approach,
MFCS 2011, available at [arxiv]

Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk,
Solving connectivity problems parameterized by treewidth in single exponential time,
FOCS 2011, full (really full) version available at [arxiv]

Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Dominating Set is fixed parameter tractable in claw-free Graphs,
TCS 412(50) (2011), available at [arxiv]

Marek Cygan, Michał Pilipczuk, Riste Škrekovski,
Relation between Randić index and average distance of trees,
MATCH Commun. Math. Comput. Chem., Volume 66 (2011) number 2

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
The stubborn problem is stubborn no more
(a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem),
SODA 2011, journal version in SICOMP 41(4) (2012), available at [arxiv]

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Subset Feedback Vertex Set is fixed parameter tractable,
ICALP 2011 (track A), journal version in SIDMA 27(1) (2013), available at [arxiv]

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Improved FPT algorithm and quadratic kernel for Pathwidth One Vertex Deletion,
IPEC 2010, journal version in Algorithmica 64(1) (2012)

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Kernelization hardness of connectivity problems in d-degenerate graphs,
WG 2010, journal version in DAM 160(15) (2012)