Thatchaphol Saranurak
University of Michigan
H-index: 24
North America-United States
Top articles of Thatchaphol Saranurak
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts | Zhongtian He Shang-En Huang Thatchaphol Saranurak | 2024 | |
Approximating Small Sparse Cuts | arXiv preprint arXiv:2403.08983 | Aditya Anand Euiwoong Lee Jason Li Thatchaphol Saranurak | 2024/3/13 |
Dynamic Deterministic Constant-Approximate Distance Oracles with Worst-Case Update Time | arXiv preprint arXiv:2402.18541 | Bernhard Haeupler Yaowei Long Thatchaphol Saranurak | 2024/2/28 |
Decremental -Approximate Maximum Eigenvector: Dynamic Power Method | arXiv preprint arXiv:2402.17929 | Deeksha Adil Thatchaphol Saranurak | 2024/2/27 |
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422) | Jason Li Debmalya Panigrahi Laura Sanita Thatchaphol Saranurak | 2024 | |
Cactus Representation of Minimum Cuts: Derandomize and Speed up | Zhongtian He Shang-En Huang Thatchaphol Saranurak | 2024 | |
Deterministic -Vertex Connectivity in Max-flows | arXiv preprint arXiv:2308.04695 | Chaitanya Nalam Thatchaphol Saranurak Sorrachai Yingchareonthawornchai | 2023/8/9 |
Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction | Chaitanya Nalam Thatchaphol Saranurak | 2023 | |
Maximal -Edge-Connected Subgraphs in Almost-Linear Time for Small | arXiv preprint arXiv:2307.00147 | Thatchaphol Saranurak Wuwei Yuan | 2023/6/30 |
Pinning Down the Strong Wilber-1 Bound for Binary Search Trees | Theory of Computing | Parinya Chalermsook Julia Chuzhoy Thatchaphol Saranurak | 2023/12/19 |
Near-linear time approximations for cut problems via fair cuts | Jason Li Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak | 2023 | |
Dynamic (1+ ϵ)-approximate matching size in truly sublinear update time | Sayan Bhattacharya Peter Kiss Thatchaphol Saranurak | 2023/11/6 | |
Fully dynamic exact edge connectivity in sublinear time | Gramoz Goranci Monika Henzinger Danupon Nanongkai Thatchaphol Saranurak Mikkel Thorup | 2023 | |
Maximum length-constrained flows and disjoint paths: Distributed, deterministic, and fast | Bernhard Haeupler D Ellis Hershkowitz Thatchaphol Saranurak | 2023/6/2 | |
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time | Amir Abboud Jason Li Debmalya Panigrahi Thatchaphol Saranurak | 2023/11/6 | |
Dynamic matching with better-than-2 approximation in polylogarithmic update time | Sayan Bhattacharya Peter Kiss Thatchaphol Saranurak David Wajc | 2023 | |
Sublinear Algorithms for (1.5+ ????)-Approximate Matching | Sayan Bhattacharya Peter Kiss Thatchaphol Saranurak | 2023/6/2 | |
Chasing positive bodies | Sayan Bhattacharya Niv Buchbinder Roie Levin Thatchaphol Saranurak | 2023/11/6 | |
Dynamic algorithms for packing-covering lps via multiplicative weight updates | Sayan Bhattacharya Peter Kiss Thatchaphol Saranurak | 2023 | |
Tight conditional lower bounds for vertex connectivity problems | Zhiyi Huang Yaowei Long Thatchaphol Saranurak Benyu Wang | 2023/6/2 |
Co-Authors
