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:- Parameterized algorithms: fast, polynomial-time algorithms for difficult problems under the promise that a certain parameter in the input instance is small. This includes fixed-parameter tractable (FPT) algorithms and approximation algorithms under a parameterized setting.
- Algorithmic graph theory: graph algorithms on parameterized graph families, e.g., bounded genus, bounded treewidth, or excluded minor graphs.
- Distributed algorithms: fast distributed algorithms that depend on extra parameters of the network graph, such as the diameter or the maximum degree.
- Spectral graph theory: fast algorithms on graphs with nice spectral properties, such as graphs with large expansion.
Publications
Older Publications
Contact
Office: 7607 Gates Hillman Center, School of Computer Science, CMU
Email: jm[my last name]@cs.cmu.edu