Research Interests

I am broadly interested in the power of parameterization in the context of algorithm design. In particular, I like understanding the mathematical structure of parameterized input instances, and how they can be exploited in the search for faster algorithms. Examples include, but are not limited to: 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.


Older Publications


Office: 7607 Gates Hillman Center, School of Computer Science, CMU
Email: jm[my last name]