Research Info
Recent publications (since 2003) and preprints can be found here: Publications
since 2003
For older publications, look here: Publications
(before 2003)
I recently obtained an EPSRC grant of over £500k,
funding two PhD positions and one postdoc position,
to work on algorithmic and structural aspects of vulnerability measures
for graphs and networks.
Click here
for the
official EPSRC announcement.
For the technical description click the following link to a pdf file:
project
description
For my editorial tasks, look here: Editorships
My current research interests lie in the intersection area of
Theoretical Computer Science and Discrete Mathematics, mainly within
Graph Theory and Computational
Complexity.
My main topics of research have been
- Cycles and Paths (PhD 1988: Hamilton cycles in graphs and
related topics)
- Colouring and Labeling
- Computational Complexity and Graph Classes
- Claw-free Graphs,
but I also worked on various other topics, including
- Planar Graphs
- Ramsey Theory
- Spanning Trees
- Connectivity
- Vulnerability, and
- Diameter.
Last update: January 20, 2009