Graph structure and width
Tree-width, rank-width, mim-width, and dense graph classes.
Research
Research topics
Structural and algorithmic questions in graph theory.
Graph containment
Minors, vertex-minors, and induced subdivisions.
Packing and covering
Erdős–Pósa questions and packing-covering duality on group-labelled graphs.
Coloring and intersection graphs
Graph coloring, χ-boundedness, holes, and intersection graph classes.
Parameterized algorithms
Parameterized complexity and polynomial kernelization for graph modification problems.
These topics are organized from the research interests listed on the Intro page.