default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanupon Nanongkai
Person information
- affiliation: Max Planck Institut für Informatik Saarbrücken, Germany
- affiliation (PhD 2011): Georgia Institute of Technology, Atlanta, GA, USA
SPARQL queries 
🛈 Please note that only 60% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c70]Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. ESA 2024: 13:1-13:15- [c69]Danupon Nanongkai:
Cross-Paradigm Graph Algorithms (Invited Talk). ICALP 2024: 3:1-3:1 - 2023
- [j19]Sayan Bhattacharya, Monika Henzinger
, Danupon Nanongkai, Xiaowei Wu:
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover. SIAM J. Comput. 52(5): 1132-1192 (2023) - [c68]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA 2023: 70-86 - [c67]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Near-Linear Time Approximations for Cut Problems via Fair Cuts. SODA 2023: 240-275 - [c66]Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu:
Fast Algorithms via Dynamic-Oracle Matroids. STOC 2023: 1229-1242 - [i68]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR abs/2302.05951 (2023) - [i67]Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu:
Fast Algorithms via Dynamic-Oracle Matroids. CoRR abs/2302.09796 (2023) - [i66]Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights. CoRR abs/2303.00811 (2023) - 2022
- [j18]Danupon Nanongkai, Michele Scquizzato:
Equivalence classes and conditional hardness in massively parallel computations. Distributed Comput. 35(2): 165-183 (2022) - [c65]Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut Query Algorithms with Star Contraction. FOCS 2022: 507-518 - [c64]Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Near-linear Time. FOCS 2022: 600-611 - [c63]Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Nearly Optimal Communication and Query Complexity of Bipartite Matching. FOCS 2022: 1174-1185 - [c62]Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. ICALP 2022: 20:1-20:20 - [c61]Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai:
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. ICALP 2022: 37:1-37:20 - [c60]Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai:
Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. IPCO 2022: 70-83 - [i65]Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut query algorithms with star contraction. CoRR abs/2201.05674 (2022) - [i64]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time. CoRR abs/2203.00751 (2022) - [i63]Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Almost-linear Time. CoRR abs/2203.03456 (2022) - [i62]Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai:
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. CoRR abs/2205.14978 (2022) - [i61]Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Nearly Optimal Communication and Query Complexity of Bipartite Matching. CoRR abs/2208.02526 (2022) - 2021
- [j17]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. SIAM J. Comput. 50(3) (2021) - [c59]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud:
Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS 2021: 1147-1158 - [c58]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. SODA 2021: 2537-2549 - [c57]Andrés López-Martínez, Sagnik Mukhopadhyay, Danupon Nanongkai:
Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs. SPAA 2021: 351-361 - [c56]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex connectivity in poly-logarithmic max-flows. STOC 2021: 317-329 - [c55]Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai:
Breaking the quadratic barrier for matroid intersection. STOC 2021: 421-432 - [c54]Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Distributed weighted min-cut in nearly-optimal time. STOC 2021: 1144-1153 - [i60]Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai:
Breaking the Quadratic Barrier for Matroid Intersection. CoRR abs/2102.05548 (2021) - [i59]Andrés López-Martínez, Sagnik Mukhopadhyay, Danupon Nanongkai:
Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs. CoRR abs/2102.06565 (2021) - [i58]Sagnik Mukhopadhyay, Danupon Nanongkai:
A Note on Isolating Cut Lemma for Submodular Function Minimization. CoRR abs/2103.15724 (2021) - [i57]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex Connectivity in Poly-logarithmic Max-flows. CoRR abs/2104.00104 (2021) - [i56]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR abs/2104.07898 (2021) - [i55]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via Partial Sparsification. CoRR abs/2111.08959 (2021) - 2020
- [j16]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. SIAM J. Comput. 49(4): 772-810 (2020) - [j15]Thomas Vidick, Danupon Nanongkai, Dimitris Achlioptas:
Special Section on the Fiftieth Annual ACM Symposium on Theory of Computing (STOC 2018). SIAM J. Comput. 49(5) (2020) - [c53]Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang:
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. FOCS 2020: 919-930 - [c52]Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak:
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. FOCS 2020: 1158-1167 - [c51]Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak:
Coarse-Grained Complexity for Dynamic Algorithms. SODA 2020: 476-494 - [c50]Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. SODA 2020: 2046-2065 - [c49]Sagnik Mukhopadhyay, Danupon Nanongkai:
Weighted min-cut: sequential, cut-query, and streaming algorithms. STOC 2020: 496-509 - [i54]Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak:
Coarse-Grained Complexity for Dynamic Algorithms. CoRR abs/2001.00336 (2020) - [i53]Danupon Nanongkai, Michele Scquizzato:
Equivalence Classes and Conditional Hardness in Massively Parallel Computations. CoRR abs/2001.02191 (2020) - [i52]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
An Improved Algorithm for Dynamic Set Cover. CoRR abs/2002.11171 (2020) - [i51]Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. CoRR abs/2004.08432 (2020) - [i50]Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Distributed Weighted Min-Cut in Nearly-Optimal Time. CoRR abs/2004.09129 (2020) - [i49]Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang:
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. CoRR abs/2009.01802 (2020) - [i48]Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai:
Faster connectivity in low-rank hypergraphs via expander decomposition. CoRR abs/2011.08097 (2020)
2010 – 2019
- 2019
- [j14]Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-Time Approximation. Algorithmica 81(10): 3993-4009 (2019) - [c48]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. FOCS 2019: 406-423 - [c47]Jan van den Brand, Danupon Nanongkai:
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. FOCS 2019: 436-455 - [c46]Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. FOCS 2019: 456-480 - [c45]Danupon Nanongkai, Michele Scquizzato:
Equivalence Classes and Conditional Hardness in Massively Parallel Computations. OPODIS 2019: 33:1-33:16 - [c44]Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Breaking quadratic time for small vertex connectivity and an approximation scheme. STOC 2019: 241-252 - [c43]Aaron Bernstein, Danupon Nanongkai:
Distributed exact weighted all-pairs shortest paths in near-linear time. STOC 2019: 334-342 - [c42]Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed edge connectivity in sublinear time. STOC 2019: 343-354 - [i47]Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Edge Connectivity in Sublinear Time. CoRR abs/1904.04341 (2019) - [i46]Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme. CoRR abs/1904.04453 (2019) - [i45]Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. CoRR abs/1905.05067 (2019) - [i44]Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries. CoRR abs/1905.05329 (2019) - [i43]Jan van den Brand, Danupon Nanongkai:
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. CoRR abs/1909.10850 (2019) - [i42]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. CoRR abs/1909.11600 (2019) - [i41]Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. CoRR abs/1910.07950 (2019) - [i40]Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak:
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR abs/1910.08025 (2019) - [i39]Sebastian Forster, Danupon Nanongkai, Thatchaphol Saranurak, Liu Yang, Sorrachai Yingchareonthawornchai:
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. CoRR abs/1910.14344 (2019) - [i38]Sagnik Mukhopadhyay, Danupon Nanongkai:
Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms. CoRR abs/1911.01651 (2019) - 2018
- [j13]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. J. ACM 65(6): 36:1-36:40 (2018) - [c41]Sebastian Forster, Danupon Nanongkai:
A Faster Distributed Single-Source Shortest Paths Algorithm. FOCS 2018: 686-697 - [c40]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai:
Dynamic Algorithms for Graph Coloring. SODA 2018: 1-20 - [i37]Aaron Bernstein, Danupon Nanongkai:
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time. CoRR abs/1811.03337 (2018) - 2017
- [j12]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. ACM Trans. Algorithms 13(4): 51:1-51:24 (2017) - [c39]Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds. FOCS 2017: 168-179 - [c38]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. FOCS 2017: 743-754 - [c37]Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen:
Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. FOCS 2017: 950-961 - [c36]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time. SODA 2017: 470-489 - [c35]Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time. STOC 2017: 1122-1129 - [i36]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3n) Worst Case Update Time. CoRR abs/1704.02844 (2017) - [i35]Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-time Approximation. CoRR abs/1708.03515 (2017) - [i34]Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds. CoRR abs/1708.03903 (2017) - [i33]Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen:
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time. CoRR abs/1708.03962 (2017) - [i32]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. CoRR abs/1708.04218 (2017) - [i31]Sebastian Krinninger, Danupon Nanongkai:
A Faster Distributed Single-Source Shortest Paths Algorithm. CoRR abs/1711.01364 (2017) - [i30]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai:
Dynamic Algorithms for Graph Coloring. CoRR abs/1711.04355 (2017) - 2016
- [j11]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. SIAM J. Comput. 45(3): 947-1006 (2016) - [c34]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New deterministic approximation algorithms for fully dynamic matching. STOC 2016: 398-411 - [c33]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. STOC 2016: 489-498 - [r1]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization. Encyclopedia of Algorithms 2016: 600-602 - [i29]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New Deterministic Approximation Algorithms for Fully Dynamic Matching. CoRR abs/1604.05765 (2016) - [i28]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. CoRR abs/1604.08234 (2016) - [i27]Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Spanning Forest with Worst-Case Update Time: Adaptive, Las Vegas, and $O(n^{1/2-ε})$-Time. CoRR abs/1611.03745 (2016) - [i26]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. CoRR abs/1612.03856 (2016) - 2015
- [c32]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. ICALP (1) 2015: 725-736 - [c31]Parinya Chalermsook, Atish Das Sarma, Ashwin Lall, Danupon Nanongkai:
Social Network Monetization via Sponsored Viral Marketing. SIGMETRICS 2015: 259-270 - [c30]Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
Distributed Computation of Large-scale Graph Problems. SODA 2015: 391-410 - [c29]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak:
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. STOC 2015: 21-30 - [c28]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis:
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. STOC 2015: 173-182 - [i25]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis:
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. CoRR abs/1504.02268 (2015) - [i24]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths. CoRR abs/1504.07056 (2015) - [i23]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs. CoRR abs/1504.07959 (2015) - [i22]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak:
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. CoRR abs/1511.06773 (2015) - [i21]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. CoRR abs/1512.08147 (2015) - [i20]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. CoRR abs/1512.08148 (2015) - 2014
- [j10]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. Algorithmica 70(3): 457-492 (2014) - [j9]Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. ACM Trans. Algorithms 10(3): 14:1-14:23 (2014) - [c27]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. FOCS 2014: 146-155 - [c26]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. FOCS 2014: 444-453 - [c25]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. LATIN 2014: 409-420 - [c24]Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan:
Can quantum communication speed up distributed computation? PODC 2014: 166-175 - [c23]Danupon Nanongkai:
Brief announcement: almost-tight approximation distributed algorithm for minimum cut. PODC 2014: 382-384 - [c22]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. SODA 2014: 1053-1072 - [c21]Danupon Nanongkai:
Distributed approximation algorithms for weighted shortest paths. STOC 2014: 565-573 - [c20]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. STOC 2014: 674-683 - [c19]Danupon Nanongkai, Hsin-Hao Su:
Almost-Tight Distributed Minimum Cut Algorithms. DISC 2014: 439-453 - [c18]Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
Distributed Symmetry Breaking in Hypergraphs. DISC 2014: 469-483 - [i19]Danupon Nanongkai:
Distributed Approximation Algorithms for Weighted Shortest Paths. CoRR abs/1403.5171 (2014) - [i18]Danupon Nanongkai:
Brief Announcement: Almost-Tight Approximation Distributed Algorithm for Minimum Cut. CoRR abs/1403.6188 (2014) - [i17]Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
Distributed Symmetry Breaking in Hypergraphs. CoRR abs/1405.1649 (2014) - [i16]Danupon Nanongkai, Hsin-Hao Su:
Almost-Tight Distributed Minimum Cut Algorithms. CoRR abs/1408.0557 (2014) - [i15]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. CoRR abs/1408.0828 (2014) - 2013
- [j8]Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai:
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs. Chic. J. Theor. Comput. Sci. 2013 (2013) - [j7]Danupon Nanongkai:
Simple FPTAS for the subset-sums ratio problem. Inf. Process. Lett. 113(19-21): 750-753 (2013) - [j6]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. J. ACM 60(1): 2:1-2:31 (2013) - [j5]Atish Das Sarma, Amita Gajewar, Richard J. Lipton, Danupon Nanongkai:
An Approximate Restatement of the Four-Color Theorem. J. Graph Algorithms Appl. 17(5): 567-573 (2013) - [c17]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. FOCS 2013: 370-379 - [c16]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. FOCS 2013: 538-547 - [c15]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. ICALP (2) 2013: 607-619 - [c14]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. SODA 2013: 1557-1576 - [i14]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. CoRR abs/1302.4544 (2013) - [i13]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. CoRR abs/1308.0776 (2013) - [i12]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. CoRR abs/1308.2617 (2013) - [i11]Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
The Distributed Complexity of Large-scale Graph Processing. CoRR abs/1311.6209 (2013) - 2012
- [j4]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer:
Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. 41(5): 1235-1265 (2012) - [c13]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. ESA 2012: 301-312 - [c12]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Brief announcement: maintaining large dense subgraphs on dynamic networks. PODC 2012: 229-230 - [c11]Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, Kazuhisa Makino:
Interactive regret minimization. SIGMOD Conference 2012: 109-120 - [c10]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. DISC 2012: 151-165 - [i10]Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun:
Multi-Attribute Profit-Maximizing Pricing (Extended Abstract). CoRR abs/1202.2840 (2012) - [i9]Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai:
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs. CoRR abs/1203.1940 (2012) - [i8]Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan:
Quantum Distributed Network Computing: Lower Bounds and Techniques. CoRR abs/1207.5211 (2012) - [i7]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. CoRR abs/1208.1454 (2012) - [i6]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. CoRR abs/1212.4129 (2012) - 2011
- [j3]Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai:
Best-order streaming model. Theor. Comput. Sci. 412(23): 2544-2555 (2011) - [c9]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Richard J. Lipton, Jun (Jim) Xu:
Representative skylines using threshold-based preference distributions. ICDE 2011: 387-398 - [c8]Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan:
A tight unconditional lower bound on distributed randomwalk computation. PODC 2011: 257-266 - [c7]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer:
Distributed verification and hardness of distributed approximation. STOC 2011: 363-372 - [i5]Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan:
A Tight Lower Bound on Distributed Random Walk Computation. CoRR abs/1102.2906 (2011) - 2010
- [j2]Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, Richard J. Lipton, Jun (Jim) Xu:
Regret-Minimizing Representative Databases. Proc. VLDB Endow. 3(1): 1114-1124 (2010) - [c6]Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-matching Problems (Extended Abstract). ICALP (1) 2010: 176-187 - [c5]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Efficient distributed random walks with applications. PODC 2010: 201-210 - [c4]Patrick Briest, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, Danupon Nanongkai:
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. WINE 2010: 444-454 - [i4]Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. CoRR abs/1004.3363 (2010) - [i3]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer:
Distributed Verification and Hardness of Distributed Approximation. CoRR abs/1011.3049 (2010)
2000 – 2009
- 2009
- [j1]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Jun (Jim) Xu:
Randomized Multi-pass Streaming Skyline Algorithms. Proc. VLDB Endow. 2(1): 85-96 (2009) - [c3]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan:
Fast distributed random walks. PODC 2009: 161-170 - [c2]Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai:
Best-Order Streaming Model. TAMC 2009: 178-191 - [i2]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Stackelberg Pricing is Hard to Approximate within 2-ε. CoRR abs/0910.0443 (2009) - [i1]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Near-Optimal Sublinear Time Bounds for Distributed Random Walks. CoRR abs/0911.3195 (2009) - 2004
- [c1]Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai:
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. SODA 2004: 828-829
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
