Thatchaphol Saranurak

175 papers A* 66A 5B 2C 1Journal 96Unranked 4
YearRankTypeTitle / Venue / Authors
2026 A* conf
Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching.
SODA
Matija Bucic, Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
2026 J jnl
Expander Decomposition with Almost Optimal Overhead.
CoRR
Nikhil Bansal, Arun Jambulapati, Thatchaphol Saranurak
2026 A* conf
Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time.
SODA
Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak
2026 — conf
Reducing Shortcut and Hopset Constructions to Shallow Graphs.
SOSA
Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak
2026 A* conf
Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems.
SODA
Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak
2026 J jnl
Space Complexity of Vertex Connectivity Oracles.
SIAM J. Comput.
Seth Pettie, Thatchaphol Saranurak, Longhui Yin
2025 A* conf
All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs.
ICALP
Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2025 J jnl
All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs.
CoRR
Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2025 J jnl
Approximating Directed Minimum Cut and Arborescence Packing via Directed Expander Hierarchies.
CoRR
Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang
2025 A* conf
Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs.
FOCS
Aaron Bernstein, Joakim Blikstad, Jason Li, Thatchaphol Saranurak, Ta-Wei Tu
2025 J jnl
Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs.
CoRR
Aaron Bernstein, Joakim Blikstad, Jason Li, Thatchaphol Saranurak, Ta-Wei Tu
2025 A* conf
Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies.
SODA
Yaowei Long, Seth Pettie, Thatchaphol Saranurak
2025 A* conf
Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method.
ICALP
Deeksha Adil, Thatchaphol Saranurak
2025 A* conf
Deterministic Almost-Linear-Time Gomory-Hu Trees.
FOCS
Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan
2025 J jnl
Deterministic Almost-Linear-Time Gomory-Hu Trees.
CoRR
Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan
2025 A* conf
Deterministic Dynamic Maximal Matching in Sublinear Update Time.
STOC
Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2025 J jnl
Deterministic Dynamic Maximal Matching in Sublinear Update Time.
CoRR
Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2025 A* conf
Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries.
SODA
Aditya Anand, Thatchaphol Saranurak, Yunfan Wang
2025 J jnl
Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers.
CoRR
Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak
2025 A* conf
Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness.
STOC
Yonggang Jiang, Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2025 J jnl
Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness.
CoRR
Yonggang Jiang, Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2025 J jnl
Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching.
CoRR
Matija Bucic, Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
2025 J jnl
Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time.
CoRR
Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak
2025 — conf
Finding Small Dijoins in Transitive Closure Time.
FSTTCS
Chaitanya Nalam, Thatchaphol Saranurak
2025 A conf
Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts.
ESA
Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang
2025 J jnl
Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts.
CoRR
Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang
2025 J jnl
Local Sherman's Algorithm for Multi-commodity Flow.
CoRR
Jason Li, Thatchaphol Saranurak
2025 A* conf
Near-Optimal Fault-Tolerant Strong Connectivity Preservers.
FOCS
Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang
2025 J jnl
Near-Optimal Fault-Tolerant Strong Connectivity Preservers.
CoRR
Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang
2025 A* conf
Parallel (1+ε)-Approximate Multi-Commodity Min-Cost Flow in Almost Optimal Depth and Work.
FOCS
Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang
2025 J jnl
Parallel (1+ε)-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work.
CoRR
Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang
2025 A* conf
Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal.
SODA
Daoyuan Chen, Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak
2025 J jnl
Reducing Shortcut and Hopset Constructions to Shallow Graphs.
CoRR
Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak
2025 J jnl
Reviving Thorup's Shortcut Conjecture.
CoRR
Aaron Bernstein, Henry L. Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller
2025 J jnl
Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems.
CoRR
Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak
2025 A* conf
Unbreakable Decomposition in Close-to-Linear Time.
SODA
Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak
2025 J jnl
Vertex Connectivity in Poly-logarithmic Max-Flows.
J. ACM
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2024 A* conf
Approximating Small Sparse Cuts.
STOC
Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2024 J jnl
Approximating Small Sparse Cuts.
CoRR
Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2024 A* conf
Cactus Representation of Minimum Cuts: Derandomize and Speed up.
SODA
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
2024 J jnl
Cactus Representation of Minimum Cuts: Derandomize and Speed up.
CoRR
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
2024 A* conf
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts.
SODA
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
2024 J jnl
Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies.
CoRR
Yaowei Long, Seth Pettie, Thatchaphol Saranurak
2024 J jnl
Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method.
CoRR
Deeksha Adil, Thatchaphol Saranurak
2024 J jnl
Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries.
CoRR
Aditya Anand, Thatchaphol Saranurak, Yunfan Wang
2024 A* conf
Dynamic Deterministic Constant-Approximate Distance Oracles with n
FOCS
Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak
2024 J jnl
Dynamic Deterministic Constant-Approximate Distance Oracles with n
CoRR
Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak
2024 J jnl
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.
J. ACM
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc
2024 J jnl
Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time.
CoRR
Kevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak
2024 A* conf
Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time.
ICALP
Kevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak
2024 J jnl
Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471).
Dagstuhl Reports
Keren Censor-Hillel, Yasamin Nazari, Eva Rotenberg, Thatchaphol Saranurak, Martín Costa
2024 J jnl
Low-Step Multi-Commodity Flow Emulators.
CoRR
Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak
2024 A* conf
Low-Step Multi-commodity Flow Emulators.
STOC
Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak
2024 A* conf
Maximum Flow by Augmenting Paths in n
FOCS
Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu
2024 J jnl
Maximum Flow by Augmenting Paths in n
CoRR
Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu
2024 J jnl
Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal.
CoRR
Daoyuan Chen, Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak
2024 J jnl
Unbreakable Decomposition in Close-to-Linear Time.
CoRR
Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak
2023 A* conf
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time.
FOCS
Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
2023 J jnl
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts.
CoRR
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
2023 A* conf
Chasing Positive Bodies.
FOCS
Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak
2023 J jnl
Chasing Positive Bodies.
CoRR
Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak
2023 J jnl
Deterministic k-Vertex Connectivity in k
CoRR
Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2023 J jnl
Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time.
CoRR
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2023 A* conf
Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time.
FOCS
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2023 A* conf
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates.
SODA
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2023 A* conf
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.
SODA
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc
2023 A* conf
Fully Dynamic Exact Edge Connectivity in Sublinear Time.
SODA
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
2023 J jnl
Fully Dynamic Exact Edge Connectivity in Sublinear Time.
CoRR
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
2023 J jnl
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422).
Dagstuhl Reports
Jason Li, Debmalya Panigrahi, Laura Sanità, Thatchaphol Saranurak
2023 A* conf
Maximal
SODA
Chaitanya Nalam, Thatchaphol Saranurak
2023 A conf
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k.
ESA
Thatchaphol Saranurak, Wuwei Yuan
2023 J jnl
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k.
CoRR
Thatchaphol Saranurak, Wuwei Yuan
2023 J jnl
Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction.
CoRR
Chaitanya Nalam, Thatchaphol Saranurak
2023 A* conf
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast.
STOC
Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak
2023 A* conf
Near-Linear Time Approximations for Cut Problems via Fair Cuts.
SODA
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak
2023 J jnl
Pinning Down the Strong Wilber-1 Bound for Binary Search Trees.
Theory Comput.
Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak
2023 A* conf
Sublinear Algorithms for (1.5+ε)-Approximate Matching.
STOC
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2023 A* conf
Tight Conditional Lower Bounds for Vertex Connectivity Problems.
STOC
Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang
2022 A* conf
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.
ICALP
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai
2022 J jnl
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.
CoRR
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai
2022 A* conf
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time.
FOCS
Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi
2022 A* conf
Deterministic Small Vertex Connectivity in Almost Linear Time.
FOCS
Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2022 J jnl
Deterministic Small Vertex Connectivity in Almost Linear Time.
CoRR
Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2022 J jnl
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates.
CoRR
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2022 J jnl
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.
CoRR
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc
2022 A* conf
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds.
STOC
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
2022 J jnl
Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time.
CoRR
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak
2022 A* conf
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary.
ICALP
Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun
2022 A* conf
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles.
FOCS
Yaowei Long, Thatchaphol Saranurak
2022 J jnl
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles.
CoRR
Yaowei Long, Thatchaphol Saranurak
2022 J jnl
Optimal Vertex Connectivity Oracles.
CoRR
Seth Pettie, Thatchaphol Saranurak, Longhui Yin
2022 A* conf
Optimal vertex connectivity oracles.
STOC
Seth Pettie, Thatchaphol Saranurak, Longhui Yin
2022 A conf
Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary.
ESA
Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert
2022 J jnl
Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary.
CoRR
Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert
2022 J jnl
Sublinear Algorithms for (1.5+ε)-Approximate Matching.
CoRR
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2022 J jnl
Tight Conditional Lower Bounds for Vertex Connectivity Problems.
CoRR
Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang
2022 A conf
Vertex Sparsifiers for Hyperedge Connectivity.
ESA
Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang
2022 J jnl
Vertex Sparsifiers for Hyperedge Connectivity.
CoRR
Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang
2021 A* conf
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs.
FOCS
Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
2021 J jnl
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs.
CoRR
Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
2021 — conf
A Simple Deterministic Algorithm for Edge Connectivity.
SOSA
Thatchaphol Saranurak
2021 A* conf
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition.
SODA
Julia Chuzhoy, Thatchaphol Saranurak
2021 A* conf
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time.
FOCS
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
2021 J jnl
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time.
CoRR
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
2021 J jnl
Deterministic Weighted Expander Decomposition in Almost-linear Time.
CoRR
Jason Li, Thatchaphol Saranurak
2021 J jnl
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds.
CoRR
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
2021 J jnl
Fast Algorithms for Hop-Constrained Flows and Moving Cuts.
CoRR
Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak
2021 J jnl
Gomory-Hu Tree in Subcubic Time.
CoRR
Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi
2021 J jnl
Minimum Cost Flows, MDPs, and 𝓁
CoRR
Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
2021 A* conf
Minimum Cuts in Directed Graphs via Partial Sparsification.
FOCS
Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud
2021 J jnl
Minimum Cuts in Directed Graphs via Partial Sparsification.
CoRR
Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak
2021 J jnl
Minimum Cuts in Directed Graphs via √n Max-Flows.
CoRR
Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak
2021 A* conf
Minimum cost flows, MDPs, and ℓ
STOC
Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
2021 J jnl
Near-optimal Distributed Triangle Enumeration via Expander Decompositions.
J. ACM
Yi-Jun Chang, Seth Pettie, Thatchaphol Saranurak, Hengjie Zhang
2021 A* conf
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms.
SODA
Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan
2021 J jnl
Vertex Connectivity in Poly-logarithmic Max-flows.
CoRR
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2021 A* conf
Vertex connectivity in poly-logarithmic max-flows.
STOC
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2020 A* conf
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond.
FOCS
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
2020 J jnl
A Simple Deterministic Algorithm for Edge Connectivity.
CoRR
Thatchaphol Saranurak
2020 A* conf
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs.
FOCS
Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
2020 J jnl
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs.
CoRR
Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
2020 A* conf
Coarse-Grained Complexity for Dynamic Algorithms.
SODA
Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
2020 J jnl
Coarse-Grained Complexity for Dynamic Algorithms.
CoRR
Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
2020 A* conf
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms.
SODA
Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2020 J jnl
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition.
CoRR
Julia Chuzhoy, Thatchaphol Saranurak
2020 A* conf
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing.
FOCS
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
2020 J jnl
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing.
CoRR
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
2020 A* conf
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization.
FOCS
Yi-Jun Chang, Thatchaphol Saranurak
2020 J jnl
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization.
CoRR
Yi-Jun Chang, Thatchaphol Saranurak
2020 A* conf
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.
FOCS
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
2020 J jnl
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.
CoRR
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
2020 J jnl
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary.
CoRR
Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun
2020 — conf
Pinning down the Strong Wilber 1 Bound for Binary Search Trees.
APPROX-RANDOM
Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak
2020 J jnl
Smooth Heaps and a Dual View of Self-Adjusting Data Structures.
SIAM J. Comput.
László Kozma, Thatchaphol Saranurak
2020 J jnl
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms.
CoRR
Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan
2019 J jnl
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond.
CoRR
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
2019 J jnl
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme.
CoRR
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2019 A* conf
Breaking quadratic time for small vertex connectivity and an approximation scheme.
STOC
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2019 J jnl
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms.
CoRR
Sebastian Forster, Danupon Nanongkai, Thatchaphol Saranurak, Liu Yang, Sorrachai Yingchareonthawornchai
2019 J jnl
Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries.
CoRR
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2019 J jnl
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex.
CoRR
Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2019 J jnl
Distributed Edge Connectivity in Sublinear Time.
CoRR
Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
2019 A* conf
Distributed edge connectivity in sublinear time.
STOC
Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
2019 A* conf
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds.
FOCS
Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak
2019 J jnl
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds.
CoRR
Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak
2019 A* conf
Expander Decomposition and Pruning: Faster, Stronger, and Simpler.
SODA
Thatchaphol Saranurak, Di Wang
2019 A* conf
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration.
PODC
Yi-Jun Chang, Thatchaphol Saranurak
2019 J jnl
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration.
CoRR
Yi-Jun Chang, Thatchaphol Saranurak
2019 J jnl
Pinning Down the Strong Wilber 1 Bound for Binary Search Trees.
CoRR
Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak
2019 A* conf
Sensitive Distance and Reachability Oracles for Large Batch Updates.
FOCS
Jan van den Brand, Thatchaphol Saranurak
2019 J jnl
Sensitive Distance and Reachability Oracles for Large Batch Updates.
CoRR
Jan van den Brand, Thatchaphol Saranurak
2018 — —
Dynamic algorithms: new worst-case and instance-optimal bounds via new connections.
Thatchaphol Saranurak
2018 J jnl
Expander Decomposition and Pruning: Faster, Stronger, and Simpler.
CoRR
Thatchaphol Saranurak, Di Wang
2018 B conf
Multi-Finger Binary Search Trees.
ISAAC
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2018 J jnl
Multi-finger binary search trees.
CoRR
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2018 A* conf
Smooth heaps and a dual view of self-adjusting data structures.
STOC
László Kozma, Thatchaphol Saranurak
2018 J jnl
Smooth heaps and a dual view of self-adjusting data structures.
CoRR
László Kozma, Thatchaphol Saranurak
2017 J jnl
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n
CoRR
Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak
2017 A* conf
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n
FOCS
Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak
2017 A* conf
Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time.
FOCS
Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen
2017 J jnl
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time.
CoRR
Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen
2017 A* conf
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n
STOC
Danupon Nanongkai, Thatchaphol Saranurak
2016 J jnl
Binary search trees and rectangulations.
CoRR
László Kozma, Thatchaphol Saranurak
2016 J jnl
Dynamic Spanning Forest with Worst-Case Update Time: Adaptive, Las Vegas, and $O(n^{1/2-ε})$-Time.
CoRR
Danupon Nanongkai, Thatchaphol Saranurak
2016 J jnl
The landscape of bounds for binary search trees.
CoRR
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015 J jnl
A Global Geometric View of Splaying.
CoRR
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015 B conf
Greedy Is an Almost Optimal Deque.
WADS
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015 J jnl
Greedy Is an Almost Optimal Deque.
CoRR
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015 A* conf
Pattern-Avoiding Access in Binary Search Trees.
FOCS
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015 J jnl
Pattern-avoiding access in binary search trees.
CoRR
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015 A conf
Self-Adjusting Binary Search Trees: What Makes Them Tick?
ESA
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015 A* conf
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.
STOC
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak
2015 J jnl
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.
CoRR
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak
2013 C conf
Finding the colors of the secret in Mastermind.
CTW
Thatchaphol Saranurak
2012 J jnl
Subtraction makes computing integers faster
CoRR
Thatchaphol Saranurak, Gorav Jindal