Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms.

S. Forster, D. Nanongkai, T. Saranurak, L. Yang, and S. Yingchareonthawornchai. CoRR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Nanongkai, Danupon

add a person with the name Nanongkai, Danupon

Other publications of authors with the same name

Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time.S. Bhattacharya, M. Henzinger, and D. Nanongkai. SODA, page 470-489. SIAM, (2017)Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More.P. Chalermsook, B. Laekhanukit, and D. Nanongkai. SODA, page 1557-1576. SIAM, (2013)Nearly Optimal Communication and Query Complexity of Bipartite Matching.J. Blikstad, J. van den Brand, Y. Efron, S. Mukhopadhyay, and D. Nanongkai. FOCS, page 1174-1185. IEEE, (2022)Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time.A. Bernstein, and D. Nanongkai. CoRR, (2018)A Faster Distributed Single-Source Shortest Paths Algorithm.S. Forster, and D. Nanongkai. FOCS, page 686-697. IEEE Computer Society, (2018)Efficient distributed random walks with applications.A. Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. PODC, page 201-210. ACM, (2010)Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex.Y. Gao, J. Li, D. Nanongkai, R. Peng, T. Saranurak, and S. Yingchareonthawornchai. CoRR, (2019)Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs.J. van den Brand, Y. Lee, D. Nanongkai, R. Peng, T. Saranurak, A. Sidford, Z. Song, and D. Wang. CoRR, (2020)Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries.D. Nanongkai, T. Saranurak, and S. Yingchareonthawornchai. CoRR, (2019)Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary.A. Bernstein, J. van den Brand, M. Gutenberg, D. Nanongkai, T. Saranurak, A. Sidford, and H. Sun. CoRR, (2020)

BibSonomy

Disambiguation of "Nanongkai, Danupon"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms.

Please choose a person to relate this publication to

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Nanongkai, Danupon"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms.

Please choose a person to relate this publication to

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms.