Thatchaphol Saranurak

Eight papers by CSE researchers at STOC 2025

CSE authors are presenting new research on topics related to theoretical computer science, including coding theory, approximation algorithms, and subgraph matching.

Thatchaphol Saranurak named 2025 Sloan Research Fellow

The fellowship recognizes early-career researchers who have shown exceptional creativity, innovation, and research accomplishments.

Sixteen papers by CSE researchers at SODA 2025

CSE authors are presenting new research on topics in the area of discrete algorithms ranging from graph theory and optimization to computational geometry and data structures.

Thatchaphol Saranurak named Morris Wellman Professor

Saranurak’s research focuses on making computer algorithms faster, more efficient, and more robust, as well as solving complex problems using continuous optimization techniques.

Six papers by CSE researchers at STOC 2024

New papers presented by CSE researchers at the conference address a number of topics in theoretical computer science, including dense linear systems, multi-commodity flows, correlation clustering, and more.

Seven papers by CSE researchers presented at FOCS 2023

The papers authored by CSE researchers appearing at the conference cover a range of topics across theoretical computer science.

Five papers by CSE researchers presented at STOC 2023

Three CSE faculty have authored papers being presented at the conference on topics ranging from length-constrained computing flows to graph connectivity problems.

Thatchaphol Saranurak recognized with 2023 Presburger Award

The award recognizes the outstanding contributions of a young scientist in the field of theoretical computer science.

Eight CSE faculty earn NSF CAREER Awards

The NSF Faculty Early Career Development (CAREER) Program is the most prestigious award in support of early-career faculty who have the potential to serve as academic role models in research and education.

Thatchaphol Saranurak earns NSF CAREER Award to study tackle problems in dynamic graphing algorithms

Saranurak will study the connections between these algorithms and a number of important open problems in graph theory, security, and optimization.

Major breakthrough in dynamic graph algorithms earns Best Paper

Thatchaphol Saranurak and collaborators were recognized at SODA '23 for their work that broke an approximation barrier in dynamic graph matching.

CSE theory researchers co-author seven papers at IEEE FOCS 2022

The papers represented work by seven U-M researchers at one of the leading theoretical computing conferences in the world.

CSE researchers present six papers at STOC 2022

The papers represented work by six U-M researchers at the leading general theoretical computing conference in the world.

Eleven new faculty hired in CSE in 2020