M. Pilipczuk

Most-cited papers

Randomized Contractions Meet Lean Decompositions
M. Cygan, Pawel Komosa, D. Lokshtanov, M. Pilipczuk +3 more
2018ACM Trans. Algorithms44 citations Open access
Semantic Scholar
Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths
M. Pilipczuk, Michał Pilipczuk, Paweł Rzaͅżewski
2020SIAM Symposium on Simplicity in Algorithms43 citations
Semantic Scholar
Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time
Peter Gartland, D. Lokshtanov, M. Pilipczuk, Michał Pilipczuk +1 more
2020Symposium on the Theory of Computing41 citations Open access
Semantic Scholar
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
M. Chudnovsky, M. Pilipczuk, Michał Pilipczuk, Stéphan Thomassé
2019ACM-SIAM Symposium on Discrete Algorithms41 citations Open access
Semantic Scholar
Induced subgraphs of bounded treewidth and the container method
Tara Abrishami, M. Chudnovsky, M. Pilipczuk, Paweł Rzaͅżewski +1 more
2020ACM-SIAM Symposium on Discrete Algorithms34 citations Open access
Semantic Scholar
Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
Hugo Jacob, M. Pilipczuk
2022International Workshop on Graph-Theoretic Concepts in Computer Science33 citations Open access
Semantic Scholar
Combinatorial Correlation Clustering
Vincent Cohen-Addad, David Rasmussen Lolck, M. Pilipczuk, Mikkel Thorup +2 more
2024Symposium on the Theory of Computing30 citations Open access
Semantic Scholar
Improved bounds for the excluded-minor approximation of treedepth
Wojciech Czerwinski, Wojciech Nadara, M. Pilipczuk
2019Embedded Systems and Applications28 citations
Semantic Scholar
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
Peter Gartland, D. Lokshtanov, Tomáš Masařík, M. Pilipczuk +2 more
2023Symposium on the Theory of Computing27 citations Open access
Semantic Scholar
On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five
M. Chudnovsky, M. Pilipczuk, Michał Pilipczuk, Stéphan Thomassé
2019SIAM Journal on Discrete Mathematics23 citations Open access
Semantic Scholar
Directed flow-augmentation
Eun Jung Kim, Stefan Kratsch, M. Pilipczuk, Magnus Wahlström
2022Symposium on the Theory of Computing22 citations Open access
Semantic Scholar
Caterpillars in Erdős-Hajnal
Anita Liebenau, M. Pilipczuk, P. Seymour, S. Spirkl
2018J. Comb. Theory B21 citations Open access
Semantic Scholar
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
Jiehua Chen, Wojciech Czerwi'nski, Y. Disser, Andreas Emil Feldmann +7 more
2020ACM-SIAM Symposium on Discrete Algorithms20 citations Open access
Semantic Scholar
Subexponential-Time Algorithms for Maximum Independent Set in Pt\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_t$$\
G. Bacsó, D. Lokshtanov, Dániel Marx, M. Pilipczuk +2 more
2018Algorithmica20 citations Open access
Semantic Scholar
On the Complexity of Problems on Tree-structured Graphs
H. Bodlaender, Carla Groenland, Hugo Jacob, M. Pilipczuk +1 more
2022International Symposium on Parameterized and Exact Computation18 citations Open access
Semantic Scholar
Solving hard cut problems via flow-augmentation
Eun Jung Kim, Stefan Kratsch, M. Pilipczuk, Magnus Wahlström
2020ACM-SIAM Symposium on Discrete Algorithms18 citations Open access
Semantic Scholar
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
S. KarthikC, Dániel Marx, M. Pilipczuk, Uéverton dos Santos Souza
2023SIAM Symposium on Simplicity in Algorithms17 citations
Semantic Scholar
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
Eun Jung Kim, Stefan Kratsch, M. Pilipczuk, Magnus Wahlström
2022ACM-SIAM Symposium on Discrete Algorithms17 citations Open access
Semantic Scholar
A Tight Quasi-Polynomial Bound for Global Label Min-Cut
Lars Jaffke, Paloma T. Lima, Tomáš Masařík, M. Pilipczuk +1 more
2022ACM-SIAM Symposium on Discrete Algorithms16 citations Open access
Semantic Scholar
Hardness of Metric Dimension in Graphs of Constant Treewidth
Shaohua Li, M. Pilipczuk
2021Algorithmica16 citations Open access
Semantic Scholar
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1*
Vincent Cohen-Addad, Hung Le, M. Pilipczuk, Michał Pilipczuk
2023IEEE Annual Symposium on Foundations of Computer Science15 citations
Semantic Scholar
The Influence of Dimensions on the Complexity of Computing Decision Trees
S. Kobourov, M. Löffler, F. Montecchiani, M. Pilipczuk +4 more
2022AAAI Conference on Artificial Intelligence15 citations Open access
Semantic Scholar
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth
Lukasz Kowalik, M. Mucha, Wojciech Nadara, M. Pilipczuk +2 more
2020International Symposium on Parameterized and Exact Computation14 citations
Semantic Scholar
(Theta, triangle)‐free and (even hole, K 4 )‐free graphs. Part 2: Bounds on treewidth
M. Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
2020Journal of Graph Theory14 citations Open access
Semantic Scholar
A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs
B. Jansen, M. Pilipczuk, E. V. van Leeuwen
2018Symposium on Theoretical Aspects of Computer Science14 citations
Semantic Scholar
Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set
K. Kiljan, M. Pilipczuk
2018The Sea14 citations
Semantic Scholar
Flow-augmentation I: Directed graphs
Eun Jung Kim, Stefan Kratsch, M. Pilipczuk, Magnus Wahlström
2021Journal of the ACM13 citations Open access
Semantic Scholar
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
Andrzej Grzesik, Tereza Klimošová, M. Pilipczuk, Michał Pilipczuk
2019ACM-SIAM Symposium on Discrete Algorithms13 citations Open access
Semantic Scholar
An Improved FPT Algorithm for Independent Feedback Vertex Set
Shaohua Li, M. Pilipczuk
2018Theory of Computing Systems13 citations Open access
Semantic Scholar
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
Vincent Cohen-Addad, Michał Pilipczuk, M. Pilipczuk
2019IEEE Annual Symposium on Foundations of Computer Science12 citations Open access
Semantic Scholar
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth
Michal Ziobro, M. Pilipczuk
2018The Sea12 citations
Semantic Scholar
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
Wojciech Nadara, M. Pilipczuk, R. Rabinovich, F. Reidl +1 more
2018The Sea12 citations Open access
Semantic Scholar
Multi-budgeted Directed Cuts
Stefan Kratsch, Shaohua Li, Dániel Marx, M. Pilipczuk +1 more
2018Algorithmica12 citations Open access
Semantic Scholar
On weighted graph separation problems and flow-augmentation
Eun Jung Kim, Tomáš Masařík, M. Pilipczuk, Roohani Sharma +1 more
2022SIAM Journal on Discrete Mathematics10 citations Open access
Semantic Scholar
Efficient approximation schemes for uniform-cost clustering problems in planar graphs
Vincent Cohen-Addad, M. Pilipczuk, Michał Pilipczuk
2019Embedded Systems and Applications10 citations Open access
Semantic Scholar
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument
Konrad Majewski, Tomáš Masařík, Jana Masaříková, Karolina Okrasa +3 more
2022International Colloquium on Automata, Languages and Programming9 citations
Semantic Scholar
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor
D. Lokshtanov, M. Pilipczuk, Michał Pilipczuk, Saket Saurabh
2022Symposium on the Theory of Computing9 citations Open access
Semantic Scholar
Sparse Induced Subgraphs in P6-free Graphs
M. Chudnovsky, Rose McCarty, M. Pilipczuk, Michał Pilipczuk +1 more
2023ACM-SIAM Symposium on Discrete Algorithms8 citations Open access
Semantic Scholar
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomáš Masařík +3 more
2022ACM-SIAM Symposium on Discrete Algorithms8 citations Open access
Semantic Scholar
Flow-augmentation II: Undirected Graphs
Eun Jung Kim, Stefan Kratsch, M. Pilipczuk, Magnus Wahlström
2020ACM Trans. Algorithms8 citations Open access
Semantic Scholar
Constant Congestion Brambles
Meike Hatzel, Pawel Komosa, M. Pilipczuk, Manuel Sorge
2020Discrete Mathematics & Theoretical Computer Science8 citations Open access
Semantic Scholar
Cluster Editing Parameterized above Modification-disjoint P3-packings
Shaohua Li, M. Pilipczuk, Manuel Sorge
2019Symposium on Theoretical Aspects of Computer Science8 citations Open access
Semantic Scholar
Close relatives (of Feedback Vertex Set), revisited
Hugo Jacob, Thomas Bellitto, Oscar Defrain, M. Pilipczuk
2021International Symposium on Parameterized and Exact Computation7 citations
Semantic Scholar
Polynomial Treedepth Bounds in Linear Colorings
Jeremy Kun, Michael P. O'Brien, M. Pilipczuk, Blair D. Sullivan
2018Algorithmica7 citations Open access
Semantic Scholar
Coarse Balanced Separators in Fat-Minor-Free Graphs
Édouard Bonnet, Hung Le, M. Pilipczuk, Michał Pilipczuk
2026arXiv.org6 citations
Semantic Scholar
On coarse tree decompositions and coarse balanced separators
Tara Abrishami, Jadwiga Czyżewska, Kacper Kluk, M. Pilipczuk +2 more
2025arXiv.org6 citations
Semantic Scholar
Bounding ϵ-scatter dimension via metric sparsity
Romain Bourneuf, M. Pilipczuk
2024arXiv.org6 citations
Semantic Scholar
Parameterized Complexity of MinCSP over the Point Algebra
George Osipov, M. Pilipczuk, Magnus Wahlstrom
2023Embedded Systems and Applications6 citations
Semantic Scholar
Taming graphs with no large creatures and skinny ladders
Jakub Gajarsk'y, Lars Jaffke, Paloma T. Lima, Jana Masaríková +3 more
2022Embedded Systems and Applications6 citations Open access
Semantic Scholar
Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4
Linda Cook, Tomáš Masařík, M. Pilipczuk, Amadeus Reinald +1 more
2022Electronic Journal of Combinatorics6 citations
Semantic Scholar