Graph theory, algorithms, computational complexity.
I design algorithms for structured classes of graphs. The definition of a graph class often implies additional properties which, in turn, provide clues about how to solve problems for the defined graphs. My research involves discovering and proving properties of graph classes, and making use of them to construct algorithms. My goals are to understand the interplay between problems and graph properties, and to identify relationships that lead to efficient algorithms.