You are not logged in | Log in

Michał Pilipczuk

Number of publications: 180

2023

Mathieu Mari , Timothé Picavet, Michał Pilipczuk , A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, the Netherlands, 6 September 2023 - 8 September 2023. See in PBN
Jesper Nederlof, Michał Pilipczuk , Karol Węgrzycki, Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models, The Electronic Journal of Combinatorics, 30 (3) 2023. See in PBN
Pierre Ohlmann, Michał Pilipczuk , Wojciech Przybyszewski , Szymon Toruńczyk , Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes, 50th EATCS International Colloquium on Automata, Languages and Programming, Padeborn, Germany, 10 July 2023 - 14 July 2023. See in PBN
Jędrzej Olkowski, Michał Pilipczuk , Mateusz Rychlicki, Karol Węgrzycki, Anna Zych-Pawlewicz , Dynamic Data Structures for Parameterized String Problems, 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 7 March 2023 - 9 March 2023. See in PBN
Tuukka Korhonen, Konrad Majewski , Wojciech Nadara, Michał Pilipczuk , Marek Sokołowski , Dynamic treewidth, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN
Jakub Gajarský , Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michał Pilipczuk , Wojciech Przybyszewski , Sebastian Siebertz, Marek Sokołowski , Szymon Toruńczyk , Flipper Games for Monadically Stable Graph Classes, 50th EATCS International Colloquium on Automata, Languages and Programming, Padeborn, Germany, 10 July 2023 - 14 July 2023. See in PBN
Michał Pilipczuk , Marek Sokołowski , Graphs of bounded twin-width are quasi-polynomially χ-bounded, Journal of Combinatorial Theory. Series B, 161 2023, p. 382-406. See in PBN
Jesper Nederlof, Michał Pilipczuk , Celine M. F. Swennenhuis, Karol Węgrzycki, Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space, SIAM Journal on Discrete Mathematics, 37 (3) 2023, p. 1566-1586. See in PBN
Marek Sokołowski , Michał Pilipczuk , Konrad Majewski , Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number, 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 7 March 2023 - 9 March 2023. See in PBN
Lorenzo Clemente , Maria Donten-Bury , Filip Mazowiecki, Michał Pilipczuk , On Rational Recursive Sequences, 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 7 March 2023 - 9 March 2023. See in PBN
Marthe Bonamy, Michał Pilipczuk , Jean-Sébastien Sereni, Richard Weber, On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph, Mathematics of Operations Research, 48 (2) 2023, p. 942-953. See in PBN
Marco Caoduro, Jana Cslovjecsek, Michał Pilipczuk , Karol Węgrzycki, On the independence number of intersection graphs of axis-parallel segments, Journal of Computational Geometry, 14 (1) 2023. See in PBN
Hans Bodlaender, Carla Groenland, Michał Pilipczuk , Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters, 50th EATCS International Colloquium on Automata, Languages and Programming, Padeborn, Germany, 10 July 2023 - 14 July 2023. See in PBN
Marthe Bonamy, Jadwiga Czyżewska, Łukasz Kowalik , Michał Pilipczuk , Partitioning edges of a planar graph into linear forests and a matching, Journal of Graph Theory, 104 (3) 2023, p. 659-677. See in PBN
Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk , Michał Pilipczuk , Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1*, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN
Meike Hatzel, Konrad Majewski , Michał Pilipczuk , Marek Sokołowski , Simpler and faster algorithms for detours in planar digraphs, 2023 Symposium on Simplicity in Algorithms, Florencja, Italy, 23 January 2023 - 25 January 2023. See in PBN
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk , Erik Jan van Leeuwen, Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth, 31st Annual European Symposium on Algorithms, Amsterdam, the Netherlands, 4 September 2023 - 8 September 2023. See in PBN

2022

Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs, SIAM Journal on Computing, 51 (2) 2022, p. 254-289. See in PBN
Michał Pilipczuk , Nicole Schirrmacher, Sebastian Siebertz, Szymon Toruńczyk , Alexandre Vigny, Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures, 49th International Colloquium on Automata, Languages and Programming, Paris, France, 4 July 2022 - 8 July 2022. See in PBN
Michał Pilipczuk , Marek Sokołowski , Anna Zych-Pawlewicz , Compact Representation for Matrices of Bounded Twin-Width, 39th International Symposium on Theoretical Aspects of Computer Science, Marseille, France, 15 April 2022 - 18 April 2022, 219 (52) 2022, p. 1-14. See in PBN
Wojciech Nadara, Michał Pilipczuk , Marcin Smulewicz, Computing Treedepth in Polynomial Space and Linear {FPT} Time, 30th Annual European Symposium on Algorithms, Poczdam, Germany, 5 September 2022 - 7 September 2022, 244 2022, p. 79:1--79:14. See in PBN
Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk , Gabriele Puppis, Cristian Riveros, Dynamic Data Structures for Timed Automata Acceptance, Algorithmica, 84 (11) 2022, p. 3223-3245. See in PBN
Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 June 2022 - 24 June 2022. See in PBN
Łukasz Bożyk , Oscar Defrain, Karolina Okrasa, Michał Pilipczuk , On objects dual to tree-cut decompositions, Journal of Combinatorial Theory. Series B, 157 2022, p. 401-428. See in PBN
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk , Michał Pilipczuk , On the Complexity of Problems on Tree-Structured Graphs, 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, Poczdam, Germany, 7 September 2022 - 9 September 2022, 249 2022, p. 6:1--6:17. See in PBN
Łukasz Bożyk , Michał Pilipczuk , On the Erdős-Pósa property for immersions and topological minors in tournaments, Discrete Mathematics and Theoretical Computer Science, 24 (1) 2022, p. #12. See in PBN
Dániel Marx, Michał Pilipczuk , Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams, ACM Transactions on Algorithms, 18 (2) 2022, p. 1-64. See in PBN
Mikołaj Bojańczyk , Michał Pilipczuk , Optimizing tree decompositions in MSO, Logical Methods in Computer Science, Volume 18, Issue 1 2022. See in PBN
Łukasz Bożyk, Michał Pilipczuk , Polynomial Kernel for Immersion Hitting in Tournaments, 30th Annual European Symposium on Algorithms, Poczdam, Germany, 5 September 2022 - 7 September 2022, 244 2022, p. 26:1--26:17. See in PBN
Jakub Gajarský , Michał Pilipczuk , Szymon Toruńczyk , Stable graphs of bounded twin-width, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
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, SIAM Journal on Computing, 51 (6) 2022, p. 1866-1930. See in PBN
Patrice Ossona de Mendez, Michał Pilipczuk , Sebastian Siebertz, Transducing paths in graph classes with unbounded shrubdepth, EUROPEAN JOURNAL OF COMBINATORICS, 2022, p. 103660. See in PBN
Jan Dreier, Jakub Gajarský , Sandra Kiefer, Michał Pilipczuk , Szymon Toruńczyk , Treelike Decompositions for Transductions of Sparse Graphs, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
Jakub Gajarský , Michał Pilipczuk , Wojciech Przybyszewski , Szymon Toruńczyk , Twin-Width and Types, 49th International Colloquium on Automata, Languages and Programming, Paris, France, 4 July 2022 - 8 July 2022. See in PBN

2021

Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk , Michał Pilipczuk , Covering minimal separators andpotential maximal cliques in $P_{t}$-free graphs, Electronic Journal of Combinatorics, 28 (1) 2021. See in PBN
Mikołaj Bojańczyk , Martin Grohe, Michał Pilipczuk , Definable decompositions for graphs of bounded linear cliquewidth, Logical Methods in Computer Science, 17 (1) 2021, p. 1-40. See in PBN
Alejandro Grez, Gabriele Puppis, Cristian Riveros, Filip Mazowiecki, Michał Pilipczuk , Dynamic Data Structures for Timed Automata Acceptance, Leibniz International Proceedings in Informatics, LIPIcs, 214 2021, p. 20:1--20:18. See in PBN
Jiehua Chen, Wojciech Czerwiński , Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara , Marcin Pilipczuk , Michał Pilipczuk , Manuel Sorge, Bartłomiej Wróblewski, Anna Zych-Pawlewicz , Efficient fully dynamic elimination forests with applications to detecting long paths and cycles, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN
Michał Pilipczuk , Michał T. Seweryn, Piotr Micek, Marcin Briański, Erdös-Hajnal properties for powers of sparse graphs, SIAM Journal on Discrete Mathematics, 35 (1) 2021, p. 447-464. See in PBN
Maria Chudnovsky, Jason King, Michał Pilipczuk , Paweł Rzążewski , Sophie Spirkl, Finding Large H-Colorable Subgraphs in Hereditary Graph Classes, SIAM Journal on Discrete Mathematics, 35 (4) 2021, p. 2357-2386. See in PBN
Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Paweł Rzążewski , Finding large induced sparse subgraphs in C>t -free graphs in quasipolynomial time, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 21 June 2021 - 25 June 2021. See in PBN
Łukasz Kowalik , Michał Pilipczuk , Paweł Rzążewski , Graph-Theoretic Concepts in Computer Science : 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers, 47th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2021, Warszawa, Poland, 23 June 2021 - 25 June 2021. See in PBN
Marthe Bonamy, François Dross, Tomáš Masařík , Andrea Munaro, Wojciech Nadara , Marcin Pilipczuk , Michał Pilipczuk , Jones' Conjecture in Subcubic Graphs, Electronic Journal of Combinatorics, 28 (4) 2021, p. P4.5: 1-12. See in PBN
Michał Pilipczuk , Sebastian Siebertz, Kernelization and approximation of distance-r independent sets on nowhere dense graphs, EUROPEAN JOURNAL OF COMBINATORICS, 94 2021, p. 103309,1-19. See in PBN
Archontia Giannopoulou, Michał Pilipczuk , Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Linear kernels for edge deletion problems to immersion-closed graph classes, SIAM Journal on Discrete Mathematics, 35 (1) 2021, p. 105-151. See in PBN
Michaël Cadilhac, Charles Paperman, Géraud Sénizergues, Filip Mazowiecki, Michał Pilipczuk , On Polynomial Recursive Sequences, Theory of Computing Systems, 2021. See in PBN
Michał Pilipczuk , Sebastian Siebertz, Polynomial bounds for centered colorings on proper minor-closed graph classes, Journal of Combinatorial Theory. Series B, 151 2021, p. 111-147. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Paweł Rzążewski , Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths, 4th Symposium on Simplicity in Algorithms, Alexandria, VA, the United States of America, 11 January 2021 - 12 January 2021. See in PBN
Marek Cygan , Paweł Komosa, Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Magnus Wahlström, Randomized Contractions Meet Lean Decompositions, ACM Transactions on Algorithms, 17 (1) 2021, p. 1948-1964. See in PBN
Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk , Roman Rabinovich, Sebastian Siebertz, Rankwidth meets stability*, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN

2020

Daniel Lokshtanov, Pranabendu Misra, Michał Pilipczuk , Saket Saurabh, Meirav Zehavi, An exponential time parameterized algorithm for planar disjoint paths, 52nd ACM Symposium on Theory of Computing, Chicago, the United States of America, 22 June 2020 - 26 June 2020. See in PBN
Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk , Xuding Zhu, Clustering Powers of Sparse Graphs, Electronic Journal of Combinatorics, 27 (4) 2020, p. P4.17. See in PBN
Michał Pilipczuk , Computing Tree Decompositions, Lecture Notes in Computer Science, 2020, p. 189-213. See in PBN
Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michał Pilipczuk , Jean-Florent Raymond, Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants, ACM Transactions on Algorithms, 16 (3) 2020, p. 39:1-39:23. See in PBN
Maria Chudnovsky, Jason King, Michał Pilipczuk , Paweł Rzążewski, Sophie Spirkl, Finding Large H-Colorable Subgraphs in Hereditary Graph Classes, Leibniz International Proceedings in Informatics, LIPIcs, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 September 2020 - 9 September 2020. See in PBN
Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona De Mendez, Michał Pilipczuk , Sebastian Siebertz, Szymon Toruńczyk , Jakub Gajarský , First-Order Interpretations of Bounded Expansion Classes, ACM Transactions on Computational Logic, 21 (4) 2020, p. 29:1-29:41. See in PBN
Marthe Bonamy, Michał Pilipczuk , Graphs of bounded cliquewidth are polynomially chi-bounded, Advances in Combinatorics, 2020, p. 8:1-8:21. See in PBN
Jesper Nederlof, Celine Swennenhuis, Karol Węgrzycki, Michał Pilipczuk , Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space, 46th International Workshop, {WG} 2020, Leeds, the United Kingdom of Great Britain and Northern Ireland, 24 June 2020 - 26 June 2020. See in PBN
Ivan Bliznets, Paweł Komosa, Lukáš Mach, Marek Cygan , Michał Pilipczuk , Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems, ACM Transactions on Algorithms, 16 (2) 2020, p. 1-31. See in PBN
Kord Eickmeyer, Jan van den Heuvel, Ken-Ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michał Pilipczuk , Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz, Model-Checking on Ordered Structures, ACM Transactions on Computational Logic, 21 (2) 2020, p. 11:1-11:28. See in PBN
O-joung Kwon, Michał Pilipczuk , Sebastian Siebertz, On low rank-width colorings, EUROPEAN JOURNAL OF COMBINATORICS, 83 2020. See in PBN
Michaël Cadilhac, Charles Paperman, Michał Pilipczuk , Géraud Sénizergues, Filip Mazowiecki, On Polynomial Recursive Sequences, Leibniz International Proceedings in Informatics, LIPIcs, 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, 8 July 2020 - 11 July 2020, 168 2020, p. 117:1--117:17. See in PBN
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) 2020, p. 1472-1483. See in PBN
Michał Pilipczuk , Erik Jan van Leeuwen, Andreas Wiese, Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs, Algorithmica, 82 (6) 2020, p. 1703-1739. See in PBN
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, 31st ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, the United States of America, 5 January 2020 - 8 January 2020. See in PBN
Marthe Bonamy, Cyril Gavoille, Michał Pilipczuk , Shorter Labeling Schemes for Planar Graphs, 31st ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, the United States of America, 5 January 2020 - 8 January 2020. See in PBN
Dusan Knop, Michał Pilipczuk , Marcin Wrochna , Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints, ACM Transactions on Computation Theory, 12 (3) 2020, p. 19:1--19:19. See in PBN
Adam Paszke, Michał Pilipczuk , VC Density of Set Systems Definable in Tree-Like Graphs, Leibniz International Proceedings in Informatics, LIPIcs, 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czechia, 24 August 2020 - 28 August 2020, 170 2020, p. 78:1--78:13. See in PBN

2019

Archontia C. Giannopoulou, Michał Pilipczuk , Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Cutwidth: Obstructions and Algorithmic Aspects, Algorithmica, 81 (2) 2019, p. 557-588. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Edge Bipartization Faster than 2^k, Algorithmica, 81 (3) 2019, p. 917–966. See in PBN
Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak, Michał Pilipczuk , Marcin Wrochna , Integer Programming and Incidence Treedepth, 20th Conference on Integer Programming and Combinatorial Optimization, Ann Arbor, the United States of America, 22 May 2019 - 24 May 2019. See in PBN
Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Minimum Bisection Is Fixed-Parameter Tractable, SIAM Journal on Computing, 48 (2) 2019, p. 417-450. See in PBN
Grzegorz Fabiański , Michał Pilipczuk , Sebastian Siebertz, Szymon Toruńczyk , Progressive Algorithms for Domination and Independence, 36th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, 13 March 2019 - 16 March 2019, 126 2019, p. 27:1--27:16. See in PBN
Dmitry Chistikov, Wojciech Czerwiński , Piotr Hofman , Michał Pilipczuk , Michael Wehar, Shortest paths in one-counter systems, Logical Methods in Computer Science, 15 (1) 2019, p. 19:1–19:28. See in PBN
Jana Novotna, Karolina Okrasa, Michał Pilipczuk , Paweł Rzążewski , Erik Jan van Leeuwen, Bartosz Walczak, Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs, 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), Monachium, Germany, 11 September 2019 - 13 September 2019. See in PBN
Dušan Knop, Michał Pilipczuk , Marcin Wrochna , Tight complexity lower bounds for integer linear programming with few constraints, Leibniz International Proceedings in Informatics, 36th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, 13 March 2019 - 16 March 2019, 126 2019, p. 44:1--44:15. See in PBN
Marthe Bonamy, Łukasz Kowalik , Michał Pilipczuk , Arkadiusz Socała, Marcin Wrochna , Tight Lower Bounds for the Complexity of Multicoloring, ACM Transactions on Computation Theory, 11 (3) 2019, p. 1-19. See in PBN

2018

Pål Grønås Drange, Michał Pilipczuk , A Polynomial Kernel for Trivially Perfect Editing, Algorithmica, 80 2018, p. 3481–3524. See in PBN
Daniel Lokshtanov, Michał Pilipczuk , Saket Saurabh, Below All Subsets for Minimal Connected Dominating Set, SIAM Journal on Discrete Mathematics, 32 (3) 2018, p. 332--2345. See in PBN
Mikołaj Bojańczyk , Martin Grohe, Michał Pilipczuk , Definable decompositions for graphs of bounded linear cliquewidth, Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Oxford, the United Kingdom of Great Britain and Northern Ireland, 9 July 2018 - 12 July 2018. See in PBN
Florian Barbero, Christophe Paul, Michał Pilipczuk , Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs, ACM Transactions on Algorithms, 14 (3) 2018, p. 1–31. See in PBN
Michał Pilipczuk , Sebastian Siebertz, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez, Szymon Toruńczyk , Jakub Gajarský , First-Order Interpretations of Bounded Expansion Classes, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July, 2018. See in PBN
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michał Pilipczuk , Marcin Wrochna , Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth, ACM Transactions on Algorithms, 14 (3) 2018, p. 1–45. See in PBN
Ivan Bliznets, Marek Cygan , Paweł Komosa, Michał Pilipczuk , Hardness of Approximation for H-free Edge Modification Problems, ACM Transactions on Computation Theory, 10 (2) 2018, p. 2018. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, ACM Transactions on Algorithms, 14 (4) 2018, p. 53:1-53:73. See in PBN
Marthe Bonamy, Łukasz Kowalik , Jesper Nederlof, Michał Pilipczuk , Arkadiusz Socała, Marcin Wrochna , On Directed Feedback Vertex Set Parameterized by Treewidth, 44th International Workshop on Graph-Theoretic Concepts in Computer, Cottbus, Germany, 27 June 2018 - 29 June 2018. See in PBN
Michał Pilipczuk , Marcin Wrochna , On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs, ACM Transactions on Computation Theory, 9 (4) 2018, p. 18: 1–36. See in PBN
Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs, 59th Annual IEEE Symposium on Foundations of Computer Science, Paris, France, 7 October 2018 - 9 October 2018. See in PBN
Michał Pilipczuk , Sebastian Siebertz, Szymon Toruńczyk , On the number of types in sparse graphs, Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Oxford, the United Kingdom of Great Britain and Northern Ireland, 9 July 2018 - 12 July 2018. See in PBN
Michał Pilipczuk , Sebastian Siebertz, Szymon Toruńczyk , Parameterized circuit complexity of model-checking on sparse structures, Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Oxford, the United Kingdom of Great Britain and Northern Ireland, 9 July 2018 - 12 July 2018. See in PBN
Michał Pilipczuk , Andreas Wiese, Erik Jan van Leeuwen, Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs, 26th Annual European Symposium on Algorithms, Helsinki, Finland, 20 August 2018 - 22 August 2018. See in PBN
Florian Barbero, Christophe Paul, Michał Pilipczuk , Strong immersion is a well-quasi-ordering for semicomplete digraphs, Journal of Graph Theory, 90 (4) 2018, p. 484-496. See in PBN
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk , Michał Pilipczuk , Subexponential Parameterized Algorithm for Interval Completion, ACM Transactions on Algorithms, 14 (3) 2018, p. 35:1-35:62. See in PBN

2017

Damian Niwiński , Henryk Michalewski , Wojciech Rytter , Joost Winter, Michał Skrzypczak , Szymon Toruńczyk , Michał Pilipczuk , Eryk Kopczyński , Sławomir Lasota , Paweł Parys , Joanna Ochremiak, Wojciech Czerwiński , Bartosz Klin , Igor Walukiewicz, Szczepan Hummel, Mikołaj Bojańczyk , Piotr Hofman , Lorenzo Clemente , Filip Mazowiecki, Filip Murlak , 200 Problems in Formal Languages and Automata Theory, 2017. See in PBN
Michał Pilipczuk , Andreas Wiese, Erik Jan van Leeuwen, Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking, 42nd International Symposium on Mathematical Foundations of Computer Science, Aalborg, Denmark, 21 August 2017 - 25 August 2017. See in PBN
Archontia Giannopoulou, Michał Pilipczuk , Jean-florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Cutwidth: Obstructions and Algorithmic Aspects, 11th International Symposium on Parameterized and Exact Computation, Aarhus, Denmark, 24 August 2016 - 26 August 2016. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Edge Bipartization Faster Than 2 k∗, 11th International Symposium on Parameterized and Exact Computation, Aarhus, Denmark, 24 August 2016 - 26 August 2016, 63 2017, p. 26:1--26:13. See in PBN
Florian Barbero, Christophe Paul, Michał Pilipczuk , Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 July 2017 - 14 July 2017. See in PBN
Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, SIAM Journal on Computing, 46 (1) 2017, p. 161–189. See in PBN
Fedor V. Fomin, Daniel Lokshtanov, Michał Pilipczuk , Saket Saurabh, Marcin Wrochna , Fully polynomial-time parameterized computations for graphs and matrices of low treewidth, 28th ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 16 January 2017 - 19 January 2017. See in PBN
Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk , Michał Pilipczuk , Hardness of Approximation for Strip Packing, ACM Transactions on Computation Theory, 9 (3) 2017, p. 14:1-7. See in PBN
Marek Cygan , Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , Hitting forbidden subgraphs in graphs of bounded treewidth, Information and Computation, 256 2017, p. 62-82. See in PBN
Archontia Giannopoulou, Michał Pilipczuk , Jean-florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 July 2017 - 14 July 2017. See in PBN
Marthe Bonamy, Łukasz Kowalik , Michał Pilipczuk , Arkadiusz Socała, Linear Kernels for Outbranching Problems in Sparse Digraphs, Algorithmica, 79 (1) 2017, p. 159–188. See in PBN
Stephan Kreutzer, Michał Pilipczuk , Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz, Jan van den Heuvel, Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 June 2017 - 23 June 2017. See in PBN
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, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 July 2017 - 14 July 2017. See in PBN
O-joung Kwon, Michał Pilipczuk , Sebastian Siebertz, On Low Rank-Width Colorings, 43rd International Workshop on Graph-Theoretic Concepts in Computer, Eindhoven, the Netherlands, 21 June 2017 - 23 June 2017. See in PBN
Mikołaj Bojańczyk , Michał Pilipczuk , Optimizing Tree Decompositions in MSO, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 March 2017 - 11 March 2017. See in PBN
Marthe Bonamy, Łukasz Kowalik , Michał Pilipczuk , Arkadiusz Socała, Marcin Wrochna , Tight Lower Bounds for the Complexity of Multicoloring, 25th Annual European Symposium on Algorithms, Vienna, Austria, 4 September 2017 - 6 September 2017, 87 2017, p. 18:1--18:14. See in PBN

2016

Hans L. Bodlaender, Pål Grønås Drange Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michał Pilipczuk , A c^k n 5-Approximation Algorithm for Treewidth, SIAM Journal on Computing, 2016. See in PBN
Mikołaj Bojańczyk , Michał Pilipczuk , Definability equals recognizability for graphs of bounded treewidth, 2016. See in PBN
Rajesh Chitnis, Marek Cygan , MohammadTaghi Hajiaghayi, Marcin Pilipczuk , Michał Pilipczuk , Designing FPT Algorithms for Cut Problems Using Randomized Contractions, SIAM Journal on Computing, 2016. See in PBN
Ivan Bliznets, Marek Cygan , Paweł Komosa, Michał Pilipczuk , Hardness of Approximation for H-Free Edge Modification Problems, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2016. See in PBN
Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michał Pilipczuk , How to hunt an invisible rabbit on a graph, EUROPEAN JOURNAL OF COMBINATORICS, 2016. See in PBN
Paal Gronaas Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Felix Reidl, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar, Fernando S\'anchez Villaamil, Kernelization and Sparseness: the Case of Dominating Set, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orlean, France, 17 February 2016 - 20 February 2016. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Known Algorithms for Edge Clique Cover are Probably Optimal, SIAM Journal on Computing, 2016. See in PBN
Ivan Bliznets, Fedor V. Fomin, Michał Pilipczuk , Yngve Villanger, Largest Chordal and Interval Subgraphs Faster than 2^n, Algorithmica, 2016. See in PBN
Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Lower Bounds for Approximation Schemes for Closest String, 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland, 2016. See in PBN
Ivan Bliznets, Marek Cygan , Paweł Komosa, Lukas Mach, Michał Pilipczuk , Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems, Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, the United States of America, 2016. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , On Group Feedback Vertex Set Parameterized by the Size of the Cutset, Algorithmica, 2016. See in PBN
Michał Pilipczuk , Marcin Wrochna , On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orlean, France, 17 February 2016 - 20 February 2016. See in PBN
Michał Pilipczuk , Szymon Toruńczyk , On Ultralimits of Sparse Graph Classes, Electronic Journal of Combinatorics, 23 (2) 2016, p. P2.32. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Erik Jan van Leeuwen, Polynomial Kernelization for Removing Induced Claws and Diamonds, Theory of Computing Systems, 2016. See in PBN
Marek Cygan , Erik Jan van Leeuwen, Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Polynomial Kernelization for Removing Induced Claws and Diamonds, 41st International Workshop on Graph-Theoretic Concepts in Computer Science, Garching, Germany, 17 June 2015 - 19 June 2015. See in PBN
Filip Murlak , Charles Paperman, Michał Pilipczuk , Schema Validation via Streaming Circuits, 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, San Francisco, CA, the United States of America, 26 June 2016 - 1 July 2016. See in PBN
Dmitry Chistikov, Wojciech Czerwiński , Piotr Hofman , Michał Pilipczuk , Michael Wehar, Shortest Paths in One-Counter Systems, 19th International Conference on Foundations of Software Science and Computation Structures, Eindhoven, the Netherlands, 2 April 2016 - 8 April 2016. See in PBN
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk , Michał Pilipczuk , Subexponential parameterized algorithm for Interval Completion, Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, the United States of America, 10 January 2016 - 12 January 2016. See in PBN
Fedor V. Fomin, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, New Brunswick, the United States of America, 9 October 2016 - 11 January 2017. See in PBN
Stephan Kreutzer, Michał Pilipczuk , Roman Rabinovich, Sebastian Siebertz, The Generalised Colouring Numbers on Classes of Bounded Expansion, Mathematical Foundations of Computer Science 2016, Kraków, Poland, 2016. See in PBN

2015

Pål Grønås Drange, Michał Pilipczuk , A Polynomial Kernel for Trivially Perfect Editing, 23rd Annual European Symposium on Algorithms, Patras, Greece, 14 September 2015 - 16 September 2015. See in PBN
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk , Michał Pilipczuk , A Subexponential Parameterized Algorithm for Proper Interval Completion, SIAM Journal on Discrete Mathematics, 2015. See in PBN
Fedor V. Fomin, Archontia C. Giannopoulou, Michał Pilipczuk , Computing Tree-Depth Faster Than 2^n, Algorithmica, 2015. See in PBN
Pål Grønås Drange, Fedor V. Fomin, Michał Pilipczuk , Yngve Villanger, Exploring the Subexponential Complexity of Completion Problems, ACM Transactions on Computation Theory, 2015. See in PBN
Ariel Gabizon, Daniel Lokshtanov, Michał Pilipczuk , Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints, 23rd Annual European Symposium on Algorithms, Patras, Greece, 14 September 2015 - 16 September 2015. See in PBN
Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Magnus Wahlström, Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs, SIAM Journal on Discrete Mathematics, 2015. See in PBN
Marthe Bonamy, Łukasz Kowalik , Michał Pilipczuk , Arkadiusz Socała, Linear Kernels for Outbranching Problems in Sparse Digraphs, 10th International Symposium on Parameterized and Exact Computation, Patras, Greece, 16 September 2015 - 18 September 2015. See in PBN
Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michał Pilipczuk , Minimizing Rosenthal Potential in Multicast Games, Theory of Computing Systems, 2015. See in PBN
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michał Pilipczuk , Modifying a Graph Using Vertex Elimination, Algorithmica, 2015. See in PBN
Dániel Marx, Michał Pilipczuk , Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams, ESA 2015 - 23rd Annual European Symposium on Algorithms, 2015. See in PBN
Marek Cygan , Fedor Fomin, Łukasz Kowalik , Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Parameterized Algorithms, 2015. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Onufry Wojtaszczyk, Sitting Closer to Friends than Enemies, Revisited, Theory of Computing Systems, 2015. See in PBN

2014

Ivan Bliznets, Fedor Fomin, Marcin Pilipczuk , Michał Pilipczuk , A Subexponential Parameterized Algorithm for Proper Interval Completion, 22th Annual European Symposium on Algorithms, Wrocław, Poland, 8 September 2014 - 10 September 2014. See in PBN
Marek Cygan , Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Magnus Wahlström, Clique Cover and Graph Separation: New Incompressibility Results, ACM Transactions on Computation Theory, 2014. See in PBN
Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, the United States of America, 18 October 2014 - 21 October 2014. See in PBN
Marek Cygan , Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, Budapest, Hungary, 25 August 2014 - 29 August 2014. See in PBN
Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Minimum bisection is fixed parameter tractable, Symposium on Theory of Computing, STOC 2014, New York, the United States of America, 31 May 2014 - 3 June 2014. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, the United States of America, 18 October 2014 - 21 October 2014. See in PBN
Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, On Cutwidth Parameterized by Vertex Cover, Algorithmica, 2014. See in PBN
Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, On the Hardness of Losing Width, Theory of Computing Systems, 2014. See in PBN
Marek Cygan , Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , Ildikó Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Algorithmica, 2014. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Scheduling Partially Ordered Jobs Faster than 2^n, Algorithmica, 2014. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n, Algorithmica, 2014. See in PBN
Claire David, Filip Murlak , Piotr Hofman , Michał Pilipczuk , Synthesizing transformations from XML schema mappings, 2014. See in PBN
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Yngve Villanger, Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters, Journal of Computer and System Sciences, 2014. See in PBN

2013

Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Known algorithms for EDGE CLIQUE COVER are probably optimal, Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, the United States of America, 6 January 2013 - 8 January 2013. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, On multiway cut parameterized above lower bounds, ACM Transactions on Computation Theory, 2013. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 February 2013 - 2 March 2013. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, SIAM Journal on Discrete Mathematics, 2013. See in PBN
Marek Cygan , Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable, 54th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, the United States of America, 26 October 2013 - 29 October 2013. See in PBN
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Yngve Villanger, Tight bounds for Parameterized Complexity of Cluster Editing, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 February 2013 - 2 March 2013. See in PBN

2012

Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More), SIAM Journal on Computing, 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion, Algorithmica, 2012. See in PBN
Marek Cygan , Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Magnus Wahlström, Clique Cover and Graph Separation: New Incompressibility Results, Automata, Languages, and Programming - 39th International Colloquium, Warwick, the United Kingdom of Great Britain and Northern Ireland, 9 July 2012 - 13 July 2012. See in PBN
Rajesh Hemant Chitnis, Marek Cygan , MohammadTaghi Hajiaghayi, Marcin Pilipczuk , Michał Pilipczuk , Designing FPT Algorithms for Cut Problems Using Randomized Contractions, 53rd Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, the United States of America, 20 October 2012 - 23 October 2012. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Finding a Maximum Induced Degenerate Subgraph Faster Than 2^n, Parameterized and Exact Computation - 7th International Symposium, Ljubljana, Slovenia, 12 September 2012 - 14 September 2012. See in PBN
Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Magnus Wahlström, Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs, Automata, Languages, and Programming - 39th International Colloquium, Warwick, the United Kingdom of Great Britain and Northern Ireland, 9 July 2012 - 13 July 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Kernelization hardness of connectivity problems in d-degenerate graphs, Discrete Applied Mathematics, 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , On Group Feedback Vertex Set Parameterized by the Size of the Cutset, Graph-Theoretic Concepts in Computer Science - 38th International Workshop, Jerusalem, Israel, 26 June 2012 - 28 June 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Sitting Closer to Friends Than Enemies, Revisited, Mathematical Foundations of Computer Science 2012 - 37th International Symposium, Bratislava, Slovakia, 27 August 2012 - 31 August 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n, LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, 16 April 2012 - 20 April 2012. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Riste Skrekovski, Some results on Vizing's conjecture and related problems, Discrete Applied Mathematics, 2012. See in PBN

2011

Marek Cygan , Geevarghese Philip, Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Dominating set is fixed parameter tractable in claw-free graphs, Theoretical Computer Science, 2011. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Ildiko Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Lecture Notes in Computer Science, 2011. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Scheduling Partially Ordered Jobs Faster Than 2n, Lecture Notes in Computer Science, 2011. See in PBN
Marek Cygan , Jesper Nederlof, Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Johan van Rooij, Solving connectivity problems parameterized by treewidth in single exponential time, IEEE 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, the United States of America, 22 October 2011 - 25 October 2011. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Lecture Notes in Computer Science, 2011. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem), Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, the United States of America, 23 January 2011 - 25 January 2011. See in PBN

2010

Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion, Lecture Notes in Computer Science, 2010. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Kernelization hardness of connectivity problems in d-degenerate graphs, Graph Theoretic Concepts in Computer Science - 36th International Workshop, Zaros, Greece, 28 June 2010 - 30 June 2010. See in PBN