Michał Pilipczuk

University of Warsaw — Poland

Computer Science · Physical Sciences

28h-index5.7kcitations390works0.82yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(290), Complexity and Algorithms in Graphs(223), Limits and Structures in Graph Theory(66), Optimization and Search Problems(58), semigroups and automata theory(45)

Publications390 total

Sparse Induced Subgraphs in <b> <i>P</i> </b> <sub> <b>6</b> </sub> -free Graphs
ACM Transactions on Algorithms·2025
Prime and polynomial distances in colourings of the plane
Israel Journal of Mathematics·2025Open Access
Box-Reachability in Vector Addition Systems
Lecture notes in computer science·2025
Box-Reachability in Vector Addition Systems
arXiv (Cornell University)·2025Open Access
Parameterized algorithms for block-structured integer programs with large entries
TheoretiCS·2025· 1 citedOpen Access
Polynomial-Time Approximation Schemes for Facility Location on Planar Graphs
SIAM Journal on Computing·2025
3D-grids are not transducible from planar graphs
2025· 2 cited
First-order transducibility among classes of sparse graphs
ArXiv.org·2025· 1 citedOpen Access
Separability Properties of Monadically Dependent Graph Classes
arXiv (Cornell University)·2025Open Access
Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
arXiv (Cornell University)·2025Open Access
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
ACM Transactions on Computation Theory·2025Open Access
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
SIAM Journal on Computing·2025
On graphs coverable by chubby shortest paths
ArXiv.org·2025Open Access
On coarse tree decompositions and coarse balanced separators
arXiv (Cornell University)·2025Open Access
Low rank MSO
arXiv (Cornell University)·2025Open Access
Maintaining CMSO <sub>2</sub> properties on dynamic structures with bounded feedback vertex number
ACM Transactions on Computation Theory·2025Open Access
Obstructions and dualities for matroid depth parameters
ArXiv.org·2025Open Access
Graph classes through the lens of logic
arXiv (Cornell University)·2025· 1 citedOpen Access
Faster Diameter Computation in Graphs of Bounded Euler Genus
arXiv (Cornell University)·2025Open Access
Embedding Planar Graphs into Graphs of Treewidth <i>O</i> (log<sup>3</sup> <i>n</i> )
Society for Industrial and Applied Mathematics eBooks·2025
page 1 of 20Next →

Frequent Co-authors

Marcin Pilipczuk(33), Marek Cygan(20), Fedor V. Fomin(14), Daniel Lokshtanov(12), Dániel Marx(9), Saket Saurabh(9), Jakub Onufry Wojtaszczyk(9), Pål Grønås Drange(6), Stefan Kratsch(5), Yngve Villanger(4), Sebastian Siebertz(4), Łukasz Kowalik(3), Markus Sortland Dregi(3), Magnus Wahlström(3), Andrzej Grzesik(3), Tereza Klimošová(3), Stephan Kreutzer(3), Piotr Sankowski(3), Erik Jan van Leeuwen(3), Jesper Nederlof(2)