Marcin Pilipczuk

315 papers A* 38A 15B 30C 1Misc 1Journal 210Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Polynomial Coreset for Furthest Neighbor in Planar Metrics. CoRR Kacper Kluk, Hung Le, Wojciech Nadara, Marcin Pilipczuk, Hector Tierno, Vinayak
2026	J	`jnl`	Applications of flow-augmentation. Comput. Sci. Rev. Stefan Kratsch, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
2026	J	`jnl`	Pattern-Sparse Tree Decompositions in H-Minor-Free Graphs. CoRR Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
2026	J	`jnl`	QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes. CoRR Édouard Bonnet, Jadwiga Czyzewska, Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski
2025	J	`jnl`	A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs. CoRR Jadwiga Czyzewska, Marcin Pilipczuk
2025	J	`jnl`	A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number. Discret. Math. Theor. Comput. Sci. Marcin Pilipczuk, Pawel Rzazewski
2025	A*	`conf`	Bounding SODA Romain Bourneuf, Marcin Pilipczuk
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`	Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints. SIAM J. Comput. Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2025	J	`jnl`	Flow-augmentation I: Directed graphs. J. ACM Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2025	B	`conf`	Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument. MFCS Romain Bourneuf, Jana Masaríková, Wojciech Nadara, Marcin Pilipczuk
2025	J	`jnl`	Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument. CoRR Romain Bourneuf, Jana Masaríková, Wojciech Nadara, Marcin Pilipczuk
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`	Polynomial-Time Approximation Schemes for Facility Location on Planar Graphs. SIAM J. Comput. Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk
2025	B	`conf`	Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number. ISAAC Maria Chudnovsky, Jadwiga Czyzewska, Kacper Kluk, Marcin Pilipczuk, Pawel Rzazewski
2025	J	`jnl`	The influence of dimensions on the complexity of computing decision trees. Artif. Intell. Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2024	J	`jnl`	Bounding ϵ-scatter dimension via metric sparsity. CoRR Romain Bourneuf, Marcin Pilipczuk
2024	J	`jnl`	Cluster Editing Parameterized above Modification-disjoint ACM Trans. Algorithms Shaohua Li, Marcin Pilipczuk, Manuel Sorge
2024	A*	`conf`	Combinatorial Correlation Clustering. STOC Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang
2024	J	`jnl`	Combinatorial Correlation Clustering. CoRR Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang
2024	—	`conf`	Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. SOSA Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza
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`	Flow-augmentation II: Undirected Graphs. ACM Trans. Algorithms Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2024	J	`jnl`	Induced Subgraphs of Bounded Treewidth and the Container Method. SIAM J. Comput. Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
2024	J	`jnl`	Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ACM Trans. Comput. Theory Konrad Majewski, Tomás Masarík, Jana Masaríková, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2024	A	`conf`	Max Weight Independent Set in Sparse Graphs with No Long Claws. STACS Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski
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	J	`jnl`	On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
2024	A	`conf`	Parameterized Complexity of MinCSP over the Point Algebra. ESA George Osipov, Marcin Pilipczuk, Magnus Wahlström
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	—	`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
2024	J	`jnl`	Sparse induced subgraphs in P CoRR Maria Chudnovsky, Jadwiga Czyzewska, Kacper Kluk, Marcin Pilipczuk, Pawel Rzazewski
2024	J	`jnl`	Taming Graphs with No Large Creatures and Skinny Ladders. SIAM J. Discret. Math. Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Masaríková, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2024	J	`jnl`	Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2023	J	`jnl`	A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number. CoRR Marcin Pilipczuk, Pawel Rzazewski
2023	A*	`conf`	A tight quasi-polynomial bound for Global Label Min-Cut. SODA Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
2023	J	`jnl`	Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. CoRR Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza
2023	J	`jnl`	Directed Symmetric Multicut is W[1]-hard. CoRR George Osipov, Marcin Pilipczuk
2023	A*	`conf`	Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
2023	A*	`conf`	Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. SODA Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2023	J	`jnl`	Max Weight Independent Set in sparse graphs with no long claws. CoRR Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski
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	B	`conf`	Parameterized Complexity Classification for Interval Constraints. IPEC Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
2023	J	`jnl`	Parameterized Complexity Classification for Interval Constraints. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
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`	Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$. Electron. J. Comb. Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
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	J	`jnl`	Sparse induced subgraphs in P_6-free graphs. CoRR Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2023	J	`jnl`	The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. Algorithmica Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
2023	A*	`conf`	The Influence of Dimensions on the Complexity of Computing Decision Trees. AAAI Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2023	J	`jnl`	Tight bound on treedepth in terms of pathwidth and longest path. CoRR Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
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	J	`jnl`	A tight quasi-polynomial bound for Global Label Min-Cut. CoRR Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
2022	B	`conf`	Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. WG Hugo Jacob, Marcin Pilipczuk
2022	J	`jnl`	Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs. CoRR Hugo Jacob, Marcin Pilipczuk
2022	J	`jnl`	Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2022	J	`jnl`	Constant Congestion Brambles. Discret. Math. Theor. Comput. Sci. Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge
2022	A*	`conf`	Directed flow-augmentation. STOC Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2022	J	`jnl`	Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
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`	Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. CoRR Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2022	J	`jnl`	Hardness of Metric Dimension in Graphs of Constant Treewidth. Algorithmica Shaohua Li, Marcin Pilipczuk
2022	J	`jnl`	Highly unbreakable graph with a fixed excluded minor are almost rigid. CoRR Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	A*	`conf`	Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2022	J	`jnl`	Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
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 weighted graph separation problems and flow-augmentation. CoRR Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
2022	J	`jnl`	Packing Directed Cycles Quarter- and Half-Integrally. Comb. Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
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`	Preface to the Special Issue on Parameterized and Exact Computation. Algorithmica Yixin Cao, Marcin Pilipczuk
2022	J	`jnl`	Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P CoRR Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
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	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	A	`conf`	Taming Graphs with No Large Creatures and Skinny Ladders. ESA Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2022	J	`jnl`	Taming graphs with no large creatures and skinny ladders. CoRR Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2022	J	`jnl`	The Influence of Dimensions on the Complexity of Computing Decision Trees. CoRR Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2021	J	`jnl`	(Theta, triangle)-free and (even hole, K J. Graph Theory Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
2021	J	`jnl`	A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. SIAM J. Discret. Math. Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
2021	B	`conf`	Close Relatives (Of Feedback Vertex Set), Revisited. IPEC Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk
2021	J	`jnl`	Close relatives (of Feedback Vertex Set), revisited. CoRR Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk
2021	A	`conf`	Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. STACS Shaohua Li, Marcin Pilipczuk, Manuel Sorge
2021	J	`jnl`	Constant congestion brambles in directed graphs. CoRR Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
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`	Directed flow-augmentation. CoRR Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
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	A*	`conf`	Finding large induced sparse subgraphs in STOC Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2021	B	`conf`	Hardness of Metric Dimension in Graphs of Constant Treewidth. IPEC Shaohua Li, Marcin Pilipczuk
2021	J	`jnl`	Hardness of Metric Dimension in Graphs of Constant Treewidth. CoRR Shaohua Li, Marcin Pilipczuk
2021	J	`jnl`	Improved Bounds for the Excluded-Minor Approximation of Treedepth. SIAM J. Discret. Math. Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
2021	A*	`conf`	Induced subgraphs of bounded treewidth and the container method. SODA Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
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	A*	`conf`	Optimal Discretization is Fixed-parameter Tractable. SODA Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
2021	J	`jnl`	Polynomial Treedepth Bounds in Linear Colorings. Algorithmica Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk, Blair D. Sullivan
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`	Solving hard cut problems via flow-augmentation. SODA Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2020	J	`jnl`	(Theta, triangle)-free and (even hole, K CoRR Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
2020	B	`ed.`	15th International Symposium on Parameterized and Exact Computation, IPEC 2020, Hong Kong (Virtual Conference), December 14-18, 2020 IPEC Yixin Cao, Marcin Pilipczuk
2020	J	`jnl`	A Double Exponential Lower Bound for the Distinct Vectors Problem. CoRR Marcin Pilipczuk, Manuel Sorge
2020	J	`jnl`	A Double Exponential Lower Bound for the Distinct Vectors Problem. Discret. Math. Theor. Comput. Sci. Marcin Pilipczuk, Manuel Sorge
2020	J	`jnl`	An Improved FPT Algorithm for Independent Feedback Vertex Set. Theory Comput. Syst. Shaohua Li, Marcin Pilipczuk
2020	J	`jnl`	Constant Congestion Brambles. CoRR Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge
2020	J	`jnl`	Covering minimal separators and potential maximal cliques in P CoRR Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
2020	J	`jnl`	Induced subgraphs of bounded treewidth and the container method. CoRR Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
2020	J	`jnl`	Introduction to the Special Issue on SODA'18. ACM Trans. Algorithms Yin Tat Lee, Marcin Pilipczuk, David P. Woodruff
2020	J	`jnl`	Multi-budgeted Directed Cuts. Algorithmica Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
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	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`	Optimal Discretization is Fixed-parameter Tractable. CoRR Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
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`	Solving hard cut problems via flow-augmentation. CoRR Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2020	—	`conf`	Surprising Applications of Treewidth Bounds for Planar Graphs. Treewidth, Kernels, and Algorithms Marcin Pilipczuk
2020	B	`conf`	The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. ISAAC Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
2020	J	`jnl`	The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. CoRR Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
2020	B	`conf`	The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki
2020	J	`jnl`	Two lower bounds for $p$-centered colorings. CoRR Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois
2020	J	`jnl`	Two lower bounds for p-centered colorings. Discret. Math. Theor. Comput. Sci. Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois
2019	A	`conf`	A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. STACS Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
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`	An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. Algorithmica Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz
2019	J	`jnl`	Caterpillars in Erdős-Hajnal. J. Comb. Theory B Anita Liebenau, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl
2019	J	`jnl`	Cluster Editing parameterized above the size of a modification-disjoint P CoRR Shaohua Li, Marcin Pilipczuk, Manuel Sorge
2019	J	`jnl`	Deleting Vertices to Graphs of Bounded Genus. Algorithmica Tomasz Kociumaka, Marcin Pilipczuk
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`	Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. ACM J. Exp. Algorithmics Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
2019	J	`jnl`	Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. ACM J. Exp. Algorithmics Michal Ziobro, Marcin Pilipczuk
2019	A	`conf`	Improved Bounds for the Excluded-Minor Approximation of Treedepth. ESA Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
2019	J	`jnl`	Improved bounds for the excluded-minor approximation of treedepth. CoRR Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
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	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	A	`conf`	Packing Directed Circuits Quarter-Integrally. ESA Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2019	J	`jnl`	Packing directed circuits quarter-integrally. CoRR Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
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	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	J	`jnl`	Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2019	J	`jnl`	Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. Algorithmica Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna
2018	J	`jnl`	A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs. CoRR Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
2018	B	`conf`	An Improved FPT Algorithm for Independent Feedback Vertex Set. WG Shaohua Li, Marcin Pilipczuk
2018	J	`jnl`	An improved FPT algorithm for Independent Feedback Vertex Set. CoRR Shaohua Li, Marcin Pilipczuk
2018	J	`jnl`	Approximation and Kernelization for Chordal Vertex Deletion. SIAM J. Discret. Math. Bart M. P. Jansen, Marcin Pilipczuk
2018	J	`jnl`	Caterpillars in Erdős-Hajnal. CoRR Anita Liebenau, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl
2018	J	`jnl`	Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. SIAM J. Discret. Math. Chandra Chekuri, Alina Ene, Marcin Pilipczuk
2018	J	`jnl`	Directed Multicut is W[1]-hard, Even for Four Terminal Pairs. ACM Trans. Comput. Theory Marcin Pilipczuk, Magnus Wahlström
2018	B	`conf`	Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. SEA Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
2018	J	`jnl`	Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. CoRR Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
2018	J	`jnl`	Excluding Hooks and their Complements. Electron. J. Comb. Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel, Marcin Pilipczuk
2018	B	`conf`	Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set. SEA Krzysztof Kiljan, Marcin Pilipczuk
2018	J	`jnl`	Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set. CoRR Krzysztof Kiljan, Marcin Pilipczuk
2018	J	`jnl`	Experimental Evaluation of Parameterized Algorithms for Graph Separation Problems: Half-Integral Relaxations and Matroid-based Kernelization. CoRR Marcin Pilipczuk, Michal Ziobro
2018	B	`conf`	Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. SEA Michal Ziobro, Marcin Pilipczuk
2018	J	`jnl`	Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. CoRR Michal Ziobro, Marcin Pilipczuk
2018	J	`jnl`	Independence and Efficient Domination on ACM Trans. Algorithms Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
2018	B	`conf`	Multi-Budgeted Directed Cuts. IPEC Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
2018	J	`jnl`	Multi-budgeted directed cuts. CoRR Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
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	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	—	`ch.`	Planar Digraphs. Classes of Directed Graphs Marcin Pilipczuk, Michal Pilipczuk
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`	Subexponential-time Algorithms for Maximum Independent Set in P CoRR Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2017	J	`jnl`	A tight lower bound for Vertex Planarization on graphs of bounded treewidth. Discret. Appl. Math. Marcin Pilipczuk
2017	B	`conf`	An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. IPEC Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz
2017	J	`jnl`	An exponential lower bound for cut sparsifiers in planar graphs. CoRR Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz
2017	A*	`conf`	Approximation and Kernelization for Chordal Vertex Deletion. SODA Bart M. P. Jansen, Marcin Pilipczuk
2017	J	`jnl`	Deleting vertices to graphs of bounded genus. CoRR Tomasz Kociumaka, Marcin Pilipczuk
2017	J	`jnl`	Editorial. ACM Trans. Algorithms Alexandr Andoni, Debmalya Panigrahi, Marcin 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	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	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	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	A	`conf`	Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. ESA Dániel Marx, Marcin Pilipczuk
2017	J	`jnl`	The Erdős-Hajnal conjecture for caterpillars and their complements. CoRR Anita Liebenau, Marcin Pilipczuk
2017	J	`jnl`	Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. CoRR Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna
2017	B	`conf`	Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. IPEC Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna
2016	J	`jnl`	A Fast Branching Algorithm for Cluster Vertex Deletion. Theory Comput. Syst. Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk
2016	J	`jnl`	Approximation and Kernelization for Chordal Vertex Deletion. CoRR Bart M. P. Jansen, Marcin Pilipczuk
2016	A*	`conf`	Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. ICALP Chandra Chekuri, Alina Ene, Marcin 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	A*	`conf`	Directed multicut is SODA Marcin Pilipczuk, Magnus Wahlström
2016	B	`conf`	Edge Bipartization Faster Than 2^k. IPEC Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna
2016	—	`ch.`	Exact Algorithms on Graphs of Bounded Average Degree. Encyclopedia of Algorithms Marcin Pilipczuk
2016	J	`jnl`	Hardness of approximation for strip packing. CoRR Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk
2016	A*	`conf`	Independence and Efficient Domination on SODA Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
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	—	`conf`	Lower Bounds for Approximation Schemes for Closest String. SWAT Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	J	`jnl`	On Group Feedback Vertex Set Parameterized by the Size of the Cutset. Algorithmica Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk
2016	—	`conf`	On Routing Disjoint Paths in Bounded Treewidth Graphs. SWAT Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski
2016	—	`ch.`	Planar Directed k-Vertex-Disjoint Paths Problem. Encyclopedia of Algorithms Marcin Pilipczuk
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 graphs of polynomial growth. CoRR Dániel Marx, Marcin 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
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`	A tight lower bound for Vertex Planarization on graphs of bounded treewidth. CoRR Marcin Pilipczuk
2015	J	`jnl`	Directed multicut is W[1]-hard, even for four terminal pairs. CoRR Marcin Pilipczuk, Magnus Wahlström
2015	J	`jnl`	Edge Bipartization faster than 2 CoRR Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna
2015	J	`jnl`	Faster exponential-time algorithms in graphs of bounded average degree. Inf. Comput. Marek Cygan, Marcin 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`	Independence and Efficient Domination on P CoRR Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
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`	On Routing Disjoint Paths in Bounded Treewidth Graphs. CoRR Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski
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`	Sitting Closer to Friends than Enemies, Revisited. Theory Comput. Syst. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
2015	A*	`conf`	The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. STOC Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych
2014	Misc	`conf`	A Fast Branching Algorithm for Cluster Vertex Deletion. CSR Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin 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	J	`jnl`	Faster deterministic Feedback Vertex Set. Inf. Process. Lett. Tomasz Kociumaka, Marcin Pilipczuk
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`	Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs. ACM Trans. Comput. Theory Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman
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`	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	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 bound on the number of perfect matchings in Klee-graphs. Discret. Math. Theor. Comput. Sci. Marek Cygan, Marcin Pilipczuk, Riste Skrekovski
2013	J	`jnl`	Dynamic Steiner Tree in Planar Graphs. CoRR Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych
2013	J	`jnl`	Fast branching algorithm for Cluster Vertex Deletion. CoRR Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk
2013	—	`conf`	Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree. ICALP (1) Marek Cygan, Marcin Pilipczuk
2013	J	`jnl`	Faster deterministic Feedback Vertex Set. CoRR Tomasz Kociumaka, Marcin Pilipczuk
2013	J	`jnl`	Faster exponential-time algorithms in graphs of bounded average degree CoRR Marek Cygan, Marcin Pilipczuk
2013	A*	`conf`	Known algorithms for EDGE CLIQUE COVER are probably optimal. SODA Marek Cygan, Marcin Pilipczuk, 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	J	`jnl`	Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms. Inf. Process. Lett. Marek Cygan, Marcin 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
2013	J	`jnl`	Towards optimal kernel for connected vertex cover in planar graphs. Discret. Appl. Math. Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan
2012	A	`conf`	A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. ESA Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski
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	J	`jnl`	Bandwidth and distortion revisited. Discret. Appl. Math. Marek Cygan, Marcin Pilipczuk
2012	—	`conf`	Clique Cover and Graph Separation: New Incompressibility Results. ICALP (1) Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
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	J	`jnl`	Even Faster Exact Bandwidth. ACM Trans. Algorithms Marek Cygan, Marcin 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	—	`conf`	Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs. SWAT Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman
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	B	`conf`	On Group Feedback Vertex Set Parameterized by the Size of the Cutset. WG Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk
2012	J	`jnl`	On fixed-parameter algorithms for Split Vertex Deletion CoRR Marek Cygan, Marcin 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`	Approximation Algorithms for Union and Intersection Covering Problems CoRR Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
2011	—	`conf`	Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
2011	J	`jnl`	Breaking the 2 J. Discrete Algorithms Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	Capacitated domination faster than Inf. Process. Lett. Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
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	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	J	`jnl`	On the Zagreb index inequality of graphs with prescribed vertex degrees. Discret. Appl. Math. Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski
2011	B	`conf`	Parameterized Complexity of Eulerian Deletion Problems. WG Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter
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
2011	J	`jnl`	Towards optimal kernel for connected vertex cover in planar graphs CoRR Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan
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`	Bandwidth and Distortion Revisited CoRR Marek Cygan, Marcin Pilipczuk
2010	—	`conf`	Capacitated Domination Faster Than SWAT Marek Cygan, Marcin 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	J	`jnl`	Exact and approximate bandwidth. Theor. Comput. Sci. Marek Cygan, Marcin Pilipczuk
2010	—	`conf`	Fast Approximation in Subspaces by Doubling Metric Decomposition. ESA (1) Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
2010	C	`conf`	Irredundant Set Faster Than CIAC Marek Cygan, Marcin 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
2009	J	`jnl`	Beyond O*(2^n) in domination-type problems CoRR Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
2009	J	`jnl`	Even Faster Exact Bandwidth CoRR Marek Cygan, Marcin Pilipczuk
2009	—	`conf`	Exact and Approximate Bandwidth. ICALP (1) Marek Cygan, Marcin Pilipczuk
2009	J	`jnl`	Fast Approximation in Subspaces by Doubling Metric Decomposition CoRR Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
2008	J	`jnl`	Exponential-Time Approximation of Hard Problems CoRR Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz
2008	B	`conf`	Faster Exact Bandwidth. WG Marek Cygan, Marcin Pilipczuk