| 2026 | ICALP | Parallel Reachability and Shortest Paths on Non-Sparse Digraphs: Near-Linear Work and Sub-Square-Root Depth. | Vikrant Ashvinkumar, Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2026 | ICALP | Expander Decomposition with Almost Optimal Overhead. | Nikhil Bansal, Arun Jambulapati, Thatchaphol Saranurak |
| 2026 | ICALP | Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition. | Xizhe Li, Yaowei Long, David Pidugu, Thatchaphol Saranurak, Benyu Wang |
| 2026 | SODA | Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems. | Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak |
| 2026 | SODA | Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching. | Matija Bucic, Zhongtian He, Shang-En Huang, Thatchaphol Saranurak |
| 2026 | SODA | Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time. | Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2026 | STOC | Reviving Thorup's Shortcut Conjecture. | Aaron Bernstein, Henry L. Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller |
| 2026 | STOC | Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers. | Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak |
| 2026 | STOC | DAG Projections: Reducing Distance and Flow Problems to DAGs. | Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak |
| 2026 | STOC | A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures. | Bernhard Haeupler, Yaowei Long, Antti Roeyskoe, Thatchaphol Saranurak |
| 2025 | ESA | Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts. | Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang |
| 2025 | FOCS | Deterministic Almost-Linear-Time Gomory-Hu Trees. | Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan |
| 2025 | FOCS | Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs. | Aaron Bernstein, Joakim Blikstad, Jason Li, Thatchaphol Saranurak, Ta-Wei Tu |
| 2025 | FOCS | Parallel (1+ε)-Approximate Multi-Commodity Min-Cost Flow in Almost Optimal Depth and Work. | Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang |
| 2025 | FOCS | Near-Optimal Fault-Tolerant Strong Connectivity Preservers. | Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang |
| 2025 | ICALP | All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. | Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak |
| 2025 | ICALP | Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method. | Deeksha Adil, Thatchaphol Saranurak |
| 2025 | SODA | Unbreakable Decomposition in Close-to-Linear Time. | Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak |
| 2025 | SODA | Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries. | Aditya Anand, Thatchaphol Saranurak, Yunfan Wang |
| 2025 | SODA | Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal. | Daoyuan Chen, Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2025 | SODA | Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies. | Yaowei Long, Seth Pettie, Thatchaphol Saranurak |
| 2025 | STOC | Deterministic Dynamic Maximal Matching in Sublinear Update Time. | Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2025 | STOC | Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness. | Yonggang Jiang, Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2024 | FOCS | Maximum Flow by Augmenting Paths in n | Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu |
| 2024 | FOCS | Dynamic Deterministic Constant-Approximate Distance Oracles with n | Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak |
| 2024 | ICALP | Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time. | Kevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak |
| 2024 | SODA | Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. | Zhongtian He, Shang-En Huang, Thatchaphol Saranurak |
| 2024 | SODA | Cactus Representation of Minimum Cuts: Derandomize and Speed up. | Zhongtian He, Shang-En Huang, Thatchaphol Saranurak |
| 2024 | STOC | Approximating Small Sparse Cuts. | Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak |
| 2024 | STOC | Low-Step Multi-commodity Flow Emulators. | Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak |
| 2023 | ESA | Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. | Thatchaphol Saranurak, Wuwei Yuan |
| 2023 | FOCS | 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 | FOCS | Chasing Positive Bodies. | Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak |
| 2023 | FOCS | Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2023 | SODA | Near-Linear Time Approximations for Cut Problems via Fair Cuts. | Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak |
| 2023 | SODA | Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2023 | SODA | Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc |
| 2023 | SODA | Fully Dynamic Exact Edge Connectivity in Sublinear Time. | Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen |
| 2023 | SODA | Maximal | Chaitanya Nalam, Thatchaphol Saranurak |
| 2023 | STOC | Sublinear Algorithms for (1.5+ε)-Approximate Matching. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2023 | STOC | Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. | Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak |
| 2023 | STOC | Tight Conditional Lower Bounds for Vertex Connectivity Problems. | Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang |
| 2022 | ESA | Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. | Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert |
| 2022 | ESA | Vertex Sparsifiers for Hyperedge Connectivity. | Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang |
| 2022 | FOCS | Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. | Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi |
| 2022 | FOCS | Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. | Yaowei Long, Thatchaphol Saranurak |
| 2022 | FOCS | Deterministic Small Vertex Connectivity in Almost Linear Time. | Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2022 | ICALP | Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. | Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun |
| 2022 | ICALP | Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. | Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai |
| 2022 | STOC | Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. | Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer |
| 2022 | STOC | Optimal vertex connectivity oracles. | Seth Pettie, Thatchaphol Saranurak, Longhui Yin |
| 2021 | FOCS | A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. | Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak |
| 2021 | FOCS | Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2021 | FOCS | Minimum Cuts in Directed Graphs via Partial Sparsification. | Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud |
| 2021 | SODA | Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. | Julia Chuzhoy, Thatchaphol Saranurak |
| 2021 | SODA | The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. | Gramoz Goranci, Harald Rcke, Thatchaphol Saranurak, Zihan Tan |
| 2021 | STOC | Minimum cost flows, MDPs, and ℓ | Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang |
| 2021 | STOC | Vertex connectivity in poly-logarithmic max-flows. | Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2020 | FOCS | Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2020 | FOCS | Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. | Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang |
| 2020 | FOCS | Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. | Yi-Jun Chang, Thatchaphol Saranurak |
| 2020 | FOCS | Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. | Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak |
| 2020 | FOCS | A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. | Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak |
| 2020 | SODA | Coarse-Grained Complexity for Dynamic Algorithms. | Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak |
| 2020 | SODA | Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. | Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2019 | FOCS | Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. | Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak |
| 2019 | FOCS | Sensitive Distance and Reachability Oracles for Large Batch Updates. | Jan van den Brand, Thatchaphol Saranurak |
| 2019 | PODC | Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. | Yi-Jun Chang, Thatchaphol Saranurak |
| 2019 | SODA | Expander Decomposition and Pruning: Faster, Stronger, and Simpler. | Thatchaphol Saranurak, Di Wang |
| 2019 | STOC | Distributed edge connectivity in sublinear time. | Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak |
| 2019 | STOC | Breaking quadratic time for small vertex connectivity and an approximation scheme. | Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2018 | ISAAC | Multi-Finger Binary Search Trees. | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2018 | STOC | Smooth heaps and a dual view of self-adjusting data structures. | Lszl Kozma, Thatchaphol Saranurak |
| 2017 | FOCS | Distributed Exact Weighted All-Pairs Shortest Paths in (n | Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak |
| 2017 | FOCS | Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. | Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen |
| 2017 | STOC | Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n | Danupon Nanongkai, Thatchaphol Saranurak |
| 2015 | ESA | Self-Adjusting Binary Search Trees: What Makes Them Tick? | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2015 | FOCS | Pattern-Avoiding Access in Binary Search Trees. | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2015 | STOC | Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak |
| 2015 | WADS | Greedy Is an Almost Optimal Deque. | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |