Michał Pilipczuk
Scholar

Michał Pilipczuk

Google Scholar ID: RPD8Up0AAAAJ
University of Warsaw
Parameterized complexitygraph theory
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
6,029
 
H-index
32
 
i10-index
104
 
Publications
20
 
Co-authors
47
list available
Contact
CVOpen ↗
Publications
19 items
Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
2026
Cited
0
Variants of Merge-Width and Applications
2026
Cited
1
Tree decompositions whose trees are subgraphs: An application of Simon's factorization
2026
Cited
0
Dynamic data structures for twin-ordered matrices
2026
Cited
0
Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
2026
Cited
0
Efficient reversal of transductions of sparse graph classes
2026
Cited
1
A Note on the Parameterised Complexity of Coverability in Vector Addition Systems
2025
Cited
0
On Integer Programs That Look Like Paths
2025
Cited
0
Resume (English only)
Research Experience
  • An associate professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw.
Background
  • Research interests include algorithms on discrete structures (particularly, parameterized algorithms), structural graph theory, and logic in computer science.
Co-authors
47 total
Marcin Pilipczuk
Marcin Pilipczuk
Instytut Informatyki, Uniwersytet Warszawski
Marek Cygan
Marek Cygan
University of Warsaw
Fedor V. Fomin
Fedor V. Fomin
Professor of Computer Science, University of Bergen
Saket Saurabh
Saket Saurabh
Professor at Institute of Mathematical Sciences
Dániel Marx
Dániel Marx
CISPA Helmholtz Center for Information Security
Daniel Lokshtanov
Daniel Lokshtanov
Professor of Computer Science, UCSB
Sebastian Siebertz
Sebastian Siebertz
Universität Bremen, AG Theoretische Informatik
Co-author 8
Co-author 8