Thatchaphol Saranurak is an Assistant Professor in the Computer Science and Engineering Division at the University of Michigan, College of Engineering. He holds a Ph.D. in Computer Science from KTH Royal Institute of Technology (2018), advised by Danupon Nanongkai, and was previously a Research Assistant Professor at the Toyota Technological Institute at Chicago (2018–2020). His research lies at the intersection of theoretical computer science and algorithm design, with primary interests in fast graph algorithms , dynamic algorithms , robust algorithms against adaptive adversaries , and combinatorial optimization . His work has significantly advanced the state-of-the-art in areas such as maximum flow (Gomory-Hu trees), vertex and edge connectivity, dynamic matching, expander decompositions, and distributed graph algorithms. His recent publications (2023–2025) reveal a strong trend toward deterministic, near-linear time algorithms for fundamental graph problems, often leveraging expander hierarchies and dynamic sparsification techniques . He has made breakthroughs in dynamic matching, connectivity oracles, and multi-commodity flow, frequently publishing in top venues like FOCS, STOC, and SODA. He has received several prestigious honors, including: Presburger Award 2023 NSF CAREER Award Sloan Research Fellowship His advising and grant activities are supported by major funding such as the NSF CAREER Award and Sloan Fellowship, and he actively mentors and collaborates with a large network of co-authors. He is also involved in organizing academic events, such as the Dagstuhl Seminar on Graph Algorithms. He teaches courses such as Expander and Graph Algorithms and maintains an active research group focused on pushing the boundaries of algorithmic efficiency and robustness.








