Meet ApplyKite Twin, the application assistant that learns with you

Meet your Twin, it learns with you

Your Twin learns with you

Launch week codes:30% off annual Pro20% off monthly Pro

Ends in00h00m00s

Thatchaphol Saranurak

Assistant Professor

University of Michigan

United States

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Professors in United States

About

Dr. Thatchaphol Saranurak is an Assistant Professor at the University of Michigan in the United States. His research focuses on algorithmic graph theory and data structures, as evidenced by his recent publications on topics such as vertex connectivity and dynamic matching. His work includes exploring efficient algorithms for near-optimal distributed computations and self-adjusting data structures.

Articles (22)

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2024

Year:

2021

Year:

2020

Collaborators (6)

László Kozma

Freie Universität Berlin

GERMANY

View details

Sorrachai Yingchareonthawornchai

ETH Zürich

SWITZERLAND

View details

Bernhard Haeupler

Faculty & Group Leader "Theory and Algorithms"

sofia university “st. kliment ohridski”

BULGARIA

View details

Debmalya Panigrahi

Duke University

UNITED STATES

View details

Danupon Na Nongkai

KTH Royal Institute of Technology

SWEDEN

View details

Matija Bucic

Assistant Professor

Princeton University

UNITED STATES

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Thatchaphol Saranurak

Research Interests

Make your next move.

Explore related searches

About

Articles (22)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching

A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures

DAG Projections: Reducing Distance and Flow Problems to DAGs

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers

Reviving Thorup’s Shortcut Conjecture

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition

Expander Decomposition with Almost Optimal Overhead

Parallel Reachability and Shortest Paths on Non-Sparse Digraphs: Near-Linear Work and Sub-Square-Root Depth

Space Complexity of Vertex Connectivity Oracles

Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time

Reducing Shortcut and Hopset Constructions to Shallow Graphs

Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems

Vertex Connectivity in Poly-logarithmic Max-Flows

Decremental (1 + ϵ)-Approximate Maximum Eigenvector: Dynamic Power Method

Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs

Deterministic Almost-Linear-Time Gomory-Hu Trees

Finding Small Dijoins in Transitive Closure Time

Near-Optimal Fault-Tolerant Strong Connectivity Preservers

Parallel (1+ϵ)-Approximate Multi-Commodity Min-Cost Flow in Almost Optimal Depth and Work

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time

Near-optimal Distributed Triangle Enumeration via Expander Decompositions

Smooth Heaps and a Dual View of Self-Adjusting Data Structures

Collaborators (6)

László Kozma

Sorrachai Yingchareonthawornchai

Bernhard Haeupler

Debmalya Panigrahi

Danupon Na Nongkai

Matija Bucic

Make your next move.