Michal Pilipczuk

413 papers A* 60A 36B 36C 1Journal 262Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Dynamic data structures for twin-ordered matrices. CoRR Bartlomiej Bosek, Jadwiga Czyzewska, Evangelos Kipouridis, Wojciech Nadara, Michal Pilipczuk, Karol Wegrzycki, Anna Zych-Pawlewicz
2026	J	`jnl`	Efficient reversal of transductions of sparse graph classes. CoRR Jan Dreier, Jakub Gajarský, Michal Pilipczuk
2026	J	`jnl`	Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number. CoRR Daniel Lokshtanov, Michal Pilipczuk, Pawel Rzazewski
2026	J	`jnl`	On digraphs without onion star immersions. J. Comb. Theory B Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
2026	J	`jnl`	Pattern-Sparse Tree Decompositions in H-Minor-Free Graphs. CoRR Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2026	A*	`conf`	Planar Disjoint Shortest Paths is Fixed-Parameter Tractable. SODA Michal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk
2026	J	`jnl`	Tree decompositions whose trees are subgraphs: An application of Simon's factorization. CoRR Romain Bourneuf, Gwenaël Joret, Piotr Micek, Martin Milanic, Michal Pilipczuk
2026	J	`jnl`	Variants of Merge-Width and Applications. CoRR Karolina Drabik, Maël Dumas, Colin Geniet, Jakub Nowakowski, Michal Pilipczuk, Szymon Torunczyk
2025	A*	`conf`	3D-grids are not transducible from planar graphs. LICS Jakub Gajarský, Michal Pilipczuk, Filip Pokrývka
2025	J	`jnl`	3D-grids are not transducible from planar graphs. CoRR Jakub Gajarský, Michal Pilipczuk, Filip Pokrývka
2025	A	`ed.`	42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, Jena, Germany, March 4-7, 2025 STACS Olaf Beyersdorff, Michal Pilipczuk, Elaine Pimentel, Kim Thang Nguyen
2025	B	`conf`	A Note on the Parameterised Complexity of Coverability in Vector Addition Systems. IPEC Michal Pilipczuk, Sylvain Schmitz, Henry Sinclair-Banks
2025	J	`jnl`	A Note on the Parameterised Complexity of Coverability in Vector Addition Systems. CoRR Michal Pilipczuk, Sylvain Schmitz, Henry Sinclair-Banks
2025	J	`jnl`	An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. SIAM J. Comput. Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2025	—	`conf`	Box-Reachability in Vector Addition Systems. RP Shaull Almagor, Itay Hasson, Michal Pilipczuk, Michael Zaslavski
2025	J	`jnl`	Box-Reachability in Vector Addition Systems. CoRR Shaull Almagor, Itay Hasson, Michal Pilipczuk, Michael Zaslavski
2025	A*	`conf`	Embedding Planar Graphs into Graphs of Treewidth SODA Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michal Pilipczuk
2025	A*	`conf`	Faster Diameter Computation in Graphs of Bounded Euler Genus. ICALP Kacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Giannos Stamoulis
2025	J	`jnl`	Faster diameter computation in graphs of bounded Euler genus. CoRR Kacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Giannos Stamoulis
2025	J	`jnl`	First-order transducibility among classes of sparse graphs. CoRR Jakub Gajarský, Jeremi Gladkowski, Jan Jedelský, Michal Pilipczuk, Szymon Torunczyk
2025	J	`jnl`	Graph classes through the lens of logic. CoRR Michal Pilipczuk
2025	J	`jnl`	Low rank MSO. CoRR Mikolaj Bojanczyk, Michal Pilipczuk, Wojciech Przybyszewski, Marek Sokolowski, Giannos Stamoulis
2025	J	`jnl`	Maintaining CMSO ACM Trans. Comput. Theory Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2025	J	`jnl`	Obstructions and dualities for matroid depth parameters. CoRR Jakub Gajarský, Kristýna Pekárková, Michal Pilipczuk
2025	B	`conf`	On Graphs Coverable by Chubby Shortest Paths. WG Meike Hatzel, Michal Pilipczuk
2025	J	`jnl`	On Integer Programs That Look Like Paths. CoRR Marcin Brianski, Alexandra Lassota, Kristýna Pekárková, Michal Pilipczuk, Janina Reuter
2025	J	`jnl`	On coarse tree decompositions and coarse balanced separators. CoRR Tara Abrishami, Jadwiga Czyzewska, Kacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2025	J	`jnl`	On graphs coverable by chubby shortest paths. CoRR Meike Hatzel, Michal Pilipczuk
2025	J	`jnl`	Parameterized algorithms for block-structured integer programs with large entries. TheoretiCS Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2025	J	`jnl`	Planar Disjoint Shortest Paths is Fixed-Parameter Tractable. CoRR Michal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk
2025	J	`jnl`	Polynomial-Time Approximation Schemes for Facility Location on Planar Graphs. SIAM J. Comput. Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk
2025	J	`jnl`	Preface. Eur. J. Comb. Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan
2025	A*	`conf`	Separability Properties of Monadically Dependent Graph Classes. ICALP Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mählmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2025	J	`jnl`	Separability Properties of Monadically Dependent Graph Classes. CoRR Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mählmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2025	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ACM Trans. Comput. Theory Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2025	J	`jnl`	Strong Odd Colorings in Graph Classes of Bounded Expansion. Electron. J. Comb. Michal Pilipczuk
2025	J	`jnl`	Strong odd colorings in graph classes of bounded expansion. CoRR Michal Pilipczuk
2025	J	`jnl`	Transducing paths in graph classes with unbounded shrubdepth. Eur. J. Comb. Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz
2024	A*	`conf`	A polynomial-time OPT SODA Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2024	A*	`conf`	Cliquewidth and Dimension. SODA Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
2024	—	`conf`	Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. SOSA Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2024	A*	`conf`	Elementary first-order model checking for sparse graphs. LICS Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
2024	J	`jnl`	Elementary first-order model checking for sparse graphs. CoRR Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
2024	J	`jnl`	Embedding Planar Graphs into Graphs of Treewidth O(log CoRR Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michal Pilipczuk
2024	J	`jnl`	Erdös-Pósa property of tripods in directed graphs. CoRR Marcin Brianski, Meike Hatzel, Karolina Okrasa, Michal Pilipczuk
2024	A*	`conf`	First-Order Model Checking on Monadically Stable Graph Classes. FOCS Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk
2024	A*	`conf`	Fully dynamic approximation schemes on planar and apex-minor-free graphs. SODA Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
2024	J	`jnl`	Half-integral Erdös-Pósa property for non-null CoRR Vera Chekan, Colin Geniet, Meike Hatzel, Michal Pilipczuk, Marek Sokolowski, Michal T. Seweryn, Marcin Witkowski
2024	A*	`conf`	Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2024	A*	`conf`	Minor Containment and Disjoint Paths in Almost-Linear Time. FOCS Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis
2024	J	`jnl`	Minor Containment and Disjoint Paths in almost-linear time. CoRR Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis
2024	J	`jnl`	On Polynomial Recursive Sequences. Theory Comput. Syst. Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
2024	A	`conf`	Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. ESA Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2024	A	`conf`	Parameterized Dynamic Data Structure for Split Completion. ESA Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz
2024	A*	`conf`	Parameterized algorithms for block-structured integer programs with large entries. SODA Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2024	A	`conf`	Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane. STACS Katarzyna Anna Kowalska, Michal Pilipczuk
2024	J	`jnl`	Parameterized and approximation algorithms for coverings points with segments in the plane. CoRR Katarzyna Anna Kowalska, Michal Pilipczuk
2024	J	`jnl`	Parameterized dynamic data structure for Split Completion. CoRR Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz
2024	J	`jnl`	Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in $\boldsymbol{H}$-Free Graphs. SIAM J. Comput. Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2024	A*	`conf`	Shortest Disjoint Paths on a Grid. SODA Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski
2024	—	`conf`	Simple and tight complexity lower bounds for solving Rabin games. SOSA Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini
2024	A*	`conf`	Sparse induced subgraphs in SODA Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2023	B	`conf`	A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. IPEC Mathieu Mari, Timothé Picavet, Michal Pilipczuk
2023	J	`jnl`	A parameterized approximation scheme for the 2D-Knapsack problem with wide items. CoRR Michal Pilipczuk, Mathieu Mari, Timothé Picavet
2023	J	`jnl`	A polynomial-time OPT CoRR Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2023	J	`jnl`	Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. Electron. J. Comb. Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
2023	A*	`conf`	Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. ICALP Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2023	J	`jnl`	Canonical decompositions in monadically stable and bounded shrubdepth graph classes. CoRR Pierre Ohlmann, Michal Pilipczuk, Szymon Torunczyk, Wojciech Przybyszewski
2023	J	`jnl`	Cliquewidth and dimension. CoRR Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
2023	J	`jnl`	Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. CoRR Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023	A	`conf`	Dynamic Data Structures for Parameterized String Problems. STACS Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz
2023	A*	`conf`	Dynamic treewidth. FOCS Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
2023	J	`jnl`	Dynamic treewidth. CoRR Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
2023	J	`jnl`	First-Order Model Checking on Monadically Stable Graph Classes. CoRR Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk
2023	A*	`conf`	Flipper Games for Monadically Stable Graph Classes. ICALP Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
2023	J	`jnl`	Flipper games for monadically stable graph classes. CoRR Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
2023	J	`jnl`	Fully dynamic approximation schemes on planar and apex-minor-free graphs. CoRR Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
2023	J	`jnl`	Graphs of bounded twin-width are quasi-polynomially J. Comb. Theory B Michal Pilipczuk, Marek Sokolowski
2023	J	`jnl`	Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. SIAM J. Discret. Math. Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2023	A	`conf`	Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number. STACS Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023	J	`jnl`	Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2023	A	`conf`	On Rational Recursive Sequences. STACS Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
2023	J	`jnl`	On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph. Math. Oper. Res. Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni, Richard Weber
2023	J	`jnl`	On the independence number of intersection graphs of axis-parallel segments. J. Comput. Geom. Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2023	A*	`conf`	Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. ICALP Hans L. Bodlaender, Carla Groenland, Michal Pilipczuk
2023	J	`jnl`	Parameterized algorithms for block-structured integer programs with large entries. CoRR Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2023	J	`jnl`	Partitioning edges of a planar graph into linear forests and a matching. CoRR Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk
2023	J	`jnl`	Partitioning edges of a planar graph into linear forests and a matching. J. Graph Theory Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk
2023	A*	`conf`	Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. FOCS Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk
2023	J	`jnl`	Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. CoRR Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk
2023	J	`jnl`	Simple and tight complexity lower bounds for solving Rabin games. CoRR Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini
2023	—	`conf`	Simpler and faster algorithms for detours in planar digraphs. SOSA Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023	J	`jnl`	Simpler and faster algorithms for detours in planar digraphs. CoRR Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023	A	`conf`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023	J	`jnl`	Sparse induced subgraphs in P_6-free graphs. CoRR Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2022	J	`jnl`	A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs. SIAM J. Comput. Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2022	A*	`conf`	Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures. ICALP Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny
2022	J	`jnl`	Bounding generalized coloring numbers of planar graphs using coin models. CoRR Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
2022	A	`conf`	Compact Representation for Matrices of Bounded Twin-Width. STACS Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz
2022	A	`conf`	Computing Treedepth in Polynomial Space and Linear FPT Time. ESA Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz
2022	J	`jnl`	Computing treedepth in polynomial space and linear fpt time. CoRR Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz
2022	J	`jnl`	Degeneracy of J. Comb. Theory B Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak
2022	J	`jnl`	Dynamic Data Structures for Timed Automata Acceptance. Algorithmica Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
2022	J	`jnl`	Dynamic data structures for parameterized string problems. CoRR Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz
2022	J	`jnl`	Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor. CoRR Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	A*	`conf`	Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. STOC Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	J	`jnl`	Graphs of bounded twin-width are quasi-polynomially χ-bounded. CoRR Michal Pilipczuk, Marek Sokolowski
2022	J	`jnl`	Highly unbreakable graph with a fixed excluded minor are almost rigid. CoRR Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	J	`jnl`	Independence number of intersection graphs of axis-parallel segments. CoRR Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2022	A	`conf`	Isolation Schemes for Problems on Decomposable Graphs. STACS Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2022	J	`jnl`	On Rational Recursive Sequences. CoRR Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
2022	J	`jnl`	On digraphs without onion star immersions. CoRR Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
2022	J	`jnl`	On objects dual to tree-cut decompositions. J. Comb. Theory B Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
2022	B	`conf`	On the Complexity of Problems on Tree-Structured Graphs. IPEC Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
2022	J	`jnl`	On the Complexity of Problems on Tree-structured Graphs. CoRR Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
2022	J	`jnl`	On the Erdős-Pósa property for immersions and topological minors in tournaments. Discret. Math. Theor. Comput. Sci. Lukasz Bozyk, Michal Pilipczuk
2022	J	`jnl`	Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. ACM Trans. Algorithms Dániel Marx, Michal Pilipczuk
2022	J	`jnl`	Optimizing tree decompositions in MSO. Log. Methods Comput. Sci. Mikolaj Bojanczyk, Michal Pilipczuk
2022	J	`jnl`	Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. CoRR Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2022	A	`conf`	Polynomial Kernel for Immersion Hitting in Tournaments. ESA Lukasz Bozyk, Michal Pilipczuk
2022	J	`jnl`	Polynomial kernel for immersion hitting in tournaments. CoRR Lukasz Bozyk, Michal Pilipczuk
2022	J	`jnl`	Polynomial-time Algorithm for Maximum Weight Independent Set on ACM Trans. Algorithms Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2022	J	`jnl`	Shorter Labeling Schemes for Planar Graphs. SIAM J. Discret. Math. Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
2022	J	`jnl`	Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. ACM Trans. Algorithms Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
2022	A*	`conf`	Stable graphs of bounded twin-width. LICS Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk
2022	J	`jnl`	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM J. Comput. Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	J	`jnl`	Transducing paths in graph classes with unbounded shrubdepth. CoRR Michal Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz
2022	A*	`conf`	Treelike Decompositions for Transductions of Sparse Graphs. LICS Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
2022	J	`jnl`	Treelike decompositions for transductions of sparse graphs. CoRR Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
2022	A*	`conf`	Twin-Width and Types. ICALP Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2022	J	`jnl`	Twin-width and types. CoRR Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2021	J	`jnl`	Algorithms and data structures for first-order logic with connectivity under vertex failures. CoRR Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny
2021	J	`jnl`	An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Compact representation for matrices of bounded twin-width. CoRR Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz
2021	J	`jnl`	Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs. Electron. J. Comb. Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2021	J	`jnl`	Definable decompositions for graphs of bounded linear cliquewidth. Log. Methods Comput. Sci. Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
2021	B	`conf`	Dynamic Data Structures for Timed Automata Acceptance. IPEC Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
2021	A	`conf`	Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. ESA Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel
2021	A*	`conf`	Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
2021	J	`jnl`	Erdös-Hajnal Properties for Powers of Sparse Graphs. SIAM J. Discret. Math. Marcin Brianski, Piotr Micek, Michal Pilipczuk, Michal T. Seweryn
2021	J	`jnl`	Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. SIAM J. Discret. Math. Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl
2021	A*	`conf`	Finding large induced sparse subgraphs in STOC Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2021	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers WG Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski
2021	J	`jnl`	Isolation schemes for problems on decomposable graphs. CoRR Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2021	J	`jnl`	Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
2021	J	`jnl`	Kernelization and approximation of distance-r independent sets on nowhere dense graphs. Eur. J. Comb. Michal Pilipczuk, Sebastian Siebertz
2021	J	`jnl`	Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2021	J	`jnl`	Maintaining CMSO CoRR Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2021	J	`jnl`	On objects dual to tree-cut decompositions. CoRR Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
2021	J	`jnl`	Polynomial bounds for centered colorings on proper minor-closed graph classes. J. Comb. Theory B Michal Pilipczuk, Sebastian Siebertz
2021	—	`conf`	Quasi-polynomial-time algorithm for Independent Set in SOSA Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2021	J	`jnl`	Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström
2021	A*	`conf`	Rankwidth meets stability. SODA Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2021	J	`jnl`	Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). Dagstuhl Reports Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan
2021	J	`jnl`	Stable graphs of bounded twin-width. CoRR Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk
2021	J	`jnl`	Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2020	A*	`conf`	An exponential time parameterized algorithm for planar disjoint paths. STOC Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Clustering Powers of Sparse Graphs. Electron. J. Comb. Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Xuding Zhu
2020	J	`jnl`	Clustering powers of sparse graphs. CoRR Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Xuding Zhu
2020	—	`conf`	Computing Tree Decompositions. Treewidth, Kernels, and Algorithms Michal Pilipczuk
2020	J	`jnl`	Covering minimal separators and potential maximal cliques in P CoRR Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2020	J	`jnl`	Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. CoRR Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel
2020	J	`jnl`	Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. ACM Trans. Algorithms Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond
2020	A	`conf`	Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. ESA Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl
2020	J	`jnl`	Finding large $H$-colorable subgraphs in hereditary graph classes. CoRR Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl
2020	J	`jnl`	First-Order Interpretations of Bounded Expansion Classes. ACM Trans. Comput. Log. Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2020	B	`conf`	Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. WG Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2020	J	`jnl`	Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. CoRR Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2020	J	`jnl`	Integer Programming and Incidence Treedepth. CoRR Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
2020	J	`jnl`	Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems. ACM Trans. Algorithms Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk, Lukás Mach
2020	J	`jnl`	Model-Checking on Ordered Structures. ACM Trans. Comput. Log. Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2020	J	`jnl`	On Dynamic Parameterized k-Path. CoRR Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
2020	A*	`conf`	On Polynomial Recursive Sequences. ICALP Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
2020	J	`jnl`	On low rank-width colorings. Eur. J. Comb. O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
2020	J	`jnl`	On polynomial recursive sequences. CoRR Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
2020	J	`jnl`	On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five. SIAM J. Discret. Math. Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2020	J	`jnl`	On the effect of symmetry requirement for rendezvous on the complete graph. CoRR Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni
2020	J	`jnl`	Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2020	A*	`conf`	Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in SODA Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2020	J	`jnl`	Quasi-polynomial-time algorithm for Independent Set in P CoRR Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2020	J	`jnl`	Rankwidth meets stability. CoRR Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2020	A*	`conf`	Shorter Labeling Schemes for Planar Graphs. SODA Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
2020	J	`jnl`	Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation. Algorithmica Christophe Paul, Michal Pilipczuk
2020	J	`jnl`	The monitoring problem for timed automata. CoRR Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
2020	J	`jnl`	Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. ACM Trans. Comput. Theory Dusan Knop, Michal Pilipczuk, Marcin Wrochna
2020	B	`conf`	VC Density of Set Systems Definable in Tree-Like Graphs. MFCS Adam Paszke, Michal Pilipczuk
2020	J	`jnl`	VC density of set systems defnable in tree-like graphs. CoRR Adam Paszke, Michal Pilipczuk
2019	B	`ed.`	13th International Symposium on Parameterized and Exact Computation, IPEC 2018, Helsinki, Finland, August 20-24, 2018 IPEC Christophe Paul, Michal Pilipczuk
2019	A*	`conf`	A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. FOCS Vincent Cohen-Addad, Michal Pilipczuk, Marcin Pilipczuk
2019	J	`jnl`	A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. CoRR Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk
2019	J	`jnl`	Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2019	J	`jnl`	Edge Bipartization Faster than $$2^k$$ 2 k. Algorithmica Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna
2019	A	`conf`	Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs. ESA Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk
2019	J	`jnl`	Efficient approximation schemes for uniform-cost clustering problems in planar graphs. CoRR Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk
2019	J	`jnl`	Graphs of bounded cliquewidth are polynomially χ-bounded. CoRR Marthe Bonamy, Michal Pilipczuk
2019	B	`conf`	Integer Programming and Incidence Treedepth. IPCO Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
2019	J	`jnl`	Jones' Conjecture in subcubic graphs. CoRR Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
2019	J	`jnl`	Minimum Bisection Is Fixed-Parameter Tractable. SIAM J. Comput. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2019	A	`conf`	On Geometric Set Cover for Orthants. ESA Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen
2019	J	`jnl`	On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five. CoRR Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2019	J	`jnl`	On width measures and topological problems on semi-complete digraphs. J. Comb. Theory B Fedor V. Fomin, Michal Pilipczuk
2019	A*	`conf`	Polynomial bounds for centered colorings on proper minor-closed graph classes. SODA Michal Pilipczuk, Sebastian Siebertz
2019	A*	`conf`	Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. SODA Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2019	A	`conf`	Progressive Algorithms for Domination and Independence. STACS Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2019	J	`jnl`	Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. CoRR Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2019	B	`conf`	Reachability for Bounded Branching VASS. CONCUR Filip Mazowiecki, Michal Pilipczuk
2019	J	`jnl`	Reachability for Bounded Branching VASS. CoRR Filip Mazowiecki, Michal Pilipczuk
2019	J	`jnl`	Shorter Labeling Schemes for Planar Graphs. CoRR Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
2019	J	`jnl`	Shortest paths in one-counter systems. Log. Methods Comput. Sci. Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
2019	J	`jnl`	Strong immersion is a well-quasi-ordering for semicomplete digraphs. J. Graph Theory Florian Barbero, Christophe Paul, Michal Pilipczuk
2019	B	`conf`	Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2019	J	`jnl`	Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2019	A	`conf`	Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. STACS Dusan Knop, Michal Pilipczuk, Marcin Wrochna
2019	J	`jnl`	Tight Lower Bounds for the Complexity of Multicoloring. ACM Trans. Comput. Theory Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2018	J	`jnl`	A Polynomial Kernel for Trivially Perfect Editing. Algorithmica Pål Grønås Drange, Michal Pilipczuk
2018	J	`jnl`	Below All Subsets for Minimal Connected Dominating Set. SIAM J. Discret. Math. Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh
2018	A*	`conf`	Definable decompositions for graphs of bounded linear cliquewidth. LICS Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
2018	J	`jnl`	Definable decompositions for graphs of bounded linear cliquewidth. CoRR Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
2018	J	`jnl`	Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. ACM Trans. Algorithms Florian Barbero, Christophe Paul, Michal Pilipczuk
2018	A*	`conf`	First-Order Interpretations of Bounded Expansion Classes. ICALP Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018	J	`jnl`	First-order interpretations of bounded expansion classes. CoRR Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018	J	`jnl`	Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk, Marcin Wrochna
2018	J	`jnl`	Hardness of Approximation for ACM Trans. Comput. Theory Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk
2018	J	`jnl`	Kernelization and approximation of distance-r independent sets on nowhere dense graphs. CoRR Michal Pilipczuk, Sebastian Siebertz
2018	J	`jnl`	Model-Checking on Ordered Structures. CoRR Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2018	J	`jnl`	Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ACM Trans. Algorithms Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2018	B	`conf`	On Directed Feedback Vertex Set Parameterized by Treewidth. WG Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2018	J	`jnl`	On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. ACM Trans. Comput. Theory Michal Pilipczuk, Marcin Wrochna
2018	A*	`conf`	On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. FOCS Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2018	A*	`conf`	On the number of types in sparse graphs. LICS Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018	J	`jnl`	Parameterized circuit complexity of model checking first-order logic on sparse structures. CoRR Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018	A*	`conf`	Parameterized circuit complexity of model-checking on sparse structures. LICS Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018	—	`ch.`	Planar Digraphs. Classes of Directed Graphs Marcin Pilipczuk, Michal Pilipczuk
2018	J	`jnl`	Polynomial bounds for centered colorings on proper minor-closed graph classes. CoRR Michal Pilipczuk, Sebastian Siebertz
2018	J	`jnl`	Progressive Algorithms for Domination and Independence. CoRR Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018	A	`conf`	Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. ESA Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2018	J	`jnl`	Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. CoRR Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2018	J	`jnl`	Randomized contractions meet lean decompositions. CoRR Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh
2018	J	`jnl`	Subexponential Parameterized Algorithm for Interval Completion. ACM Trans. Algorithms Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2018	J	`jnl`	Tight complexity lower bounds for integer linear programming with few constraints. CoRR Dusan Knop, Michal Pilipczuk, Marcin Wrochna
2017	B	`conf`	Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. MFCS Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2017	A*	`conf`	Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. ICALP Florian Barbero, Christophe Paul, Michal Pilipczuk
2017	J	`jnl`	Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. CoRR Florian Barbero, Christophe Paul, Michal Pilipczuk
2017	J	`jnl`	Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. SIAM J. Comput. Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2017	A*	`conf`	Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. SODA Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
2017	J	`jnl`	Hardness of Approximation for Strip Packing. ACM Trans. Comput. Theory Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk
2017	J	`jnl`	Hitting forbidden subgraphs in graphs of bounded treewidth. Inf. Comput. Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2017	A*	`conf`	Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2017	J	`jnl`	Linear Kernels for Outbranching Problems in Sparse Digraphs. Algorithmica Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
2017	J	`jnl`	Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of Bounded Expansion. CoRR Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2017	A*	`conf`	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. LICS Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2017	A*	`conf`	Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2017	B	`conf`	On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk). MFCS Michal Pilipczuk
2017	J	`jnl`	On Directed Feedback Vertex Set parameterized by treewidth. CoRR Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2017	B	`conf`	On Low Rank-Width Colorings. WG O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
2017	J	`jnl`	On Wideness and Stability. CoRR Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2017	J	`jnl`	On low rank-width colorings. CoRR O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
2017	J	`jnl`	On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs. CoRR Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2017	A	`conf`	Optimizing Tree Decompositions in MSO. STACS Mikolaj Bojanczyk, Michal Pilipczuk
2017	J	`jnl`	Optimizing tree decompositions in MSO. CoRR Mikolaj Bojanczyk, Michal Pilipczuk
2017	J	`jnl`	Polynomial Kernelization for Removing Induced Claws and Diamonds. Theory Comput. Syst. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
2017	J	`jnl`	Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs. CoRR Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2017	J	`jnl`	Strong immersion is a well-quasi-ordering for semi-complete digraphs. CoRR Florian Barbero, Christophe Paul, Michal Pilipczuk
2017	A	`conf`	Tight Lower Bounds for the Complexity of Multicoloring. ESA Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2016	J	`jnl`	A c SIAM J. Comput. Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2016	J	`jnl`	Approximation and parameterized algorithms for geometric independent set with shrinking. CoRR Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2016	J	`jnl`	Below all subsets for Minimal Connected Dominating Set. CoRR Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh
2016	—	`ch.`	Computing Cutwidth and Pathwidth of Semi-complete Digraphs. Encyclopedia of Algorithms Michal Pilipczuk
2016	B	`conf`	Cutwidth: Obstructions and Algorithmic Aspects. IPEC Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2016	J	`jnl`	Cutwidth: obstructions and algorithmic aspects. CoRR Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2016	A*	`conf`	Definability equals recognizability for graphs of bounded treewidth. LICS Mikolaj Bojanczyk, Michal Pilipczuk
2016	J	`jnl`	Definability equals recognizability for graphs of bounded treewidth. CoRR Mikolaj Bojanczyk, Michal Pilipczuk
2016	J	`jnl`	Designing FPT Algorithms for Cut Problems Using Randomized Contractions. SIAM J. Comput. Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk
2016	B	`conf`	Edge Bipartization Faster Than 2^k. IPEC Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna
2016	—	`ch.`	Exact Algorithms for Induced Subgraph Problems. Encyclopedia of Algorithms Michal Pilipczuk
2016	—	`conf`	Hardness of Approximation for H-Free Edge Modification Problems. APPROX-RANDOM Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk
2016	J	`jnl`	Hardness of approximation for H-free edge modification problems. CoRR Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk
2016	J	`jnl`	Hardness of approximation for strip packing. CoRR Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk
2016	J	`jnl`	How to hunt an invisible rabbit on a graph. Eur. J. Comb. Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk
2016	A	`conf`	Kernelization and Sparseness: the Case of Dominating Set. STACS 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, Sebastian Siebertz, Somnath Sikdar
2016	J	`jnl`	Known Algorithms for Edge Clique Cover are Probably Optimal. SIAM J. Comput. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk
2016	J	`jnl`	Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Algorithmica Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2016	J	`jnl`	Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna
2016	—	`ch.`	Lower Bounds Based on the Exponential Time Hypothesis: Edge Clique Cover. Encyclopedia of Algorithms Michal Pilipczuk
2016	—	`conf`	Lower Bounds for Approximation Schemes for Closest String. SWAT Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	A*	`conf`	Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems. SODA Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk
2016	J	`jnl`	Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2016	J	`jnl`	On Group Feedback Vertex Set Parameterized by the Size of the Cutset. Algorithmica Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk
2016	A	`conf`	On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. STACS Michal Pilipczuk, Marcin Wrochna
2016	J	`jnl`	On Ultralimits of Sparse Graph Classes. Electron. J. Comb. Michal Pilipczuk, Szymon Torunczyk
2016	A*	`conf`	Schema Validation via Streaming Circuits. PODS Filip Murlak, Charles Paperman, Michal Pilipczuk
2016	B	`conf`	Shortest Paths in One-Counter Systems. FoSSaCS Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
2016	A*	`conf`	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. FOCS Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	A*	`conf`	Subexponential parameterized algorithm for Interval Completion. SODA Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2016	J	`jnl`	Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. CoRR Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	B	`conf`	The Generalised Colouring Numbers on Classes of Bounded Expansion. MFCS Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2016	J	`jnl`	The Generalised Colouring Numbers on Classes of Bounded Expansion. CoRR Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2016	J	`jnl`	Tight lower bounds for the complexity of multicoloring. CoRR Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2015	A	`conf`	A Polynomial Kernel for Trivially Perfect Editing. ESA Pål Grønås Drange, Michal Pilipczuk
2015	J	`jnl`	A Subexponential Parameterized Algorithm for Proper Interval Completion. SIAM J. Discret. Math. Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2015	J	`jnl`	Computing Tree-Depth Faster Than 2 Algorithmica Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
2015	J	`jnl`	Edge Bipartization faster than 2 CoRR Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna
2015	J	`jnl`	Exploring the Subexponential Complexity of Completion Problems. ACM Trans. Comput. Theory Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2015	A	`conf`	Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. ESA Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk
2015	J	`jnl`	Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. SIAM J. Discret. Math. Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2015	J	`jnl`	Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. CoRR Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
2015	C	`conf`	How to Hunt an Invisible Rabbit on a Graph. CTW Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk
2015	J	`jnl`	How to Hunt an Invisible Rabbit on a Graph. CoRR Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk
2015	B	`conf`	Linear Kernels for Outbranching Problems in Sparse Digraphs. IPEC Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
2015	J	`jnl`	Linear kernels for outbranching problems in sparse digraphs. CoRR Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
2015	J	`jnl`	Lower bounds for approximation schemes for Closest String. CoRR Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2015	J	`jnl`	Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems. CoRR Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk
2015	J	`jnl`	Minimizing Rosenthal Potential in Multicast Games. Theory Comput. Syst. Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
2015	J	`jnl`	Modifying a Graph Using Vertex Elimination. Algorithmica Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
2015	J	`jnl`	On space efficiency of algorithms working on structural decompositions of graphs. CoRR Michal Pilipczuk, Marcin Wrochna
2015	J	`jnl`	On ultralimits of sparse graph classes. CoRR Michal Pilipczuk, Szymon Torunczyk
2015	A	`conf`	Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. ESA Dániel Marx, Michal Pilipczuk
2015	J	`jnl`	Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. CoRR Dániel Marx, Michal Pilipczuk
2015	—	`book`	Parameterized Algorithms Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2015	B	`conf`	Polynomial Kernelization for Removing Induced Claws and Diamonds. WG Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
2015	J	`jnl`	Polynomial kernelization for removing induced claws and diamonds. CoRR Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
2015	J	`jnl`	Shortest paths in one-counter systems. CoRR Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
2015	J	`jnl`	Sitting Closer to Friends than Enemies, Revisited. Theory Comput. Syst. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2014	J	`jnl`	A Polynomial Kernel for Trivially Perfect Editing. CoRR Pål Grønås Drange, Michal Pilipczuk
2014	A	`conf`	A Subexponential Parameterized Algorithm for Proper Interval Completion. ESA Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	A subexponential parameterized algorithm for Interval Completion. CoRR Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	A subexponential parameterized algorithm for Proper Interval Completion. CoRR Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	Clique Cover and Graph Separation: New Incompressibility Results. ACM Trans. Comput. Theory Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2014	A	`conf`	Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). STACS Dániel Marx, Michal Pilipczuk
2014	A	`conf`	Exploring Subexponential Parameterized Complexity of Completion Problems. STACS Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2014	A*	`conf`	Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. FOCS Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. CoRR Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	—	`conf`	Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth. MFCS (2) Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	Hitting forbidden subgraphs in graphs of bounded treewidth. CoRR Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	Kernelization and Sparseness: the case of Dominating Set. CoRR Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar
2014	A*	`conf`	Minimum bisection is fixed parameter tractable. STOC Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	A*	`conf`	Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. FOCS Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2014	J	`jnl`	On Cutwidth Parameterized by Vertex Cover. Algorithmica Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	On the Hardness of Losing Width. Theory Comput. Syst. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	Parameterized Complexity of Eulerian Deletion Problems. Algorithmica Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter
2014	J	`jnl`	Preprocessing subgraph and minor problems: When does a small vertex cover help? J. Comput. Syst. Sci. Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk
2014	J	`jnl`	Representative sets for multisets. CoRR Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk
2014	J	`jnl`	Scheduling Partially Ordered Jobs Faster than 2 n. Algorithmica Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2014	J	`jnl`	Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n. Algorithmica Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2014	A	`conf`	Synthesizing transformations from XML schema mappings. ICDT Claire David, Piotr Hofman, Filip Murlak, Michal Pilipczuk
2014	J	`jnl`	Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. J. Comput. Syst. Sci. Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger
2013	J	`jnl`	A O(c^k n) 5-Approximation Algorithm for Treewidth CoRR Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2013	A*	`conf`	An O(c^k n) 5-Approximation Algorithm for Treewidth. FOCS Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2013	B	`conf`	Computing Tree-Depth Faster Than 2 n. IPEC Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
2013	J	`jnl`	Computing Tree-depth Faster Than 2 CoRR Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
2013	A	`conf`	Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. STACS Michal Pilipczuk
2013	J	`jnl`	Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). CoRR Dániel Marx, Michal Pilipczuk
2013	J	`jnl`	Exploring Subexponential Parameterized Complexity of Completion Problems. CoRR Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2013	A*	`conf`	Jungles, bundles, and fixed parameter tractability. SODA Fedor V. Fomin, Michal Pilipczuk
2013	A*	`conf`	Known algorithms for EDGE CLIQUE COVER are probably optimal. SODA Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk
2013	A	`conf`	Largest Chordal and Interval Subgraphs Faster Than 2 n. ESA Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2013	J	`jnl`	Largest chordal and interval subgraphs faster than 2^n. CoRR Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2013	J	`jnl`	Minimizing Rosenthal Potential in Multicast Games. CoRR Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
2013	J	`jnl`	Minimum Bisection is fixed parameter tractable. CoRR Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2013	J	`jnl`	Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. CoRR Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2013	J	`jnl`	On multiway cut parameterized above lower bounds. ACM Trans. Comput. Theory Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2013	A	`conf`	Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph. ESA Fedor V. Fomin, Michal Pilipczuk
2013	J	`jnl`	Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph CoRR Fedor V. Fomin, Michal Pilipczuk
2013	A	`conf`	Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. STACS Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2013	J	`jnl`	Subset Feedback Vertex Set Is Fixed-Parameter Tractable. SIAM J. Discret. Math. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2013	A*	`conf`	The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable. FOCS Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2013	J	`jnl`	The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable CoRR Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2013	A	`conf`	Tight bounds for Parameterized Complexity of Cluster Editing. STACS Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger
2012	J	`jnl`	A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More). SIAM J. Comput. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2012	J	`jnl`	An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion. Algorithmica Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2012	—	`conf`	Clique Cover and Graph Separation: New Incompressibility Results. ICALP (1) Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2012	J	`jnl`	Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings CoRR Michal Pilipczuk
2012	A*	`conf`	Designing FPT Algorithms for Cut Problems Using Randomized Contractions. FOCS Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk
2012	J	`jnl`	Designing FPT algorithms for cut problems using randomized contractions CoRR Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk
2012	B	`conf`	Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n. IPEC Marcin Pilipczuk, Michal Pilipczuk
2012	J	`jnl`	Finding a maximum induced degenerate subgraph faster than 2^n CoRR Marcin Pilipczuk, Michal Pilipczuk
2012	—	`conf`	Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. ICALP (1) Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2012	J	`jnl`	Fixed-parameter tractability of multicut in directed acyclic graphs CoRR Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2012	B	`conf`	How to Eliminate a Graph. WG Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
2012	J	`jnl`	Kernelization hardness of connectivity problems in d-degenerate graphs. Discret. Appl. Math. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2012	J	`jnl`	Known algorithms for EDGE CLIQUE COVER are probably optimal CoRR Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk
2012	—	`conf`	Minimizing Rosenthal Potential in Multicast Games. ICALP (2) Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
2012	B	`conf`	On Group Feedback Vertex Set Parameterized by the Size of the Cutset. WG Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk
2012	B	`conf`	Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? IPEC Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk
2012	J	`jnl`	Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? CoRR Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk
2012	B	`conf`	Sitting Closer to Friends Than Enemies, Revisited. MFCS Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2012	J	`jnl`	Sitting closer to friends than enemies, revisited CoRR Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2012	B	`conf`	Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. LATIN Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2012	J	`jnl`	Some results on Vizing's conjecture and related problems. Discret. Appl. Math. Marcin Pilipczuk, Michal Pilipczuk, Riste Skrekovski
2011	J	`jnl`	Clique cover and graph separation: New incompressibility results CoRR Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2011	J	`jnl`	Dominating set is fixed parameter tractable in claw-free graphs. Theor. Comput. Sci. Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	Jungles, bundles, and fixed parameter tractability CoRR Fedor V. Fomin, Michal Pilipczuk
2011	B	`conf`	On Cutwidth Parameterized by Vertex Cover. IPEC Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2011	B	`conf`	On Multiway Cut Parameterized above Lower Bounds. IPEC Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	On Multiway Cut parameterized above lower bounds CoRR Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	On group feedback vertex set parameterized by the size of the cutset CoRR Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk
2011	B	`conf`	On the Hardness of Losing Width. IPEC Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2011	B	`conf`	Parameterized Complexity of Eulerian Deletion Problems. WG Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter
2011	B	`conf`	Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach. MFCS Michal Pilipczuk
2011	J	`jnl`	Problems parameterized by treewidth tractable in single exponential time: a logical approach CoRR Michal Pilipczuk
2011	A	`conf`	Scheduling Partially Ordered Jobs Faster Than 2 n. ESA Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	Scheduling partially ordered jobs faster than 2^n CoRR Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2011	A*	`conf`	Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. FOCS Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	Solving connectivity problems parameterized by treewidth in single exponential time CoRR Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	Subexponential fixed-parameter tractability of cluster editing CoRR Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger
2011	—	`conf`	Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2011	A*	`conf`	The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem). SODA Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2010	B	`conf`	An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion. IPEC Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2010	J	`jnl`	Dominating Set is Fixed Parameter Tractable in Claw-free Graphs CoRR Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2010	B	`conf`	Kernelization Hardness of Connectivity Problems in WG Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2010	J	`jnl`	Subset feedback vertex set is fixed parameter tractable CoRR Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2010	J	`jnl`	The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem) CoRR Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk