About me

Hello! I’m Zhimeng, a PhD student at Georgia Institute of Technology, where I’m fortunate to be advised by Helen Xu. My research interests are broadly in algorithms and data structures. I currently work on cache-friendly and parallel algorithms, and I have previously worked on problems in computational geometry, temporal graph algorithms, and online algorithms.

I received my bachelor’s degree in Computer Science and Mathematics from Hong Kong University of Science and Technology, where I was lucky to be advised by Siu-Wing Cheng for my final year thesis. I spent an exchange semester at UIUC in Spring 2023, during which I worked with wonderful mentor Sariel Har-Peled. Prior to these, I interned at Google during the summers of 2021, 2022, and 2023.

Feel free to reach me at zhimeng [at] gatech [dot] edu.

• Zhimeng Gao, Evangelia Gergatsouli, Kalen Patton, Sahil Singla.
  Online Combinatorial Optimization with Graphical Dependencies.
  In Proceedings of ACM Symposium on Theory of Computing (STOC’26).

• Zhimeng Gao, Sariel Har-Peled.
  Near Optimal Locality Sensitive Orderings in Euclidean Space.
  In Proceedings of 2024 International Symposium on Computational Geometry (SoCG’24).
  Full version in Journal of Computational Geometry (JoCG), 2025.

• Siu-Wing Cheng, Zhimeng Gao. Approximate Shortest Journeys in Compact Directed Temporal Graphs. \