Subtraction makes computing integers faster - Thatchaphol Saranurak; Gorav Jindal (CoRR, 2012)

Finding the colors of the secret in Mastermind. - Thatchaphol Saranurak (CTW, 2013)

Self-Adjusting Binary Search Trees: What Makes Them Tick? - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (ESA, 2015)

Pattern-Avoiding Access in Binary Search Trees. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (FOCS, 2015)

Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai; Thatchaphol Saranurak (STOC, 2015)

Greedy Is an Almost Optimal Deque. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (WADS, 2015)

A Global Geometric View of Splaying. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (CoRR, 2015)

Binary search trees and rectangulations. - László Kozma 002; Thatchaphol Saranurak (CoRR, 2016)

The landscape of bounds for binary search trees. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (CoRR, 2016)

Dynamic Spanning Forest with Worst-Case Update Time: Adaptive, Las Vegas, and $O(n^{1/2-ε})$-Time. - Danupon Nanongkai; Thatchaphol Saranurak (CoRR, 2016)

Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds. - Chien-Chung Huang 001; Danupon Nanongkai; Thatchaphol Saranurak (FOCS, 2017)

Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. - Danupon Nanongkai; Thatchaphol Saranurak; Christian Wulff-Nilsen (FOCS, 2017)

Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time. - Danupon Nanongkai; Thatchaphol Saranurak (STOC, 2017)

Multi-Finger Binary Search Trees. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (ISAAC, 2018)

Dynamic algorithms: new worst-case and instance-optimal bounds via new connections. - Thatchaphol Saranurak (2018)

Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. - Jan van den Brand; Danupon Nanongkai; Thatchaphol Saranurak (FOCS, 2019)

Sensitive Distance and Reachability Oracles for Large Batch Updates. - Jan van den Brand; Thatchaphol Saranurak (FOCS, 2019)

Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. - Yi-Jun Chang; Thatchaphol Saranurak (PODC, 2019)

Expander Decomposition and Pruning: Faster, Stronger, and Simpler. - Thatchaphol Saranurak; Di Wang 005 (SODA, 2019)

Distributed edge connectivity in sublinear time. - Mohit Daga; Monika Henzinger; Danupon Nanongkai; Thatchaphol Saranurak (STOC, 2019)

Breaking quadratic time for small vertex connectivity and an approximation scheme. - Danupon Nanongkai; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (STOC, 2019)

Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries. - Danupon Nanongkai; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (CoRR, 2019)

Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. - Yu Gao 001; Jason Li 006; Danupon Nanongkai; Richard Peng; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (CoRR, 2019)

Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. - Aaron Bernstein; Maximilian Probst Gutenberg; Thatchaphol Saranurak (FOCS, 2020)

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 002; Di Wang 005 (FOCS, 2020)

Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. - Yi-Jun Chang; Thatchaphol Saranurak (FOCS, 2020)

Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. - Li Chen 028; Gramoz Goranci; Monika Henzinger; Richard Peng; Thatchaphol Saranurak (FOCS, 2020)

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. - Julia Chuzhoy; Yu Gao 001; Jason Li 006; Danupon Nanongkai; Richard Peng; Thatchaphol Saranurak (FOCS, 2020)

Coarse-Grained Complexity for Dynamic Algorithms. - Sayan Bhattacharya; Danupon Nanongkai; Thatchaphol Saranurak (SODA, 2020)

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 (SODA, 2020)

Smooth Heaps and a Dual View of Self-Adjusting Data Structures. - László Kozma 002; Thatchaphol Saranurak (SIAM J. Comput., 2020)

A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. - Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak (FOCS, 2021)

Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. - Aaron Bernstein; Maximilian Probst Gutenberg; Thatchaphol Saranurak (FOCS, 2021)

Minimum Cuts in Directed Graphs via Partial Sparsification. - Ruoxu Cen; Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Kent Quanrud (FOCS, 2021)

Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. - Julia Chuzhoy; Thatchaphol Saranurak (SODA, 2021)

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. - Gramoz Goranci; Harald Räcke; Thatchaphol Saranurak; Zihan Tan (SODA, 2021)

A Simple Deterministic Algorithm for Edge Connectivity. - Thatchaphol Saranurak (SOSA, 2021)

Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances. - Jan van den Brand; Yin Tat Lee; Yang P. Liu; Thatchaphol Saranurak; Aaron Sidford; Zhao Song 002; Di Wang 005 (STOC, 2021)

Minimum Cuts in Directed Graphs via √n Max-Flows. - Ruoxu Cen; Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak (CoRR, 2021)

Deterministic Weighted Expander Decomposition in Almost-linear Time. - Jason Li 006; Thatchaphol Saranurak (CoRR, 2021)

Fast Algorithms for Hop-Constrained Flows and Moving Cuts. - Bernhard Haeupler; D. Ellis Hershkowitz; Thatchaphol Saranurak (CoRR, 2021)

Gomory-Hu Tree in Subcubic Time. - Amir Abboud; Robert Krauthgamer; Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak; Ohad Trabelsi (CoRR, 2021)

Near-optimal Distributed Triangle Enumeration via Expander Decompositions. - Yi-Jun Chang; Seth Pettie; Thatchaphol Saranurak; Hengjie Zhang (J. ACM, 2021)

Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. - Sayan Bhattacharya; Thatchaphol Saranurak; Pattara Sukprasert (ESA, 2022)

Vertex Sparsifiers for Hyperedge Connectivity. - Han Jiang 002; Shang-En Huang; Thatchaphol Saranurak; Tian Zhang (ESA, 2022)

Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. - Amir Abboud; Robert Krauthgamer; Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak; Ohad Trabelsi (FOCS, 2022)

Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. - Yaowei Long; Thatchaphol Saranurak (FOCS, 2022)

Deterministic Small Vertex Connectivity in Almost Linear Time. - Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (FOCS, 2022)

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 001 (ICALP, 2022)

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. - Parinya Chalermsook; Chien-Chung Huang 001; Danupon Nanongkai; Thatchaphol Saranurak; Pattara Sukprasert; Sorrachai Yingchareonthawornchai (ICALP, 2022)

Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. - Amos Beimel; Haim Kaplan; Yishay Mansour; Kobbi Nissim; Thatchaphol Saranurak; Uri Stemmer (STOC, 2022)

Optimal vertex connectivity oracles. - Seth Pettie; Thatchaphol Saranurak; Longhui Yin (STOC, 2022)

Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time. - Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak (CoRR, 2022)

Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. - Thatchaphol Saranurak; Wuwei Yuan (ESA, 2023)

All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. - Amir Abboud; Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak (FOCS, 2023)

Chasing Positive Bodies. - Sayan Bhattacharya; Niv Buchbinder; Roie Levin; Thatchaphol Saranurak (FOCS, 2023)

Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. - Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak (FOCS, 2023)

Near-Linear Time Approximations for Cut Problems via Fair Cuts. - Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak (SODA, 2023)

Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. - Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak (SODA, 2023)

Fully Dynamic Exact Edge Connectivity in Sublinear Time. - Gramoz Goranci; Monika Henzinger; Danupon Nanongkai; Thatchaphol Saranurak; Mikkel Thorup; Christian Wulff-Nilsen (SODA, 2023)

Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction. - Chaitanya Nalam; Thatchaphol Saranurak (SODA, 2023)

Sublinear Algorithms for (1.5+ε)-Approximate Matching. - Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak (STOC, 2023)

Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. - Bernhard Haeupler; D. Ellis Hershkowitz; Thatchaphol Saranurak (STOC, 2023)

Tight Conditional Lower Bounds for Vertex Connectivity Problems. - Zhiyi Huang; Yaowei Long; Thatchaphol Saranurak; Benyu Wang (STOC, 2023)

Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction. - Chaitanya Nalam; Thatchaphol Saranurak (CoRR, 2023)

Deterministic k-Vertex Connectivity in k2 Max-flows. - Chaitanya Nalam; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (CoRR, 2023)

Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). - Jason Li 006; Debmalya Panigrahi; Laura Sanità; Thatchaphol Saranurak (Dagstuhl Reports, 2023)

Pinning Down the Strong Wilber-1 Bound for Binary Search Trees. - Parinya Chalermsook; Julia Chuzhoy; Thatchaphol Saranurak (Theory Comput., 2023)

Maximum Flow by Augmenting Paths in n2+o(1) Time. - Aaron Bernstein; Joakim Blikstad; Thatchaphol Saranurak; Ta-Wei Tu (FOCS, 2024)

Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time. - Bernhard Haeupler; Yaowei Long; Thatchaphol Saranurak (FOCS, 2024)

Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time. - Kevin Hua; Daniel Li; Jaewoo Park; Thatchaphol Saranurak (ICALP, 2024)

Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. - Zhongtian He; Shang-En Huang; Thatchaphol Saranurak (SODA, 2024)

Cactus Representation of Minimum Cuts: Derandomize and Speed up. - Zhongtian He; Shang-En Huang; Thatchaphol Saranurak (SODA, 2024)

Approximating Small Sparse Cuts. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Thatchaphol Saranurak (STOC, 2024)

Low-Step Multi-commodity Flow Emulators. - Bernhard Haeupler; D. Ellis Hershkowitz; Jason Li 006; Antti Roeyskoe; Thatchaphol Saranurak (STOC, 2024)

Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471). - Keren Censor-Hillel; Yasamin Nazari; Eva Rotenberg; Thatchaphol Saranurak; Martín Costa (Dagstuhl Reports, 2024)

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. - Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak; David Wajc (J. ACM, 2024)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Thatchaphol Saranurak (ICALP, 2025)

Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method. - Deeksha Adil; Thatchaphol Saranurak (ICALP, 2025)

Unbreakable Decomposition in Close-to-Linear Time. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Yaowei Long; Thatchaphol Saranurak (SODA, 2025)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries. - Aditya Anand 001; Thatchaphol Saranurak; Yunfan Wang (SODA, 2025)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal. - Daoyuan Chen; Simon Meierhans; Maximilian Probst Gutenberg; Thatchaphol Saranurak (SODA, 2025)

Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies. - Yaowei Long; Seth Pettie; Thatchaphol Saranurak (SODA, 2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time. - Aaron Bernstein; Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak (STOC, 2025)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness. - Yonggang Jiang; Chaitanya Nalam; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (STOC, 2025)

Local Sherman's Algorithm for Multi-commodity Flow. - Jason Li 006; Thatchaphol Saranurak (CoRR, 2025)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts. - Bernhard Haeupler; Yaowei Long; Thatchaphol Saranurak; Shengzhe Wang (CoRR, 2025)

Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time. - Simon Meierhans; Maximilian Probst Gutenberg; Thatchaphol Saranurak (CoRR, 2025)

Deterministic Almost-Linear-Time Gomory-Hu Trees. - Amir Abboud; Rasmus Kyng; Jason Li 006; Debmalya Panigrahi; Maximilian Probst Gutenberg; Thatchaphol Saranurak; Weixuan Yuan; Wuwei Yuan (CoRR, 2025)

Vertex Connectivity in Poly-logarithmic Max-Flows. - Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (J. ACM, 2025)