– graph algorithms (in particular for graph colouring and variants / generalisations of graph colouring)

– structural graph theory (in particular, special graph classes and their and their properties such as having (un)bounded clique-width)

– cooperative game theory (in particular, matching games)

## Contact

Tel: 0191 33 41723

Email: daniel.paulusma@durham.ac.uk

Website: http://community.dur.ac.uk/daniel.paulusma/