( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time.

, , , , , и . FOCS, стр. 884-895. IEEE, (2022)

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.

Thatchaphol Saranurak

 

Другие публикации лиц с тем же именем

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms., , , , и . SODA, стр. 2046-2065. SIAM, (2020)Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates., , и . SODA, стр. 1-47. SIAM, (2023)All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time., , , и . FOCS, стр. 2204-2212. IEEE, (2023)Sublinear Algorithms for (1.5+ε)-Approximate Matching., , и . STOC, стр. 254-266. ACM, (2023)Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver., , , , , и . ICALP, том 229 из LIPIcs, стр. 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k., и . ESA, том 274 из LIPIcs, стр. 92:1-92:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds., , и . CoRR, (2019)Pinning Down the Strong Wilber 1 Bound for Binary Search Trees., , и . CoRR, (2019)Distributed Edge Connectivity in Sublinear Time., , , и . CoRR, (2019)Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition., и . CoRR, (2020)