I work on the algorithmic side of theoretical computer science, specifically in the fields of approximation algorithms, graph algorithms, parameterized algorithms, and distributed computing. On the mathematics side, my main interests are probabilistic and extremal combinatorics, and structural graph theory.
I am a second-year PhD student in the School of Computer Science at Carnegie Mellon University and am part of the Algorithms and Combinatorial Optimization (ACO) group
. I am fortunate to be co-advised by Prof. Anupam Gupta
and Prof. Bernhard Haeupler
. I also obtained my bachelor's degree at CMU's SCS, with a double major in computer science and math.