Danupon Nanongkai
Kungliga Tekniska högskolan
H-index: 39
Europe-Sweden
Top articles of Danupon Nanongkai
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Parallel and distributed exact single-source shortest paths with negative edge weights | arXiv preprint arXiv:2303.00811 | Vikrant Ashvinkumar Aaron Bernstein Nairen Cao Christoph Grunau Bernhard Haeupler | 2023/3/1 |
Near-linear time approximations for cut problems via fair cuts | Jason Li Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak | 2023 | |
Fully dynamic exact edge connectivity in sublinear time | Gramoz Goranci Monika Henzinger Danupon Nanongkai Thatchaphol Saranurak Mikkel Thorup | 2023 | |
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover | SIAM Journal on Computing | Sayan Bhattacharya Monika Henzinger Danupon Nanongkai Xiaowei Wu | 2023/10/31 |
Fast algorithms via dynamic-oracle matroids | Joakim Blikstad Sagnik Mukhopadhyay Danupon Nanongkai Ta-Wei Tu | 2023/6/2 | |
Cut query algorithms with star contraction | Simon Apers Yuval Efron Paweł Gawrychowski Troy Lee Sagnik Mukhopadhyay | 2022/10/31 | |
Approximating k-edge-connected spanning subgraphs via a near-linear time LP solver | arXiv preprint arXiv:2205.14978 | Parinya Chalermsook Chien-Chung Huang Danupon Nanongkai Thatchaphol Saranurak Pattara Sukprasert | 2022/5/30 |
Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition | Calvin Beideman Karthekeyan Chandrasekaran Sagnik Mukhopadhyay Danupon Nanongkai | 2022/5/27 | |
Equivalence classes and conditional hardness in massively parallel computations | Distributed computing | Danupon Nanongkai Michele Scquizzato | 2022/4 |
Nearly optimal communication and query complexity of bipartite matching | Joakim Blikstad Jan Van Den Brand Yuval Efron Sagnik Mukhopadhyay Danupon Nanongkai | 2022/10/31 | |
Minimum cuts in directed graphs via partial sparsification | Ruoxu Cen Jason Li Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak | 2022/2/7 | |
Negative-weight single-source shortest paths in near-linear time | Aaron Bernstein Danupon Nanongkai Christian Wulff-Nilsen | 2022/10/31 | |
Minimum cuts in directed graphs via√ n max-flows | arXiv preprint arXiv:2104.07898 | Ruoxu Cen Jason Li Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak | 2021 |
Work-optimal parallel minimum cuts for non-sparse graphs | Andrés López-Martínez Sagnik Mukhopadhyay Danupon Nanongkai | 2021/7/6 | |
Distributed exact weighted all-pairs shortest paths in randomized near-linear time | Chien-Chung Huang Danupon Nanongkai Thatchaphol Saranurak | 2017/10/15 | |
Vertex connectivity in poly-logarithmic max-flows | Jason Li Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak Sorrachai Yingchareonthawornchai | 2021/6/15 | |
Dynamic set cover: Improved amortized and worst-case update time | Sayan Bhattacharya Monika Henzinger Danupon Nanongkai Xiaowei Wu | 2021 | |
Distributed weighted min-cut in nearly-optimal time | Michal Dory Yuval Efron Sagnik Mukhopadhyay Danupon Nanongkai | 2021/6/15 | |
Minimum Cuts in Directed Graphs via Max-Flows | arXiv preprint arXiv:2104.07898 | Ruoxu Cen Jason Li Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak | 2021/4/16 |
A note on isolating cut lemma for submodular function minimization | arXiv preprint arXiv:2103.15724 | Sagnik Mukhopadhyay Danupon Nanongkai | 2021/3/29 |
Co-Authors
