Michał Pilipczuk

5.5k total citations · 1 hit paper
101 papers, 1.5k citations indexed

About

Michał Pilipczuk is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Michał Pilipczuk has authored 101 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 94 papers in Computational Theory and Mathematics, 31 papers in Computer Networks and Communications and 23 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Michał Pilipczuk's work include Advanced Graph Theory Research (86 papers), Complexity and Algorithms in Graphs (68 papers) and Limits and Structures in Graph Theory (23 papers). Michał Pilipczuk is often cited by papers focused on Advanced Graph Theory Research (86 papers), Complexity and Algorithms in Graphs (68 papers) and Limits and Structures in Graph Theory (23 papers). Michał Pilipczuk collaborates with scholars based in Poland, Norway and Germany. Michał Pilipczuk's co-authors include Marcin Pilipczuk, Marek Cygan, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dániel Marx, Łukasz Kowalik, Jakub Onufry Wojtaszczyk, Pål Grønås Drange and Sebastian Siebertz and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Michał Pilipczuk

91 papers receiving 1.5k citations

Hit Papers

Parameterized Algorithms 2015 2026 2018 2022 2015 200 400 600
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Parameterized Algorithms
    2015 745 citations Marek Cygan, Fedor V. Fomin et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Michał Pilipczuk Poland 14 1.3k 456 217 203 114 101 1.5k
Marcin Pilipczuk Poland 15 1.2k 1.0× 464 1.0× 206 0.9× 196 1.0× 118 1.0× 102 1.5k
Dimitrios M. Thilikos Greece 25 1.6k 1.3× 809 1.8× 244 1.1× 336 1.7× 117 1.0× 125 2.1k
Daniel Lokshtanov Norway 22 2.0k 1.6× 772 1.7× 333 1.5× 284 1.4× 174 1.5× 159 2.4k
Jörg Flum Germany 12 1.5k 1.2× 545 1.2× 156 0.7× 739 3.6× 73 0.6× 46 1.9k
Dieter Kratsch France 27 1.9k 1.5× 756 1.7× 356 1.6× 234 1.2× 214 1.9× 132 2.2k
Henning Fernau Germany 18 1.0k 0.8× 354 0.8× 70 0.3× 394 1.9× 85 0.7× 190 1.3k
Petr A. Golovach Norway 17 922 0.7× 296 0.6× 277 1.3× 90 0.4× 110 1.0× 149 1.0k
Frances Rosamond Australia 16 698 0.5× 258 0.6× 65 0.3× 159 0.8× 61 0.5× 64 878
Ross M. McConnell United States 19 928 0.7× 269 0.6× 154 0.7× 345 1.7× 132 1.2× 43 1.2k
Fǎnicǎ Gavril Israel 17 1.2k 1.0× 575 1.3× 199 0.9× 121 0.6× 183 1.6× 35 1.5k

Countries citing papers authored by Michał Pilipczuk

Since Specialization
Citations

This map shows the geographic impact of Michał Pilipczuk's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michał Pilipczuk with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michał Pilipczuk more than expected).

Fields of papers citing papers by Michał Pilipczuk

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michał Pilipczuk. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michał Pilipczuk. The network helps show where Michał Pilipczuk may publish in the future.

Co-authorship network of co-authors of Michał Pilipczuk

This figure shows the co-authorship network connecting the top 25 collaborators of Michał Pilipczuk. A scholar is included among the top collaborators of Michał Pilipczuk based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michał Pilipczuk. Michał Pilipczuk is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Pilipczuk, Michał, et al.. (2024). Elementary first-order model checking for sparse graphs. 1–14. 1 indexed citations
2.
Lokshtanov, Daniel, et al.. (2024). Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. 683–691. 2 indexed citations
3.
Cohen-Addad, Vincent, Hung Lê, Marcin Pilipczuk, & Michał Pilipczuk. (2023). Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1*. 2262–2277.
4.
Pilipczuk, Michał, et al.. (2023). Graphs of bounded twin-width are quasi-polynomially χ-bounded. Journal of Combinatorial Theory Series B. 161. 382–406. 3 indexed citations
5.
Bonamy, Marthe, et al.. (2023). Partitioning edges of a planar graph into linear forests and a matching. Journal of Graph Theory. 104(3). 659–677.
6.
Pilipczuk, Michał, et al.. (2022). Dynamic Data Structures for Timed Automata Acceptance. Algorithmica. 84(11). 3223–3245. 4 indexed citations
7.
Eisenbrand, Friedrich, et al.. (2021). Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
8.
Grzesik, Andrzej, et al.. (2019). Polynomial-time algorithm for maximum weight independent set on P6-free graphs. Symposium on Discrete Algorithms. 1257–1271. 9 indexed citations
9.
Pilipczuk, Michał & Sebastian Siebertz. (2019). Polynomial bounds for centered colorings on proper minor-closed graph classes. Symposium on Discrete Algorithms. 1501–1520. 8 indexed citations
10.
Czerwiński, Wojciech, et al.. (2019). Shortest paths in one-counter systems. Logical Methods in Computer Science. Volume 15, Issue 1.
11.
Bringmann, Karl, et al.. (2019). On Geometric Set Cover for Orthants. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
12.
Kreutzer, Stephan, et al.. (2018). First-Order Interpretations of Bounded Expansion Classes. arXiv (Cornell University). 18 indexed citations
13.
Heuvel, Jan van den, et al.. (2017). Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. 1–11. 1 indexed citations
14.
Fomin, Fedor V., et al.. (2016). Subexponential parameterized algorithm for interval completion. arXiv (Cornell University). 1116–1131. 5 indexed citations
15.
Pilipczuk, Michał, et al.. (2016). Linear kernels for edge deletion problems to immersion-closed graph\n classes. arXiv (Cornell University). 4 indexed citations
16.
Bodlaender, Hans L., Pål Grønås Drange, Markus Sortland Dregi, et al.. (2016). A $c^k n$ 5-Approximation Algorithm for Treewidth. SIAM Journal on Computing. 45(2). 317–378. 70 indexed citations
17.
Fomin, Fedor V., et al.. (2015). How to hunt an invisible rabbit on a graph. European Journal of Combinatorics. 52. 12–26. 4 indexed citations
18.
Lokshtanov, Daniel, Marcin Pilipczuk, Michał Pilipczuk, & Saket Saurabh. (2014). Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. Warwick Research Archive Portal (University of Warwick). 842. 186–195. 8 indexed citations
19.
Fomin, Fedor V. & Michał Pilipczuk. (2013). Jungles, bundles, and fixed-parameter tractability. Symposium on Discrete Algorithms. 396–413. 1 indexed citations
20.
Cygan, Marek, Marcin Pilipczuk, Michał Pilipczuk, & Jakub Onufry Wojtaszczyk. (2013). Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n. Algorithmica. 70(2). 195–207. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Marcin Pilipczuk Breakdown of academic impact, for papers by Dimitrios M. Thilikos Breakdown of academic impact, for papers by Daniel Lokshtanov Breakdown of academic impact, for papers by Jörg Flum Breakdown of academic impact, for papers by Dieter Kratsch Breakdown of academic impact, for papers by Henning Fernau Breakdown of academic impact, for papers by Petr A. Golovach Breakdown of academic impact, for papers by Frances Rosamond Breakdown of academic impact, for papers by Ross M. McConnell Breakdown of academic impact, for papers by Fǎnicǎ Gavril
Rankless by CCL
2026