Scholar
George Zhaoqi Li
Google Scholar ID: K4iEKwMAAAAJ
Carnegie Mellon University
Citations & Impact
Citations
36
H-index
3
i10-index
0
Publications
14
Co-authors
28
list available
Contact
Publications
Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
- Published multiple papers including 'Improved Directed Expander Decompositions' (with Henry Fleischmann and Jason Li), 'Fast Algorithms for Graph Arboricity and Related Problems' (with Ruoxu Cen, Henry Fleischmann, Jason Li, and Debmalya Panigrahi, FOCS 2025), 'Paths and Intersections: Exact Emulators for Planar Graphs' (with Zihan Tan and Tianyi Zhang, FOCS 2025), 'On Differential Privacy for Adaptively Solving Search Problems via Sketching' (with Shiyuan Feng, Ying Feng, Zhao Song, David P. Woodruff, and Lichen Zhang, ICML 2025, selected for oral presentation, top 1% of submissions), 'Concentration of Submodular Functions and Read-k Families Under Negative Dependence' (with Sharmila Duppala, Juan Luque, Aravind Srinivasan, and Renata Valieva, ITCS 2025).
Research Experience
- No specific work experience information provided.
Education
- Started as a PhD student at CMU in Fall 2024, advised by Jason Li; Undergraduate from the University of Maryland, advised by Aravind Srinivasan.
Background
- Research Interests: Graph algorithms, approximation algorithms, and differential privacy. Completed undergraduate studies at the University of Maryland, advised by Aravind Srinivasan.
Miscellany
- Thankful for the support of several mentors including Laxman Dhulipala, Ariel Schvartzman, Zihan Tan, Jalaj Upadhyay, and Anil Vullikanti.
