( en | de | ru )

 

Disambiguation of "Nanongkai, Danupon"

Author of the publication

copydeleteadd this publication to your clipboard
Faster Algorithms for Semi-matching Problems (Extended Abstract).

, , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 176-187. Springer, (2010)

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 Graph Sparsifiers Against an Adaptive Adversary., , , , , , and . CoRR, (2020)Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds., , and . CoRR, (2017)Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time., and . CoRR, (2018)Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time., , and . SODA, page 470-489. SIAM, (2017)Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More., , and . SODA, page 1557-1576. SIAM, (2013)Nearly Optimal Communication and Query Complexity of Bipartite Matching., , , , and . FOCS, page 1174-1185. IEEE, (2022)A Faster Distributed Single-Source Shortest Paths Algorithm., and . FOCS, page 686-697. IEEE Computer Society, (2018)Efficient distributed random walks with applications., , , and . PODC, page 201-210. ACM, (2010)Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs., , , , , , , and . FOCS, page 919-930. IEEE, (2020)Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries., , and . CoRR, (2019)