I started as a PhD student at CMU in Fall 2024, advised by Jason Li. Previously, I completed my undergraduate at the University of Maryland, where I was advised by Aravind Srinivasan. I am primarily interested in graph algorithms, approximation algorithms, and differential privacy.
I am also thankful for a number of mentors who have supported my career, including: Laxman Dhulipala, Ariel Schvartzman, Zihan Tan, Jalaj Upadhyay, and Anil Vullikanti.
You can reach me by email at gzli929 [at] umd [dot] edu.
Shortcutting for Negative-Weight Shortest Path [arXiv]
with Jason Li, Satish Rao, and Junkai Zhang.
Improved Directed Expander Decompositions [arXiv]
with Henry Fleischmann and Jason Li.
Fast Algorithms for Graph Arboricity and Related Problems [arXiv]
with Ruoxu Cen, Henry Fleischmann, Jason Li, and Debmalya Panigrahi
Symposium on Foundations of Computer Science (FOCS), 2025.
Paths and Intersections: Exact Emulators for Planar Graphs [arXiv]
with Zihan Tan and Tianyi Zhang
Symposium on Foundations of Computer Science (FOCS), 2025.