Thatchaphol Saranurak

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 121

Top Venues

Royal Institute of Technology, Stockholm, Sweden (PHD)

Education History

Royal Institute of Technology, Stockholm, Sweden

PHD

Publications

Kevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak
Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time. ICALP (2024)
Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak
Low-Step Multi-commodity Flow Emulators. STOC (2024)
Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
Approximating Small Sparse Cuts. CoRR (2024)
Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak
Low-Step Multi-Commodity Flow Emulators. CoRR (2024)
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. SODA (2024)
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
Cactus Representation of Minimum Cuts: Derandomize and Speed up. CoRR (2024)
Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu
Time. CoRR (2024)
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
Cactus Representation of Minimum Cuts: Derandomize and Speed up. SODA (2024)
Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
Approximating Small Sparse Cuts. STOC (2024)
Deeksha Adil, Thatchaphol Saranurak
Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method. CoRR (2024)
Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak
Worst-Case Update Time. CoRR (2024)
Kevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak
Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time. CoRR (2024)
Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak
Chasing Positive Bodies. CoRR (2023)
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
Sublinear Algorithms for (1.5+ε)-Approximate Matching. STOC (2023)
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. FOCS (2023)
Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang
Tight Conditional Lower Bounds for Vertex Connectivity Problems. STOC (2023)
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak
Near-Linear Time Approximations for Cut Problems via Fair Cuts. SODA (2023)
Thatchaphol Saranurak, Wuwei Yuan
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. ESA (2023)
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA (2023)
Thatchaphol Saranurak, Wuwei Yuan
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. CoRR (2023)
Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. STOC (2023)
Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. FOCS (2023)
Chaitanya Nalam, Thatchaphol Saranurak
Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction. CoRR (2023)
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. SODA (2023)
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR (2023)
Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak
Chasing Positive Bodies. FOCS (2023)
Jason Li, Debmalya Panigrahi, Laura Sanità, Thatchaphol Saranurak
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). Dagstuhl Reports 13 (10) (2023)
Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Max-flows. CoRR (2023)
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. SODA (2023)
Chaitanya Nalam, Thatchaphol Saranurak
-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction. SODA (2023)
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time. CoRR (2023)
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. CoRR (2023)
Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert
Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary. CoRR (2022)
Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang
Vertex Sparsifiers for Hyperedge Connectivity. CoRR (2022)
Seth Pettie, Thatchaphol Saranurak, Longhui Yin
Optimal Vertex Connectivity Oracles. CoRR (2022)
Yaowei Long, Thatchaphol Saranurak
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. FOCS (2022)
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. FOCS (2022)
Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang
Vertex Sparsifiers for Hyperedge Connectivity. ESA (2022)
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. CoRR (2022)
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. STOC (2022)
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. CoRR (2022)
Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. ICALP (2022)
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
Sublinear Algorithms for (1.5+ε)-Approximate Matching. CoRR (2022)
Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Deterministic Small Vertex Connectivity in Almost Linear Time. FOCS (2022)
Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang
Tight Conditional Lower Bounds for Vertex Connectivity Problems. CoRR (2022)
Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud
Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS (2022)
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. ICALP (2022)
Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Deterministic Small Vertex Connectivity in Almost Linear Time. CoRR (2022)
Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert
Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. ESA (2022)
Yaowei Long, Thatchaphol Saranurak
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. CoRR (2022)
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak
Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time. CoRR (2022)
Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. FOCS (2022)
Seth Pettie, Thatchaphol Saranurak, Longhui Yin
Optimal vertex connectivity oracles. STOC (2022)
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. CoRR (2022)
Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. FOCS (2022)
Julia Chuzhoy, Thatchaphol Saranurak
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. SODA (2021)
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. FOCS (2021)
Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. FOCS (2021)
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR (2021)
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Vertex Connectivity in Poly-logarithmic Max-flows. CoRR (2021)
Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi
Gomory-Hu Tree in Subcubic Time. CoRR (2021)
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. CoRR (2021)
Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. CoRR (2021)
Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
-Regression in Nearly Linear Time for Dense Instances. CoRR (2021)
Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
-regression in nearly linear time for dense instances. STOC (2021)
Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak
Fast Algorithms for Hop-Constrained Flows and Moving Cuts. CoRR (2021)
Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak
Minimum Cuts in Directed Graphs via Partial Sparsification. CoRR (2021)
Yi-Jun Chang, Seth Pettie, Thatchaphol Saranurak, Hengjie Zhang
Near-optimal Distributed Triangle Enumeration via Expander Decompositions. J. ACM 68 (3) (2021)
Jason Li, Thatchaphol Saranurak
Deterministic Weighted Expander Decomposition in Almost-linear Time. CoRR (2021)
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Vertex connectivity in poly-logarithmic max-flows. STOC (2021)
Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud
Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS (2021)
Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. SODA (2021)
Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak
Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR (2021)
Thatchaphol Saranurak
A Simple Deterministic Algorithm for Edge Connectivity. SOSA (2021)
Yi-Jun Chang, Thatchaphol Saranurak
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. FOCS (2020)
Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. CoRR (2020)
Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. CoRR (2020)
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. FOCS (2020)
Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. SODA (2020)
Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
Coarse-Grained Complexity for Dynamic Algorithms. CoRR (2020)
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. CoRR (2020)
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. FOCS (2020)
László Kozma, Thatchaphol Saranurak
Smooth Heaps and a Dual View of Self-Adjusting Data Structures. SIAM J. Comput. 49 (5) (2020)
Julia Chuzhoy, Thatchaphol Saranurak
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. CoRR (2020)
Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. FOCS (2020)
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. CoRR (2020)
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. FOCS (2020)
Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak
Pinning down the Strong Wilber 1 Bound for Binary Search Trees. APPROX-RANDOM (2020)
Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
Coarse-Grained Complexity for Dynamic Algorithms. SODA (2020)
Thatchaphol Saranurak
A Simple Deterministic Algorithm for Edge Connectivity. CoRR (2020)
Yi-Jun Chang, Thatchaphol Saranurak
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. CoRR (2020)
Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. CoRR (2020)
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme. CoRR (2019)
Jan van den Brand, Thatchaphol Saranurak
Sensitive Distance and Reachability Oracles for Large Batch Updates. CoRR (2019)
Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
Distributed edge connectivity in sublinear time. STOC (2019)
Thatchaphol Saranurak, Di Wang
Expander Decomposition and Pruning: Faster, Stronger, and Simpler. SODA (2019)
Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak
Pinning Down the Strong Wilber 1 Bound for Binary Search Trees. CoRR (2019)
Sebastian Forster, Danupon Nanongkai, Thatchaphol Saranurak, Liu Yang, Sorrachai Yingchareonthawornchai
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. CoRR (2019)
Yi-Jun Chang, Thatchaphol Saranurak
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. CoRR (2019)
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR (2019)

Thatchaphol Saranurak.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thatchaphol Saranurak