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.


* indicates that I gave the talk at the corresponding conference, and in most cases, my slides are attached.

Older Publications


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