Michał Pilipczuk

Michał Pilipczuk is an Associate Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw. His research focuses on theoretical computer science, particularly algorithms on discrete structures, parameterized algorithms, structural graph theory, and logic in computer science. He leads the ERC-funded project "BOBR: Decomposition Method for Discrete Problems" and previously led a grant on optimality in parameterized complexity funded by the Polish National Science Center.

His research interests include parameterized algorithms, structural graph theory, graph algorithms, and computational complexity. He has made significant contributions to the understanding of problems such as Independent Set in restricted graph classes, graph editing problems, and structural decompositions.

The recent publications highlight a strong focus on structural graph theory and exact algorithms. Key themes include quasi-polynomial time algorithms for Independent Set in claw-free graphs, diameter computation in bounded genus graphs, and kernelization in trivially perfect graphs. His work often bridges combinatorial insights with algorithmic applications, particularly in the context of parameterized complexity.

• Principal Investigator, ERC Grant BOBR: Decomposition Method for Discrete Problems (2021–2026)
• Principal Investigator, Polish National Science Center Grant on Optimality in Parameterized Complexity (2014–2017)

He has advised or collaborated with several researchers, including Marcin Wrochna and Marcin Pilipczuk. His work is published in top venues such as STOC, SODA, ESA, and ICALP.