| 2026 | SODA | Shortcuts and Transitive-Closure Spanners Approximation. | Parinya Chalermsook, Yonggang Jiang, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2026 | SODA | Minimum | Yonggang Jiang, Danupon Nanongkai, Pachara Sawettamalya |
| 2024 | ESA | Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. | Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su |
| 2024 | ICALP | Cross-Paradigm Graph Algorithms (Invited Talk). | Danupon Nanongkai |
| 2023 | SODA | Near-Linear Time Approximations for Cut Problems via Fair Cuts. | Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak |
| 2023 | SODA | Fully Dynamic Exact Edge Connectivity in Sublinear Time. | Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen |
| 2023 | STOC | Fast Algorithms via Dynamic-Oracle Matroids. | Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu |
| 2022 | FOCS | Cut Query Algorithms with Star Contraction. | Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2022 | FOCS | Negative-Weight Single-Source Shortest Paths in Near-linear Time. | Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen |
| 2022 | FOCS | Nearly Optimal Communication and Query Complexity of Bipartite Matching. | Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2022 | ICALP | Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. | Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun |
| 2022 | ICALP | Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. | Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai |
| 2022 | IPCO | Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. | Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2021 | FOCS | Minimum Cuts in Directed Graphs via Partial Sparsification. | Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud |
| 2021 | SODA | Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu |
| 2021 | STOC | Breaking the quadratic barrier for matroid intersection. | Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2021 | STOC | Distributed weighted min-cut in nearly-optimal time. | Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2021 | STOC | Vertex connectivity in poly-logarithmic max-flows. | Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2021 | SPAA | Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs. | Andrs Lpez-Martnez, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2020 | FOCS | Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. | Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang |
| 2020 | FOCS | A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. | Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak |
| 2020 | SODA | Coarse-Grained Complexity for Dynamic Algorithms. | Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak |
| 2020 | SODA | Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. | Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2020 | STOC | Weighted min-cut: sequential, cut-query, and streaming algorithms. | Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2019 | FOCS | A New Deterministic Algorithm for Dynamic Set Cover. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai |
| 2019 | FOCS | Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. | Jan van den Brand, Danupon Nanongkai |
| 2019 | FOCS | Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. | Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak |
| 2019 | OPODIS | Equivalence Classes and Conditional Hardness in Massively Parallel Computations. | Danupon Nanongkai, Michele Scquizzato |
| 2019 | STOC | Distributed exact weighted all-pairs shortest paths in near-linear time. | Aaron Bernstein, Danupon Nanongkai |
| 2019 | STOC | Distributed edge connectivity in sublinear time. | Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak |
| 2019 | STOC | Breaking quadratic time for small vertex connectivity and an approximation scheme. | Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2018 | FOCS | A Faster Distributed Single-Source Shortest Paths Algorithm. | Sebastian Forster, Danupon Nanongkai |
| 2018 | SODA | Dynamic Algorithms for Graph Coloring. | Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai |
| 2017 | FOCS | From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. | Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan |
| 2017 | FOCS | Distributed Exact Weighted All-Pairs Shortest Paths in (n | Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak |
| 2017 | FOCS | Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. | Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen |
| 2017 | SODA | Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai |
| 2017 | STOC | Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n | Danupon Nanongkai, Thatchaphol Saranurak |
| 2016 | STOC | New deterministic approximation algorithms for fully dynamic matching. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai |
| 2016 | STOC | A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2015 | ICALP | Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2015 | SODA | Distributed Computation of Large-scale Graph Problems. | Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson |
| 2015 | STOC | Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis |
| 2015 | STOC | Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak |
| 2015 | SIGMETRICS | Social Network Monetization via Sponsored Viral Marketing. | Parinya Chalermsook, Atish Das Sarma, Ashwin Lall, Danupon Nanongkai |
| 2014 | FOCS | Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2014 | FOCS | Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2014 | LATIN | Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2014 | PODC | Can quantum communication speed up distributed computation? | Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan |
| 2014 | PODC | Brief announcement: almost-tight approximation distributed algorithm for minimum cut. | Danupon Nanongkai |
| 2014 | SODA | A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2014 | STOC | Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2014 | STOC | Distributed approximation algorithms for weighted shortest paths. | Danupon Nanongkai |
| 2013 | FOCS | Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2013 | FOCS | Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2013 | ICALP | Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2013 | SODA | Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2012 | ESA | Polynomial-Time Algorithms for Energy Games with Special Weight Structures. | Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2012 | PODC | Brief announcement: maintaining large dense subgraphs on dynamic networks. | Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan |
| 2012 | SIGMOD | Interactive regret minimization. | Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, Kazuhisa Makino |
| 2011 | ICDE | Representative skylines using threshold-based preference distributions. | Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Richard J. Lipton, Jun (Jim) Xu |
| 2011 | PODC | A tight unconditional lower bound on distributed randomwalk computation. | Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan |
| 2011 | STOC | Distributed verification and hardness of distributed approximation. | Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer |
| 2010 | ICALP | Faster Algorithms for Semi-matching Problems (Extended Abstract). | Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai |
| 2010 | PODC | Efficient distributed random walks with applications. | Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali |
| 2009 | PODC | Fast distributed random walks. | Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan |
| 2009 | TAMC | Best-Order Streaming Model. | Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai |
| 2004 | SODA | A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. | Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai |