( en | de | ru )

 

Disambiguation of "Saranurak, Thatchaphol"

Author of the publication

copydeleteadd this publication to your clipboard
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms.

, , , and . SODA, page 2212-2228. SIAM, (2021)

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.

Thatchaphol Saranurak

 

Other publications of authors with the same name

Pinning Down the Strong Wilber 1 Bound for Binary Search Trees., , and . CoRR, (2019)Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition., and . CoRR, (2020)Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms., , , , and . SODA, page 2046-2065. SIAM, (2020)Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates., , and . SODA, page 1-47. SIAM, (2023)Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time., , and . CoRR, (2024)All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time., , , and . FOCS, page 2204-2212. IEEE, (2023)Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver., , , , , and . ICALP, volume 229 of LIPIcs, page 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k., and . ESA, volume 274 of LIPIcs, page 92:1-92:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Sublinear Algorithms for (1.5+ε)-Approximate Matching., , and . STOC, page 254-266. ACM, (2023)Distributed edge connectivity in sublinear time., , , and . STOC, page 343-354. ACM, (2019)