Thatchaphol Saranurak

1.1k total citations
28 papers, 213 citations indexed

About

Thatchaphol Saranurak is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Thatchaphol Saranurak has authored 28 papers receiving a total of 213 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 19 papers in Computer Networks and Communications and 12 papers in Artificial Intelligence. Recurrent topics in Thatchaphol Saranurak's work include Complexity and Algorithms in Graphs (23 papers), Optimization and Search Problems (14 papers) and Advanced Graph Theory Research (10 papers). Thatchaphol Saranurak is often cited by papers focused on Complexity and Algorithms in Graphs (23 papers), Optimization and Search Problems (14 papers) and Advanced Graph Theory Research (10 papers). Thatchaphol Saranurak collaborates with scholars based in United States, Sweden and Israel. Thatchaphol Saranurak's co-authors include Danupon Nanongkai, Yi‐Jun Chang, Di Wang, Aaron Sidford, Zhao Song, Jan van den Brand, Jason Li, Debmalya Panigrahi, Richard Peng and Sayan Bhattacharya and has published in prestigious journals such as Journal of the ACM, Research at the University of Copenhagen (University of Copenhagen) and Symposium on Discrete Algorithms.

In The Last Decade

Thatchaphol Saranurak

25 papers receiving 210 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Thatchaphol Saranurak United States 10 170 100 80 27 25 28 213
Rishi Saket United States 9 183 1.1× 84 0.8× 89 1.1× 39 1.4× 13 0.5× 29 272
Yang P. Liu United States 7 101 0.6× 58 0.6× 49 0.6× 18 0.7× 12 0.5× 20 152
Arnab Bhattacharyya United States 9 160 0.9× 56 0.6× 130 1.6× 16 0.6× 7 0.3× 34 220
Shubhangi Saraf United States 10 197 1.2× 46 0.5× 194 2.4× 25 0.9× 8 0.3× 42 295
Virginia Vassilevska United States 8 120 0.7× 78 0.8× 46 0.6× 12 0.4× 6 0.2× 13 186
Kevin Matulef United States 6 146 0.9× 48 0.5× 122 1.5× 9 0.3× 12 0.5× 11 196
Jan van den Brand United States 6 97 0.6× 56 0.6× 51 0.6× 15 0.6× 12 0.5× 12 129
Stanislav Živný United Kingdom 10 254 1.5× 182 1.8× 67 0.8× 29 1.1× 5 0.2× 53 294
Euiwoong Lee United States 6 70 0.4× 50 0.5× 19 0.2× 12 0.4× 5 0.2× 42 122
Hervé Daudé France 9 98 0.6× 106 1.1× 48 0.6× 5 0.2× 11 0.4× 13 172

Countries citing papers authored by Thatchaphol Saranurak

Since Specialization
Citations

This map shows the geographic impact of Thatchaphol Saranurak's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Thatchaphol Saranurak with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thatchaphol Saranurak more than expected).

Fields of papers citing papers by Thatchaphol Saranurak

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thatchaphol Saranurak. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Thatchaphol Saranurak. The network helps show where Thatchaphol Saranurak may publish in the future.

Co-authorship network of co-authors of Thatchaphol Saranurak

This figure shows the co-authorship network connecting the top 25 collaborators of Thatchaphol Saranurak. A scholar is included among the top collaborators of Thatchaphol Saranurak based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Thatchaphol Saranurak. Thatchaphol Saranurak is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bhattacharya, Sayan, et al.. (2024). Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. Journal of the ACM. 71(5). 1–32. 1 indexed citations
2.
Bernstein, Aaron, et al.. (2024). Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time. 2056–2077.
3.
4.
Abboud, Amir, Jason Li, Debmalya Panigrahi, & Thatchaphol Saranurak. (2023). All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. 2204–2212. 4 indexed citations
5.
Huang, Zhiyi, et al.. (2023). Tight Conditional Lower Bounds for Vertex Connectivity Problems. 1384–1395. 2 indexed citations
6.
Bhattacharya, Sayan, et al.. (2023). Chasing Positive Bodies. Warwick Research Archive Portal (University of Warwick). 1694–1714. 1 indexed citations
7.
Bhattacharya, Sayan, et al.. (2023). Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. Warwick Research Archive Portal (University of Warwick). 1563–1588. 7 indexed citations
8.
Bernstein, Aaron, Jan van den Brand, Maximilian Probst Gutenberg, et al.. (2022). Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
9.
Saranurak, Thatchaphol, et al.. (2022). Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. 6. 1002–1010. 4 indexed citations
10.
Pettie, Seth, et al.. (2022). Optimal vertex connectivity oracles. 151–161. 4 indexed citations
11.
Brand, Jan van den, Yin Tat Lee, Yang P. Liu, et al.. (2021). Minimum cost flows, MDPs, and ℓ 1 -regression in nearly linear time for dense instances. 859–869. 23 indexed citations
12.
Chang, Yi‐Jun, et al.. (2021). Near-optimal Distributed Triangle Enumeration via Expander Decompositions. Journal of the ACM. 68(3). 1–36. 10 indexed citations
13.
Chen, Li, et al.. (2020). Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. 1135–1146. 12 indexed citations
14.
Brand, Jan van den, Danupon Nanongkai, Richard Peng, et al.. (2020). Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. 919–930. 30 indexed citations
15.
Chang, Yi‐Jun & Thatchaphol Saranurak. (2020). Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. 377–388. 12 indexed citations
16.
Saranurak, Thatchaphol & Di Wang. (2019). Expander decomposition and pruning: faster, stronger, and simpler. Symposium on Discrete Algorithms. 2616–2635. 5 indexed citations
17.
Chang, Yi‐Jun & Thatchaphol Saranurak. (2019). Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. 66–73. 10 indexed citations
18.
Chalermsook, Parinya, Mayank Goswami, László Kozma, Kurt Mehlhorn, & Thatchaphol Saranurak. (2018). Multi-Finger Binary Search Trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1–26. 1 indexed citations
19.
Huang, Chien‐Chung, Danupon Nanongkai, & Thatchaphol Saranurak. (2017). Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n^{5/4}) Rounds. 168–179. 10 indexed citations
20.
Chalermsook, Parinya, Mayank Goswami, László Kozma, Kurt Mehlhorn, & Thatchaphol Saranurak. (2015). Pattern-Avoiding Access in Binary Search Trees. 410–423. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Rishi Saket Breakdown of academic impact, for papers by Yang P. Liu Breakdown of academic impact, for papers by Arnab Bhattacharyya Breakdown of academic impact, for papers by Shubhangi Saraf Breakdown of academic impact, for papers by Virginia Vassilevska Breakdown of academic impact, for papers by Kevin Matulef Breakdown of academic impact, for papers by Jan van den Brand Breakdown of academic impact, for papers by Stanislav Živný Breakdown of academic impact, for papers by Euiwoong Lee Breakdown of academic impact, for papers by Hervé Daudé
Rankless by CCL
2026