George Zhaoqi Li
About Me
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'm currently interested in graph algorithms, approximation algorithms, and differential privacy.
I'm 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.
Selected Work
Near-Optimal Differentially Private k-Core Decomposition [arXiv] [video (50 min)]
with Laxman Dhulipala and Quanquan LiuConcentration of Submodular Functions and Read-k Families Under Negative Dependence [arXiv]
with Sharmila Duppala, Juan Luque, Aravind Srinivasan, and Renata Valieva
Innovations in Theoretical Computer Science Conference (ITCS), 2025.Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling [arXiv]
with Sepehr Assadi, Vikram Kher, and Ariel Schvartzman
Conference on Economics and Computation (EC), 2023.Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response [arXiv] [video (10 min)]
with Ann Li, Madhav Marathe, Aravind Srinivasan, Leonidas Tsepenekas, and Anil Vullikanti
International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2022.
Best Student Paper Award