Michael Zlatin
Bio
Michael (Mik) Zlatin is an Assistant Professor of Computer Science at Pomona College in Claremont, California, where he joined the faculty in 2025. He earned his Ph.D. in Algorithms, Combinatorics and Optimization from Carnegie Mellon University's Tepper School of Business, where he was advised by Gérard Cornuéjols and served as a teaching assistant for courses including Integer Programming and Design and Analysis of Data Structures and Algorithms. His dissertation, "Polyhedral and Algorithmic Methods in Network Connectivity," received the Gerald L. Thompson Doctoral Dissertation Award in Management Science. After completing his PhD in 2024, he held postdoctoral fellowships at Carnegie Mellon University (hosted by R. Ravi) and the Weizmann Institute of Science (hosted by Robi Krauthgamer). His research focuses on network connectivity, approximation algorithms, polyhedral methods, and combinatorial optimization, with notable publications at venues including SODA, FOCS, and ESA; his work on Steiner connectivity augmentation won the Best Student-Paper Award at ESA 2024. He received a grant from the Long-Term Future Fund during his PhD to buy out teaching assistant duties, enabling more focused research time.
Links
- Personal Website
- https://mzlatin.github.io/
- Twitter / X
- -
- LessWrong
- -
Grants
from Long-Term Future Fund
Discussion
Sign in to join the discussion.
No comments yet. Be the first to share your thoughts.
Details
- Last Updated
- Mar 22, 2026, 11:36 PM UTC
- Created
- Mar 20, 2026, 2:55 AM UTC