Danupon Nanongkai

2.6k total citations
54 papers, 884 citations indexed

About

Danupon Nanongkai is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Danupon Nanongkai has authored 54 papers receiving a total of 884 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 30 papers in Computer Networks and Communications and 27 papers in Artificial Intelligence. Recurrent topics in Danupon Nanongkai's work include Complexity and Algorithms in Graphs (40 papers), Optimization and Search Problems (21 papers) and Advanced Graph Theory Research (13 papers). Danupon Nanongkai is often cited by papers focused on Complexity and Algorithms in Graphs (40 papers), Optimization and Search Problems (21 papers) and Advanced Graph Theory Research (13 papers). Danupon Nanongkai collaborates with scholars based in United States, Austria and Sweden. Danupon Nanongkai's co-authors include Atish Das Sarma, Gopal Pandurangan, Monika Henzinger, Ashwin Lall, Sayan Bhattacharya, Thatchaphol Saranurak, Richard J. Lipton, Sebastian Krinninger, Jun Xu and Amos Korman and has published in prestigious journals such as Communications of the ACM, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Danupon Nanongkai

51 papers receiving 850 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Danupon Nanongkai United States 18 546 505 335 191 95 54 884
Torben Hagerup Germany 19 502 0.9× 627 1.2× 636 1.9× 101 0.5× 134 1.4× 65 1.3k
Krzysztof Onak United States 16 275 0.5× 401 0.8× 364 1.1× 74 0.4× 97 1.0× 36 652
Liam Roditty Israel 19 471 0.9× 533 1.1× 199 0.6× 127 0.7× 132 1.4× 68 942
Jelani Nelson United States 14 266 0.5× 236 0.5× 540 1.6× 113 0.6× 137 1.4× 38 854
Daniel M. Kane United States 15 145 0.3× 271 0.5× 460 1.4× 85 0.4× 101 1.1× 89 841
Peter Jönsson Sweden 21 730 1.3× 499 1.0× 742 2.2× 278 1.5× 42 0.4× 120 1.3k
Cyril Gavoille France 19 616 1.1× 689 1.4× 137 0.4× 81 0.4× 40 0.4× 69 1.1k
Matthias Rühl United States 13 502 0.9× 94 0.2× 179 0.5× 118 0.6× 164 1.7× 26 876
Satish Rao United States 14 466 0.9× 607 1.2× 122 0.4× 80 0.4× 65 0.7× 30 956
Jörg Flum Germany 12 545 1.0× 1.5k 3.0× 739 2.2× 153 0.8× 49 0.5× 46 1.9k

Countries citing papers authored by Danupon Nanongkai

Since Specialization
Citations

This map shows the geographic impact of Danupon Nanongkai'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 Danupon Nanongkai with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Danupon Nanongkai more than expected).

Fields of papers citing papers by Danupon Nanongkai

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Danupon Nanongkai. 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 Danupon Nanongkai. The network helps show where Danupon Nanongkai may publish in the future.

Co-authorship network of co-authors of Danupon Nanongkai

This figure shows the co-authorship network connecting the top 25 collaborators of Danupon Nanongkai. A scholar is included among the top collaborators of Danupon Nanongkai 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 Danupon Nanongkai. Danupon Nanongkai 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.
Nanongkai, Danupon, et al.. (2023). Fast Algorithms via Dynamic-Oracle Matroids. 1229–1242. 5 indexed citations
2.
Bernstein, Aaron, Jan van den Brand, Maximilian Probst Gutenberg, et al.. (2022). Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
3.
Nanongkai, Danupon, et al.. (2022). Equivalence classes and conditional hardness in massively parallel computations. Distributed Computing. 35(2). 165–183. 2 indexed citations
4.
Bernstein, Aaron & Danupon Nanongkai. (2021). Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time. SIAM Journal on Computing. 52(2). STOC19–112.
5.
Bhattacharya, Sayan, Monika Henzinger, & Danupon Nanongkai. (2019). A New Deterministic Algorithm for Dynamic Set Cover. Warwick Research Archive Portal (University of Warwick). 406–423. 8 indexed citations
6.
Brand, Jan van den & Danupon Nanongkai. (2019). Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. 436–455. 16 indexed citations
7.
Huang, Chien‐Chung, Danupon Nanongkai, & Thatchaphol Saranurak. (2017). Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n^{5/4}) Rounds. 168–179. 10 indexed citations
8.
Elkin, Michael, Hartmut Klauck, Danupon Nanongkai, & Gopal Pandurangan. (2014). Can quantum communication speed up distributed computation?. 166–175. 12 indexed citations
9.
Fakcharoenphol, Jittat, Bundit Laekhanukit, & Danupon Nanongkai. (2014). Faster Algorithms for Semi-Matching Problems. ACM Transactions on Algorithms. 10(3). 1–23. 12 indexed citations
10.
Chalermsook, Parinya, Shiva Kintali, Richard J. Lipton, & Danupon Nanongkai. (2013). . 19(1). 1–19.
11.
Henzinger, Monika, Sebastian Krinninger, & Danupon Nanongkai. (2013). A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. DR-NTU (Nanyang Technological University). 1053–1072. 6 indexed citations
12.
Henzinger, Monika, Sebastian Krinninger, & Danupon Nanongkai. (2013). Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. 28. 538–547. 13 indexed citations
13.
Elkin, Michael, Hartmut Klauck, Danupon Nanongkai, & Gopal Pandurangan. (2012). Quantum Lower Bounds for Distributed Network Computing. arXiv (Cornell University). 1 indexed citations
14.
Elkin, Michael, Hartmut Klauck, Danupon Nanongkai, & Gopal Pandurangan. (2012). Quantum Distributed Network Computing: Lower Bounds and Techniques. arXiv (Cornell University). 3 indexed citations
15.
Sarma, Atish Das, et al.. (2011). Representative skylines using threshold-based preference distributions. 387–398. 34 indexed citations
16.
Sarma, Atish Das, Richard J. Lipton, & Danupon Nanongkai. (2010). Best-order streaming model. Theoretical Computer Science. 412(23). 2544–2555. 2 indexed citations
17.
Fakcharoenphol, Jittat, Bundit Laekhanukit, & Danupon Nanongkai. (2010). Faster Algorithms for Semi-Matching Problems. arXiv (Cornell University). 176–187. 10 indexed citations
18.
Sarma, Atish Das, Danupon Nanongkai, Gopal Pandurangan, & Prasad Tetali. (2009). Near-Optimal Sublinear Time Bounds for Distributed Random Walks. arXiv (Cornell University). 1 indexed citations
19.
Sarma, Atish Das, Ashwin Lall, Danupon Nanongkai, & Jun Xu. (2009). Randomized multi-pass streaming skyline algorithms. Proceedings of the VLDB Endowment. 2(1). 85–96. 25 indexed citations
20.
Chalermsook, Parinya, Jittat Fakcharoenphol, & Danupon Nanongkai. (2004). A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. Symposium on Discrete Algorithms. 828–829. 18 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 Torben Hagerup Breakdown of academic impact, for papers by Krzysztof Onak Breakdown of academic impact, for papers by Liam Roditty Breakdown of academic impact, for papers by Jelani Nelson Breakdown of academic impact, for papers by Daniel M. Kane Breakdown of academic impact, for papers by Peter Jönsson Breakdown of academic impact, for papers by Cyril Gavoille Breakdown of academic impact, for papers by Matthias Rühl Breakdown of academic impact, for papers by Satish Rao Breakdown of academic impact, for papers by Jörg Flum
Rankless by CCL
2026