Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Danupon Nanongkai

> Home > Persons

Person information

affiliation: Max Planck Institut für Informatik Saarbrücken, Germany

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2023
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/BhattacharyaHNW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/BhattacharyaHNW23
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)
2022
[j18]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dc/NanongkaiS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dc/NanongkaiS22
Danupon Nanongkai, Michele Scquizzato:
Equivalence classes and conditional hardness in massively parallel computations. Distributed Comput. 35(2): 165-183 (2022)
2021
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/HenzingerKN21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/HenzingerKN21
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. SIAM J. Comput. 50(3) (2021)
2020
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/ChalermsookCKLM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/ChalermsookCKLM20
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]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/VidickNA20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/VidickNA20
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)
2019
[j14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BansalCLNN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BansalCLNN19
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-Time Approximation. Algorithmica 81(10): 3993-4009 (2019)
2018
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/HenzingerKN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/HenzingerKN18
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)
2017
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/HenzingerKN17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/HenzingerKN17
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)
2016
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/HenzingerKN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/HenzingerKN16
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)
2014
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ChatterjeeHKN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ChatterjeeHKN14
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]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/FakcharoenpholLN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/FakcharoenpholLN14
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. ACM Trans. Algorithms 10(3): 14:1-14:23 (2014)
2013
[j8]
- view
  - electronic edition @ uchicago.edu (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/cjtcs/ChalermsookKLN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cjtcs/ChalermsookKLN13
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]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/Nanongkai13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Nanongkai13
Danupon Nanongkai:
Simple FPTAS for the subset-sums ratio problem. Inf. Process. Lett. 113(19-21): 750-753 (2013)
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/SarmaNPT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/SarmaNPT13
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. J. ACM 60(1): 2:1-2:31 (2013)
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jgaa/SarmaGLN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/SarmaGLN13
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)
2012
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/SarmaHKKNPPW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/SarmaHKKNPPW12
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)
2011
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/SarmaLN11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/SarmaLN11
Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai:
Best-order streaming model. Theor. Comput. Sci. 412(23): 2544-2555 (2011)
2010
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/pvldb/NanongkaiSLLX10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pvldb/NanongkaiSLLX10
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)
2009
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/pvldb/SarmaLNX09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pvldb/SarmaLNX09
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Jun (Jim) Xu:
Randomized Multi-pass Streaming Skyline Algorithms. Proc. VLDB Endow. 2(1): 85-96 (2009)

Conference and Workshop Papers

see FAQ

What is the meaning of the colors in the publication lists?

2023
[c68]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/GoranciHNSTW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/GoranciHNSTW23
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]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/0006NPS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/0006NPS23
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Near-Linear Time Approximations for Cut Problems via Fair Cuts. SODA 2023: 240-275
[c66]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/BlikstadMNT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BlikstadMNT23
Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu:
Fast Algorithms via Dynamic-Oracle Matroids. STOC 2023: 1229-1242
2022
[c65]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/ApersEGLMN22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ApersEGLMN22
Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut Query Algorithms with Star Contraction. FOCS 2022: 507-518
[c64]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/BernsteinNW22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BernsteinNW22
Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Near-linear Time. FOCS 2022: 600-611
[c63]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/BlikstadBEMN22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BlikstadBEMN22
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]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/BernsteinBGNSS022
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/BernsteinBGNSS022
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]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/ChalermsookHNSS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/ChalermsookHNSS22
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]
- view
  authority control:
- export record
  dblp key:
  - conf/ipco/BeidemanCMN22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/BeidemanCMN22
Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai:
Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. IPCO 2022: 70-83
2021
[c59]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/Cen0NPSQ21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/Cen0NPSQ21
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]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/soda/BhattacharyaHNW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BhattacharyaHNW21
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. SODA 2021: 2537-2549
[c57]
- view
  authority control:
- export record
  dblp key:
  - conf/spaa/Lopez-MartinezM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/Lopez-MartinezM21
Andrés López-Martínez, Sagnik Mukhopadhyay, Danupon Nanongkai:
Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs. SPAA 2021: 351-361
[c56]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/LiNPSY21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/LiNPSY21
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex connectivity in poly-logarithmic max-flows. STOC 2021: 317-329
[c55]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/BlikstadBMN21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BlikstadBMN21
Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai:
Breaking the quadratic barrier for matroid intersection. STOC 2021: 421-432
[c54]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/DoryEMN21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/DoryEMN21
Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Distributed weighted min-cut in nearly-optimal time. STOC 2021: 1144-1153
2020
[c53]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/BrandLNPSS0W20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BrandLNPSS0W20
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]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/ChuzhoyGLNPS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ChuzhoyGLNPS20
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]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/soda/BhattacharyaNS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BhattacharyaNS20
Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak:
Coarse-Grained Complexity for Dynamic Algorithms. SODA 2020: 476-494
[c50]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/soda/ForsterNYSY20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ForsterNYSY20
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]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/MukhopadhyayN20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/MukhopadhyayN20
Sagnik Mukhopadhyay, Danupon Nanongkai:
Weighted min-cut: sequential, cut-query, and streaming algorithms. STOC 2020: 496-509
2019
[c48]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/BhattacharyaHN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BhattacharyaHN19
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. FOCS 2019: 406-423
[c47]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/BrandN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BrandN19
Jan van den Brand, Danupon Nanongkai:
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. FOCS 2019: 436-455
[c46]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/BrandNS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BrandNS19
Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. FOCS 2019: 456-480
[c45]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/opodis/NanongkaiS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/opodis/NanongkaiS19
Danupon Nanongkai, Michele Scquizzato:
Equivalence Classes and Conditional Hardness in Massively Parallel Computations. OPODIS 2019: 33:1-33:16
[c44]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/NanongkaiSY19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/NanongkaiSY19
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Breaking quadratic time for small vertex connectivity and an approximation scheme. STOC 2019: 241-252
[c43]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/BernsteinN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BernsteinN19
Aaron Bernstein, Danupon Nanongkai:
Distributed exact weighted all-pairs shortest paths in near-linear time. STOC 2019: 334-342
[c42]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/DagaHNS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/DagaHNS19
Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed edge connectivity in sublinear time. STOC 2019: 343-354
2018
[c41]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/ForsterN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ForsterN18
Sebastian Forster, Danupon Nanongkai:
A Faster Distributed Single-Source Shortest Paths Algorithm. FOCS 2018: 686-697
[c40]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/soda/BhattacharyaCHN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BhattacharyaCHN18
Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai:
Dynamic Algorithms for Graph Coloring. SODA 2018: 1-20
2017
[c39]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/HuangNS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/HuangNS17
Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n^5/4) Rounds. FOCS 2017: 168-179
[c38]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/ChalermsookCKLM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ChalermsookCKLM17
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]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/NanongkaiSW17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/NanongkaiSW17
Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen:
Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. FOCS 2017: 950-961
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/BhattacharyaHN17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BhattacharyaHN17
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log³ n) Worst Case Update Time. SODA 2017: 470-489
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/NanongkaiS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/NanongkaiS17
Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n^{1/2 - ε})-time. STOC 2017: 1122-1129
2016
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/BhattacharyaHN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BhattacharyaHN16
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New deterministic approximation algorithms for fully dynamic matching. STOC 2016: 398-411
[c33]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/HenzingerKN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/HenzingerKN16
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. STOC 2016: 489-498
2015
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/HenzingerKN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/HenzingerKN15
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. ICALP (1) 2015: 725-736
[c31]
- view
  authority control:
- export record
  dblp key:
  - conf/sigmetrics/ChalermsookSLN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigmetrics/ChalermsookSLN15
Parinya Chalermsook, Atish Das Sarma, Ashwin Lall, Danupon Nanongkai:
Social Network Monetization via Sponsored Viral Marketing. SIGMETRICS 2015: 259-270
[c30]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/soda/KlauckNP015
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/KlauckNP015
Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
Distributed Computation of Large-scale Graph Problems. SODA 2015: 391-410
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/HenzingerKNS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/HenzingerKNS15
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]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/BhattacharyaHNT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BhattacharyaHNT15
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
2014
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/HenzingerKN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/HenzingerKN14
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]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/ChalermsookLN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ChalermsookLN14
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]
- view
  authority control:
- export record
  dblp key:
  - conf/latin/ChalermsookLN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/ChalermsookLN14
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. LATIN 2014: 409-420
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/podc/ElkinKNP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/ElkinKNP14
Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan:
Can quantum communication speed up distributed computation? PODC 2014: 166-175
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/podc/Nanongkai13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/Nanongkai13
Danupon Nanongkai:
Brief announcement: almost-tight approximation distributed algorithm for minimum cut. PODC 2014: 382-384
[c22]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/soda/HenzingerKN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/HenzingerKN14
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. SODA 2014: 1053-1072
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/Nanongkai14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Nanongkai14
Danupon Nanongkai:
Distributed approximation algorithms for weighted shortest paths. STOC 2014: 565-573
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/HenzingerKN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/HenzingerKN14
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]
- view
  authority control:
- export record
  dblp key:
  - conf/wdag/NanongkaiS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wdag/NanongkaiS14
Danupon Nanongkai, Hsin-Hao Su:
Almost-Tight Distributed Minimum Cut Algorithms. DISC 2014: 439-453
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/wdag/KuttenNP014
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wdag/KuttenNP014
Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
Distributed Symmetry Breaking in Hypergraphs. DISC 2014: 469-483
2013
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/ChalermsookLN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ChalermsookLN13
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. FOCS 2013: 370-379
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/HenzingerKN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/HenzingerKN13
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. FOCS 2013: 538-547
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/HenzingerKN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/HenzingerKN13
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. ICALP (2) 2013: 607-619
[c14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/soda/ChalermsookLN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ChalermsookLN13
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. SODA 2013: 1557-1576
2012
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/esa/ChatterjeeHKN12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/ChatterjeeHKN12
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. ESA 2012: 301-312
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/podc/SarmaLNT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/SarmaLNT12
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Brief announcement: maintaining large dense subgraphs on dynamic networks. PODC 2012: 229-230
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/sigmod/NanongkaiLSM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigmod/NanongkaiLSM12
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, Kazuhisa Makino:
Interactive regret minimization. SIGMOD Conference 2012: 109-120
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/wdag/SarmaLNT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wdag/SarmaLNT12
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. DISC 2012: 151-165
2011
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/icde/SarmaLNLX11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icde/SarmaLNLX11
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]
- view
  authority control:
- export record
  dblp key:
  - conf/podc/NanongkaiSP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/NanongkaiSP11
Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan:
A tight unconditional lower bound on distributed randomwalk computation. PODC 2011: 257-266
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/SarmaHKKNPPW11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/SarmaHKKNPPW11
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
2010
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/FakcharoenpholLN10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/FakcharoenpholLN10
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-matching Problems (Extended Abstract). ICALP (1) 2010: 176-187
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/podc/SarmaNPT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/SarmaNPT10
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Efficient distributed random walks with applications. PODC 2010: 201-210
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/wine/BriestCKLN10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wine/BriestCKLN10
Patrick Briest, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, Danupon Nanongkai:
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. WINE 2010: 444-454
2009
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/podc/SarmaNP09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/SarmaNP09
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan:
Fast distributed random walks. PODC 2009: 161-170
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/tamc/SarmaLN09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/SarmaLN09
Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai:
Best-Order Streaming Model. TAMC 2009: 178-191
2004
[c1]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/ChalermsookFN04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ChalermsookFN04
Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai:
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. SODA 2004: 828-829

Reference Works

see FAQ

What is the meaning of the colors in the publication lists?

2016
[r1]
- view
  authority control:
- export record
  dblp key:
  - reference/algo/HenzingerKN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/reference/algo/HenzingerKN16
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization. Encyclopedia of Algorithms 2016: 600-602

Informal and Other Publications

see FAQ

What is the meaning of the colors in the publication lists?

2023
[i68]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2302-05951
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2302-05951
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]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2302-09796
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2302-09796
Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu:
Fast Algorithms via Dynamic-Oracle Matroids. CoRR abs/2302.09796 (2023)
[i66]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2303-00811
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2303-00811
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
[i65]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2201-05674
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2201-05674
Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut query algorithms with star contraction. CoRR abs/2201.05674 (2022)
[i64]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2203-00751
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2203-00751
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]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2203-03456
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2203-03456
Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Almost-linear Time. CoRR abs/2203.03456 (2022)
[i62]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2205-14978
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2205-14978
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]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2208-02526
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2208-02526
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
[i60]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2102-05548
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2102-05548
Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai:
Breaking the Quadratic Barrier for Matroid Intersection. CoRR abs/2102.05548 (2021)
[i59]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2102-06565
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2102-06565
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2103-15724
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2103-15724
Sagnik Mukhopadhyay, Danupon Nanongkai:
A Note on Isolating Cut Lemma for Submodular Function Minimization. CoRR abs/2103.15724 (2021)
[i57]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2104-00104
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2104-00104
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex Connectivity in Poly-logarithmic Max-flows. CoRR abs/2104.00104 (2021)
[i56]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2104-07898
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2104-07898
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2111-08959
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2111-08959
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
[i54]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2001-00336
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2001-00336
Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak:
Coarse-Grained Complexity for Dynamic Algorithms. CoRR abs/2001.00336 (2020)
[i53]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2001-02191
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2001-02191
Danupon Nanongkai, Michele Scquizzato:
Equivalence Classes and Conditional Hardness in Massively Parallel Computations. CoRR abs/2001.02191 (2020)
[i52]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2002-11171
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2002-11171
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
An Improved Algorithm for Dynamic Set Cover. CoRR abs/2002.11171 (2020)
[i51]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2004-08432
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2004-08432
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2004-09129
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2004-09129
Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Distributed Weighted Min-Cut in Nearly-Optimal Time. CoRR abs/2004.09129 (2020)
[i49]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2009-01802
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2009-01802
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2011-08097
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2011-08097
Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai:
Faster connectivity in low-rank hypergraphs via expander decomposition. CoRR abs/2011.08097 (2020)
2019
[i47]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1904-04341
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1904-04341
Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Edge Connectivity in Sublinear Time. CoRR abs/1904.04341 (2019)
[i46]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1904-04453
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1904-04453
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme. CoRR abs/1904.04453 (2019)
[i45]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1905-05067
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-05067
Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. CoRR abs/1905.05067 (2019)
[i44]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1905-05329
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-05329
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries. CoRR abs/1905.05329 (2019)
[i43]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1909-10850
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1909-10850
Jan van den Brand, Danupon Nanongkai:
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. CoRR abs/1909.10850 (2019)
[i42]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1909-11600
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1909-11600
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. CoRR abs/1909.11600 (2019)
[i41]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1910-07950
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1910-07950
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1910-08025
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1910-08025
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1910-14344
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1910-14344
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1911-01651
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1911-01651
Sagnik Mukhopadhyay, Danupon Nanongkai:
Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms. CoRR abs/1911.01651 (2019)
2018
[i37]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1811-03337
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1811-03337
Aaron Bernstein, Danupon Nanongkai:
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time. CoRR abs/1811.03337 (2018)
2017
[i36]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BhattacharyaHN17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BhattacharyaHN17
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log³n) Worst Case Update Time. CoRR abs/1704.02844 (2017)
[i35]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1708-03515
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1708-03515
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-time Approximation. CoRR abs/1708.03515 (2017)
[i34]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1708-03903
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1708-03903
Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n^5/4) Rounds. CoRR abs/1708.03903 (2017)
[i33]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1708-03962
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1708-03962
Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen:
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time. CoRR abs/1708.03962 (2017)
[i32]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1708-04218
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1708-04218
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1711-01364
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1711-01364
Sebastian Krinninger, Danupon Nanongkai:
A Faster Distributed Single-Source Shortest Paths Algorithm. CoRR abs/1711.01364 (2017)
[i30]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1711-04355
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1711-04355
Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai:
Dynamic Algorithms for Graph Coloring. CoRR abs/1711.04355 (2017)
2016
[i29]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BhattacharyaHN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BhattacharyaHN16
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New Deterministic Approximation Algorithms for Fully Dynamic Matching. CoRR abs/1604.05765 (2016)
[i28]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ChatterjeeHKK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ChatterjeeHKK16
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. CoRR abs/1604.08234 (2016)
[i27]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/NanongkaiS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/NanongkaiS16
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/HenzingerKN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/HenzingerKN16
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. CoRR abs/1612.03856 (2016)
2015
[i25]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BhattacharyaHNT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BhattacharyaHNT15
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/HenzingerKN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/HenzingerKN15
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths. CoRR abs/1504.07056 (2015)
[i23]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/HenzingerKN15a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/HenzingerKN15a
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/HenzingerKNS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/HenzingerKNS15
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/HenzingerKN15b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/HenzingerKN15b
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. CoRR abs/1512.08147 (2015)
[i20]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/HenzingerKN15c
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/HenzingerKN15c
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
[i19]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/Nanongkai14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/Nanongkai14
Danupon Nanongkai:
Distributed Approximation Algorithms for Weighted Shortest Paths. CoRR abs/1403.5171 (2014)
[i18]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/Nanongkai14a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/Nanongkai14a
Danupon Nanongkai:
Brief Announcement: Almost-Tight Approximation Distributed Algorithm for Minimum Cut. CoRR abs/1403.6188 (2014)
[i17]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/KuttenNPR14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/KuttenNPR14
Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
Distributed Symmetry Breaking in Hypergraphs. CoRR abs/1405.1649 (2014)
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/NanongkaiS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/NanongkaiS14
Danupon Nanongkai, Hsin-Hao Su:
Almost-Tight Distributed Minimum Cut Algorithms. CoRR abs/1408.0557 (2014)
[i15]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ChalermsookLN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ChalermsookLN14
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
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1302-4544
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1302-4544
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. CoRR abs/1302.4544 (2013)
[i13]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/HenzingerKN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/HenzingerKN13
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ChalermsookLN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ChalermsookLN13
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/KlauckNPR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/KlauckNPR13
Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
The Distributed Complexity of Large-scale Graph Processing. CoRR abs/1311.6209 (2013)
2012
[i10]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1202-2840
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1202-2840
Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun:
Multi-Attribute Profit-Maximizing Pricing (Extended Abstract). CoRR abs/1202.2840 (2012)
[i9]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1203-1940
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1203-1940
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1207-5211
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1207-5211
Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan:
Quantum Distributed Network Computing: Lower Bounds and Techniques. CoRR abs/1207.5211 (2012)
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1208-1454
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1208-1454
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. CoRR abs/1208.1454 (2012)
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1212-4129
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1212-4129
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
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1102-2906
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1102-2906
Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan:
A Tight Lower Bound on Distributed Random Walk Computation. CoRR abs/1102.2906 (2011)
2010
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1004-3363
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1004-3363
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. CoRR abs/1004.3363 (2010)
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1011-3049
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1011-3049
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)
2009
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0910-0443
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0910-0443
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Stackelberg Pricing is Hard to Approximate within 2-ε. CoRR abs/0910.0443 (2009)
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0911-3195
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0911-3195
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Near-Optimal Sublinear Time Bounds for Distributed Random Walks. CoRR abs/0911.3195 (2009)

Coauthor Index

see FAQ

a service of

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.