General information

Areas of research include: combinatorial optimization, in particular the integer programming models known as packing and covering; minimax relations; graph colouring; structural graph theory; and matroid theory. In the past couple of years I have been investigating the class of even cycle and even cut matroids, with the goal of finding an excluded minor characterization for these classes of matroids. This is motivated by a deep conjecture of Paul Seymour on flows in binary matroids.

Administrative responsabilities include: associate editor for the SIAM Journal on Discrete Mathematics; and Associate chair for Undergraduate studies for the Combinatorics and Optimization department.


This page is under construction.