World's Best Scientists 2026 revealed!
Michał Pilipczuk

Michał Pilipczuk

D-Index & Metrics

Computer Science

D-Index
35
Citations
7340
World Ranking
11508
National Ranking
28

Michał Pilipczuk publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Michał Pilipczuk sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 364 publications — 83rd percentile

83% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Michał Pilipczuk D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Michał Pilipczuk sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 35 D-Index — 20th percentile

20% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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 P6-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

  • Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

    Marek Cygan;Jesper Nederlof;Marcin Pilipczuk;Michal Pilipczuk

  • Lower bounds based on the Exponential Time Hypothesis

    Daniel Lokshtanov;Dániel Marx;Saket Saurabh

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

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

  • On multiway cut parameterized above lower bounds

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

  • Designing FPT Algorithms for Cut Problems Using Randomized Contractions

    Rajesh Chitnis;Marek Cygan;MohammadTaghi Hajiaghayi;Marcin Pilipczuk

  • Minimum Bisection Is Fixed-Parameter Tractable

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

  • Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams

    Dániel Marx;Michał Pilipczuk

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

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

  • How to hunt an invisible rabbit on a graph

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

  • Subset Feedback Vertex Set Is Fixed-Parameter Tractable

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

  • Solving connectivity problems parameterized by treewidth in single exponential time

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

  • Known Algorithms for Edge Clique Cover are Probably Optimal

    Marek Cygan;Marcin Pilipczuk;Michał Pilipczuk

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

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

  • Kernelization hardness of connectivity problems in d-degenerate graphs

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

  • First-Order Interpretations of Bounded Expansion Classes

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

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

    Marek Cygan;Daniel Marx;Marcin Pilipczuk;Michal Pilipczuk

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

    Dániel Marx;Michal Pilipczuk

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

    Michal Pilipczuk

  • Fixed-parameter Tractability of Multicut in Directed Acyclic Graphs

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

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

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

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

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

  • Clique Cover and Graph Separation: New Incompressibility Results

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

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

    Christophe Paul;Michal Pilipczuk

  • Tight bounds for parameterized complexity of Cluster Editing

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

Frequent Co-Authors

Marek Cygan
Marek Cygan University of Warsaw
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Dániel Marx
Dániel Marx Saarland University
Stefan Kratsch
Stefan Kratsch Humboldt-Universität zu Berlin
Dimitrios M. Thilikos
Dimitrios M. Thilikos National and Kapodistrian University of Athens
Maria Chudnovsky
Maria Chudnovsky Princeton University
Christophe Paul
Christophe Paul University of Montpellier
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

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.

Best Scientists Citing Michał Pilipczuk

Trending Scientists

Recently Published Articles