I am currently a third-year Ph.D. student in Computer Science and Engineering at the University of Michigan and I am very fortunate to be advised by Thatchaphol Saranurak. I have a broad interest in theoretical computer science, especially in graph algorithms and data structures.
Prior to that, I was an undergraduate student at Institute for Interdisciplinary Information Sciences, Tsinghua University. During the spring and summer of 2020, I also made a wonderful research visit at UMich, advised by Seth Pettie.
In the fall of 2023, I was a visiting student at the Simons Institute for the Data Structures and Optimization for Fast Algorithms program.


Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time [arxiv]
Bernhard Haeupler, Yaowei Long and Thatchaphol Saranurak

Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity [arxiv]
Yaowei Long and Yunfan Wang

Tight Conditional Lower Bounds for Vertex Connectivity Problems [arxiv]
Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak and Benyu Wang
To appear in STOC 2023

Almost Optimal Exact Distance Oracles for Planar Graphs [doi][pdf]
Panagiotis Charalampopoulos, PaweĊ‚ Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen

Near-Optimal Deterministic Vertex-Failure Connectivity Oracles [arxiv]
Yaowei Long and Thatchaphol Saranurak
FOCS 2022

Planar Distance Oracles with Better Time-Space Tradeoffs [arxiv]
Yaowei Long and Seth Pettie
SODA 2021


Graduate Student Instructor (TA) to Prof. Thatchaphol Saranurak
Design and Analysis of Algorithms. (EECS 586)
2023 Winter