I am interested in using ideas from pure mathematics to address practical problems arising computer science, primarily in the area of algorithms and computational complexity. My mathematical background is mainly in graph theory, and my current research focusses on combinatorial algorithms and parameterised complexity.

I currently hold a Personal Research Fellowship from the Royal Society of Edinburgh, funded by the Scottish Government, to work on the project Exploiting Realistic Graph Structure. The long-term goal of this work is to help bridge the gap between theory and practice in the design of network algorithms by developing our understanding of how structural properties of real datasets can help us to extract information from them more efficiently.

For more information on my work, have a look at my publications and recent presentations. You can also read a very brief biography, and see details of some of my other academic activities.