World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
7243
World Ranking
13377
National Ranking
36

Marek Cygan 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 Marek Cygan 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: 202 publications — 47th percentile

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

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

Marek Cygan 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 Marek Cygan 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: 31 D-Index — 6th percentile

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

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

Overview

Marek Cygan is affiliated with the University of Warsaw in Poland. Their research primarily spans the field of Computer Science, with a focus on several subfields including Artificial Intelligence, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Computer Networks and Communications, and Control and Systems Engineering.

The scientist has contributed extensively to topics such as Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Cryptography and Data Security, Machine Learning and Algorithms, Image and Object Detection Techniques, Machine Learning and Data Classification, and Advanced Neural Network Applications.

Notable recent publications include:

  • Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, 2022, ACM Transactions on Algorithms
  • From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More, 2020, SIAM Journal on Computing
  • Polite Teacher: Semi-Supervised Instance Segmentation With Mutual Learning and Pseudo-Label Thresholding, 2024, IEEE Access
  • n-CPS: Generalising Cross Pseudo Supervision to n Networks for Semi-Supervised Semantic Segmentation, 2021, arXiv (Cornell University)
  • Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems, 2020, ACM Transactions on Algorithms

Frequent publication venues for the scientist include:

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

Marek Cygan has collaborated regularly with several co-authors, among whom are Michał Nauman, Guy Kortsarz, Piotr Tempczyk, Michał Pilipczuk, and Dominik Filipiak, reflecting a network of partnerships primarily in algorithmic and theoretical computer science research.

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

  • Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

    Hans L. Bodlaender;Marek Cygan;Stefan Kratsch;Jesper Nederlof

  • On Problems as Hard as CNF-SAT

    Marek Cygan;Holger Dell;Daniel Lokshtanov;Dániel Marx

  • On multiway cut parameterized above lower bounds

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

  • On Problems as Hard as CNF-SAT

    Marek Cygan;Holger Dell;Daniel Lokshtanov;D'niel Marx

  • Exponential-time approximation of weighted set cover

    Marek Cygan;Łukasz Kowalik;Mateusz Wykurz

  • Designing FPT Algorithms for Cut Problems Using Randomized Contractions

    Rajesh Chitnis;Marek Cygan;MohammadTaghi Hajiaghayi;Marcin Pilipczuk

  • Fast Hamiltonicity Checking Via Bases of Perfect Matchings

    Marek Cygan;Stefan Kratsch;Jesper Nederlof

  • Minimum Bisection Is Fixed-Parameter Tractable

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

  • Exact and approximate bandwidth

    Marek Cygan;Marcin Pilipczuk

  • From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

    Parinya Chalermsook;Marek Cygan;Guy Kortsarz;Bundit Laekhanukit

  • Subset Feedback Vertex Set Is Fixed-Parameter Tractable

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

  • Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search

    Marek Cygan

  • Solving connectivity problems parameterized by treewidth in single exponential time

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

  • Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

    Unknown

  • LP Rounding for k-Centers with Non-uniform Hard Capacities

    Marek Cygan;MohammadTaghi Hajiaghayi;Samir Khuller

  • Known Algorithms for Edge Clique Cover are Probably Optimal

    Marek Cygan;Marcin Pilipczuk;Michał Pilipczuk

  • A Fast Branching Algorithm for Cluster Vertex Deletion

    Anudhyan Boral;Marek Cygan;Tomasz Kociumaka;Marcin Pilipczuk

  • Kernelization hardness of connectivity problems in d-degenerate graphs

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

  • Applying deep learning to right whale photo identification.

    Robert Bogucki;Marek Cygan;Christin Brangwynne Khan;Maciej Klimek

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

    Marek Cygan;Daniel Marx;Marcin Pilipczuk;Michal Pilipczuk

  • On Problems Equivalent to (min,+)-Convolution

    Marek Cygan;Marcin Mucha;Karol Węgrzycki;Michał Włodarczyk

Frequent Co-Authors

Michał Pilipczuk
Michał Pilipczuk University of Warsaw
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
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Fabrizio Grandoni
Fabrizio Grandoni Dalle Molle Institute for Artificial Intelligence Research
Guy Kortsarz
Guy Kortsarz Rutgers, The State University of New Jersey
MohammadTaghi Hajiaghayi
MohammadTaghi Hajiaghayi University of Maryland, College Park
Stefan Kratsch
Stefan Kratsch Humboldt-Universität zu Berlin
Harold N. Gabow
Harold N. Gabow University of Colorado Boulder

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 Computer Science in the USA opens up a range of related educational and career options you can pursue online. For those interested in working with big data, there are data science programs that offer affordable paths to lucrative careers. These programs focus on hands-on skills and in-demand tools in today’s technology-driven economy.

If your interests overlap with engineering, consider checking electrical engineering degree online admissions. Top universities now provide comprehensive online programs that allow you to advance your technical expertise without needing to relocate or pause your career.

Looking for fast-tracked options? There are quick certifications that pay well, allowing you to upgrade your skills and boost earning potential in a short time.

For those seeking advanced degrees, explore the shortest masters degree programs online. These programs are designed for flexibility and speed, letting you climb higher in your field without a lengthy commitment.

Best Scientists Citing Marek Cygan

Trending Scientists

Recently Published Articles