2026 Michał Pilipczuk: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	35	11510	11180	28	27	364	7340

Overview

Michał Pilipczuk is affiliated with the University of Warsaw in Poland and works primarily within the field of computer science. Their research spans a range of subfields and topics focusing largely on theoretical and mathematical aspects of computing.

The main fields of study include:

Computer Science

Subfields within computer science where they have contributed include:

Computational Theory and Mathematics
Computer Networks and Communications
Discrete Mathematics and Combinatorics
Artificial Intelligence
Computer Graphics and Computer-Aided Design

The primary research topics explored in their work are:

Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Limits and Structures in Graph Theory
Semigroups and Automata Theory
Computational Geometry and Mesh Generation
Optimization and Search Problems
Graph Labeling and Dimension Problems

Recent scholarly papers authored or coauthored by Michał Pilipczuk include:

Polynomial bounds for centered colorings on proper minor-closed graph classes, 2021, Journal of Combinatorial Theory Series B
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, 2022, ACM Transactions on Algorithms
First-Order Interpretations of Bounded Expansion Classes, 2020, HAL (Le Centre pour la Communication Scientifique Directe)
Polynomial-time Algorithm for Maximum Weight Independent Set on P₆-free Graphs, 2022, ACM Transactions on Algorithms
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams, 2022, ACM Transactions on Algorithms

Michał Pilipczuk frequently collaborates with the following co-authors:

Marcin Pilipczuk
Marek Sokołowski
Paweł Rzążewski
Sebastian Siebertz
Szymon Toruńczyk

The scholar has published extensively in notable venues, including:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
ACM Transactions on Algorithms
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics

Best Publications

Parameterized Algorithms

Marek Cygan;Fedor V. Fomin;Lukasz Kowalik;Daniel Lokshtanov

2673
Citations
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

Marek Cygan;Jesper Nederlof;Marcin Pilipczuk;Michal Pilipczuk

362
Citations
Lower bounds based on the Exponential Time Hypothesis

Daniel Lokshtanov;Dániel Marx;Saket Saurabh

359
Citations
A $c^k n$ 5-Approximation Algorithm for Treewidth

Hans L. Bodlaender;Pål Grǿnås Drange;Markus S. Dregi;Fedor V. Fomin

202
Citations
On multiway cut parameterized above lower bounds

Marek Cygan;Marcin Pilipczuk;Michał Pilipczuk;Jakub Onufry Wojtaszczyk

135
Citations
Designing FPT Algorithms for Cut Problems Using Randomized Contractions

Rajesh Chitnis;Marek Cygan;MohammadTaghi Hajiaghayi;Marcin Pilipczuk

107
Citations
Minimum Bisection Is Fixed-Parameter Tractable

Marek Cygan;Daniel Lokshtanov;Marcin Pilipczuk;Michał Pilipczuk

105
Citations
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams

Dániel Marx;Michał Pilipczuk

104
Citations
An O(c^k n) 5-Approximation Algorithm for Treewidth

Hans L. Bodlaender;Pal Gronas Drange;Markus S. Dregi;Fedor V. Fomin

90
Citations
How to hunt an invisible rabbit on a graph

Tatjana V. Abramovskaya;Fedor V. Fomin;Petr A. Golovach;Michał Pilipczuk

88
Citations
Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Marek Adam Cygan;Marcin Łukasz Pilipczuk;Michał Pilipczuk;Jakub Onufry Wojtaszczyk

88
Citations
Solving connectivity problems parameterized by treewidth in single exponential time

Marek Cygan;Jesper Nederlof;Marcin Pilipczuk;Michał Pilipczuk

86
Citations
Known Algorithms for Edge Clique Cover are Probably Optimal

Marek Cygan;Marcin Pilipczuk;Michał Pilipczuk

72
Citations
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters

Fedor V. Fomin;Stefan Kratsch;Marcin Pilipczuk;Michał Pilipczuk

71
Citations
Kernelization hardness of connectivity problems in d-degenerate graphs

Marek Cygan;Marcin Pilipczuk;Michał Pilipczuk;Jakub Onufry Wojtaszczyk

71
Citations
First-Order Interpretations of Bounded Expansion Classes

Jakub Gajarský;Stephan Kreutzer;Jaroslav NešETřil;Patrice Ossona De Mendez

70
Citations
The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable

Marek Cygan;Daniel Marx;Marcin Pilipczuk;Michal Pilipczuk

69
Citations
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).

Dániel Marx;Michal Pilipczuk

66
Citations
Problems parameterized by treewidth tractable in single exponential time: a logical approach

Michal Pilipczuk

65
Citations
Fixed-parameter Tractability of Multicut in Directed Acyclic Graphs

Stefan Kratsch;Marcin Pilipczuk;MichaŁ Pilipczuk;Magnus Wahlström

62
Citations
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

Daniel Lokshtanov;Marcin Pilipczuk;Michał Pilipczuk;Saket Saurabh

61
Citations
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth

Fedor V. Fomin;Daniel Lokshtanov;Michał Pilipczuk;Saket Saurabh

61
Citations
Clique Cover and Graph Separation: New Incompressibility Results

Marek Cygan;Stefan Kratsch;Marcin Pilipczuk;Michał Pilipczuk

56
Citations
13th International Symposium on Parameterized and Exact Computation (IPEC 2018)

Christophe Paul;Michal Pilipczuk

40
Citations
Tight bounds for parameterized complexity of Cluster Editing

Fedor V. Fomin;Stefan Kratsch;Marcin Łukasz Pilipczuk;Michał Pilipczuk

21
Citations

Frequent Co-Authors

Marek Cygan University of Warsaw

Fedor V. Fomin University of Bergen

Daniel Lokshtanov University of California, Santa Barbara

Saket Saurabh Institute of Mathematical Sciences

Dániel Marx Saarland University

Dimitrios M. Thilikos National and Kapodistrian University of Athens

Maria Chudnovsky Princeton University

Christophe Paul University of Montpellier

Martin Grohe RWTH Aachen University

Hans L. Bodlaender Utrecht University

External Links

Personal website of Michał Pilipczuk

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring degrees related to Computer Science can open new career opportunities and areas of expertise. Flexible online programs are making it easier than ever to earn valuable qualifications from home or while working.

Many students begin with a 2-year computer science degree online, gaining foundational skills for entry-level tech roles or further education. For those interested in sustainability, an environmental engineering degree online combines engineering principles with environmental stewardship—an increasingly vital field.

If you’re considering engineering, it’s important to be aware of the mechanical engineering cost of education. Affordable online options can make this career path more accessible, offering flexibility with lower tuition. Likewise, if your interests lie in the sciences, a physics degree online can lead to roles in research, technology, or academia.

These related online degrees are tailored for today’s digital learners and support diverse career goals in the expanding tech-driven world.