World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
40
Citations
4084
World Ranking
9451
National Ranking
466

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