World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
40
Citations
4084
World Ranking
9450
National Ranking
467

Danupon Nanongkai 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 Danupon Nanongkai 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: 109 publications — 11th percentile

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

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

Danupon Nanongkai 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 Danupon Nanongkai 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: 40 D-Index — 37th percentile

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

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

Overview

Danupon Nanongkai is affiliated with the Max Planck Institute for Informatics in Germany. Their research contributions primarily lie within the field of Computer Science, with a notable focus on Computational Theory and Mathematics.

The scientist's body of work spans several subfields including:

  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Computer Vision and Pattern Recognition

The main research topics explored by Danupon Nanongkai cover a range of areas, specifically:

  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Optimization and Search Problems
  • Interconnection Networks and Systems
  • Cryptography and Data Security
  • Computational Geometry and Mesh Generation
  • Machine Learning and Algorithms

Danupon Nanongkai has published extensively in reputed venues, with a frequent presence in:

  • arXiv (Cornell University)
  • SIAM Journal on Computing
  • 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Journal of the ACM

Recent papers by the scientist include:

  • "Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary" (2022), published in arXiv (Cornell University)
  • "Negative-Weight Single-Source Shortest Paths in Near-linear Time" (2022), published in the 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • "From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More" (2020), published in SIAM Journal on Computing
  • "Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs" (2020), published in arXiv (Cornell University)
  • "Equivalence classes and conditional hardness in massively parallel computations" (2022), published in Distributed Computing

The scientist has collaborated frequently with several coauthors, including:

  • Thatchaphol Saranurak
  • Sagnik Mukhopadhyay
  • Christian Wulff-Nilsen
  • Debmalya Panigrahi
  • Jan van den Brand

Best Publications

  • Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture

    Monika Henzinger;Sebastian Krinninger;Danupon Nanongkai;Thatchaphol Saranurak

  • Distributed Verification and Hardness of Distributed Approximation

    Atish Das Sarma;Stephan Holzer;Liah Kor;Amos Korman

  • Distributed approximation algorithms for weighted shortest paths

    Danupon Nanongkai

  • Regret-minimizing representative databases

    Danupon Nanongkai;Atish Das Sarma;Ashwin Lall;Richard J. Lipton

  • Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams

    Sayan Bhattacharya;Monika Henzinger;Danupon Nanongkai;Charalampos Tsourakakis

  • Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time

    Danupon Nanongkai;Thatchaphol Saranurak;Christian Wulff-Nilsen

  • Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time

    Danupon Nanongkai;Thatchaphol Saranurak

  • Distributed computation of large-scale graph problems

    Hartmut Klauck;Danupon Nanongkai;Gopal Pandurangan;Peter Robinson

  • New deterministic approximation algorithms for fully dynamic matching

    Sayan Bhattacharya;Monika Henzinger;Danupon Nanongkai

  • Distributed verification and hardness of distributed approximation

    Atish Das Sarma;Stephan Holzer;Liah Kor;Amos Korman

  • A deterministic almost-tight distributed algorithm for approximating single-source shortest paths

    Monika Henzinger;Sebastian Krinninger;Danupon Nanongkai

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

    Parinya Chalermsook;Marek Cygan;Guy Kortsarz;Bundit Laekhanukit

  • A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond

    Julia Chuzhoy;Yu Gao;Jason Li;Danupon Nanongkai

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization

    Monika Henzinger;Sebastian Krinninger;Danupon Nanongkai

  • Distributed Random Walks

    Atish Das Sarma;Danupon Nanongkai;Gopal Pandurangan;Prasad Tetali

  • Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time

    Monika Henzinger;Sebastian Krinninger;Danupon Nanongkai

  • Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

    Jan van den Brand;Yin-Tat Lee;Danupon Nanongkai;Richard Peng

  • Fully dynamic approximate maximum matching and minimum vertex cover in O(log3n) worst case update time

    Sayan Bhattacharya;Monika Henzinger;Danupon Nanongkai

  • Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs

    Monika Henzinger;Sebastian Krinninger;Danupon Nanongkai

  • Graph products revisited: tight approximation hardness of induced matching, poset dimension and more

    Parinya Chalermsook;Bundit Laekhanukit;Danupon Nanongkai

  • Dynamic algorithms for graph coloring

    Sayan Bhattacharya;Deeparnab Chakrabarty;Monika Henzinger;Danupon Nanongkai

  • A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.

    Monika Henzinger;Sebastian Krinninger;Danupon Nanongkai

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization.

    Monika Henzinger;Sebastian Krinninger;Danupon Nanongkai

Frequent Co-Authors

Monika Henzinger
Monika Henzinger Institute of Science and Technology Austria
Gopal Pandurangan
Gopal Pandurangan University of Houston
Prasad Tetali
Prasad Tetali Carnegie Mellon University
Peter Robinson
Peter Robinson University of Cambridge
Richard Peng
Richard Peng Carnegie Mellon University
Michael Elkin
Michael Elkin Ben-Gurion University of the Negev
David Peleg
David Peleg Weizmann Institute of Science
Guy Kortsarz
Guy Kortsarz Rutgers, The State University of New Jersey
Aaron Sidford
Aaron Sidford Stanford 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 computer science opens up diverse career options, but it’s also valuable to consider related fields and flexible study formats. For example, if you're interested in technology with an environmental impact, an environmental science degree can pave the way for roles in sustainability analysis, conservation, and research.

For those looking to fast-track their education, programs like an accelerated computer science degree offer the chance to graduate sooner and enter the tech workforce quickly. These programs are ideal for motivated learners seeking flexibility and efficiency.

Interdisciplinary opportunities also abound. Fields such as engineering often overlap with computer science. If you're interested in technology-driven solutions for environmental issues, online environmental engineering degree pathways can prepare you for innovative problem-solving roles. Likewise, pursuing online mechanical engineering degrees broadens your scope to careers in manufacturing, robotics, and product development.

These online options provide flexible, affordable access to in-demand fields, supporting a range of career goals within and beyond computer science.

Best Scientists Citing Danupon Nanongkai

Trending Scientists

Recently Published Articles