( en | de | ru )

 

Disambiguation of "Nanongkai, Danupon"

Author of the publication

copydeleteadd this publication to your clipboard
Breaking quadratic time for small vertex connectivity and an approximation scheme.

, , and . STOC, page 241-252. ACM, (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

Equivalence classes and conditional hardness in massively parallel computations., and . Distributed Comput., 35 (2): 165-183 (2022)Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights., , , , , , , and . CoRR, (2023)Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex., , , , , and . CoRR, (2019)Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time., , , and . CoRR, (2022)Faster Algorithms for Semi-Matching Problems., , and . ACM Trans. Algorithms, 10 (3): 14:1-14:23 (2014)An Improved Algorithm for Dynamic Set Cover., , , and . CoRR, (2020)Randomized Multi-pass Streaming Skyline Algorithms., , , and . Proc. VLDB Endow., 2 (1): 85-96 (2009)Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary., , , , , , and . CoRR, (2020)Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time., and . CoRR, (2018)Polynomial-Time Algorithms for Energy Games with Special Weight Structures., , , and . CoRR, (2016)