Address: Department of Computer Science Durham University Science Laboratories South Road Durham DH1 3LE UK
Office: E252 |

Professor, Head of the Algorithms and Complexity research group (ACiD)

Here is a full list of my papers; see also my profiles on Google Scholar and dblp.

Preprints of most of my papers are available on arXiv (see also Durham Research Online but note that some recent papers may be under a temporary publisher-imposed embargo).

- Graph Colouring: from Structure to Algorithms, Royal Society IES\R1\191223, International Exchanges Grant with Hans Bodlaender, 2019-2021, PI
- The Complexity of Promise Constraint Satisfaction, EPSRC EP/R034516/1, 2018-2021, CI
- ALGOUK - A Network for Algorithms and Complexity in the UK, EPSRC EP/R005613/1, 2017-2020, CI
- Efficient Graph Colouring Algorithms via Input Restrictions, Leverhulme Trust RPG-2016-258, 2016-2020, PI
- Detecting Induced Graph Patterns, EPSRC EP/K025090/1, 2013-2016, PI
- Coping with NP-Hardness: Parameterized and Exact algorithms, Royal Society JP100692, Joint Project with Fedor Fomin, 2011-2014, PI
- Algorithmic Aspects of Graph Coloring, EPSRC EP/G043434/1, 2009-2013, PI
- Structural Vulnerability Measures for Networks and Graphs, EPSRC EP/F064551/1, 2009-2012, PI from 2011
- Algorithmic Aspects of On-line Graph Coloring, Royal Society JP090172, Joint Project with Jiri Fiala, 2009-2011, PI
- Exact Algorithms for NP-Hard Problems, EPSRC EP/D053633/1, 2006-2010, PI

- Exploiting Network Structure to Obtain Faster Algorithms, Institute of Advanced Study, Durham University, Sir Derman Christopherson / Sir James Knott Foundation Fellowship, 2011
- Glover-Klingman Prize for the pair of papers "The Computational Complexity of Graph Contractions I, II," Networks, Volume 51, Issue 3, May 2008, pp. 178-189 (doi) and Volume 52, Issue 1, August 2008, pp. 32-56 (doi), with Asaf Levin and Gerhard Woeginger

- Nick Brettell, 2019-2020
- Konrad Dabrowski, 2012, 2013-2019
- Petr Golovach, 2009-2012
- Artem Pyatkin, 2011-2012
- Viresh Patel, 2011

- Siani Smith
- Giacomo Paesani
- Anthony Stewart, PhD, 2017
- Carl Feghali, PhD, 2016
- Jian Song, PhD, 2013
- Pim van 't Hof, PhD, 2010

- Alexandre Blanché, May-July 2016
- Francois Dross, April-July 2015
- Shenwei Huang, May-June 2014
- Marthe Bonamy, May-July 2010
- Theophile Trunck, May-July 2009

- Associate Editor of The Computer Journal (Oxford University Press)
- Associate Editor of International Transactions in Operational Research (Wiley)
- Associate Editor of Networks (Wiley)
- Editor of Graphs and Combinatorics (Springer)
- Editor of Journal of Graph Theory (Wiley)
- Editor of Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271), Dagstuhl Reports 9 (2019) 125-142
- Editor of the Report on BCTCS & AlgoUK 2019 (EATCS)
- Editor of the Proceedings of CiE 2019 (Springer)
- Editor of the Proceedings of WG 2008 (Springer)
- Guest editor of Discrete Applied Mathematics (Elsevier), Special Issue: Algorithmic and Structural Graph Theory
- Guest editor of the Journal of Discrete Algorithms (Elsevier), Special Issue: Selected papers from ACiD 2010

- Dagstuhl Seminar 21051 Organiser
- BCC 2021 Organiser
- Algorithmic Graph Theory (MS-ID54), Organiser
- CiE 2020, PC member
- Algorithms UK 2019, Invited speaker
- WG 2019, PC member
- CiE 2019, PC chair, Organiser
- AAMAS 2019, SPC member
- BCTCS & ALGOUK 2019, Organiser
- BCC 2019, Invited speaker
- Dagstuhl Seminar 19271 Organiser
- SWAT 2018, PC member
- AAMAS 2018, SPC member
- IPEC 2018, PC member
- Cycles and Colourings 2017, Invited speaker
- CoopMAS 2017, PC member
- ATCAGC 2017, Organiser
- 100 Years of Matching Theory in Hungary, Invited speaker
- CoopMAS 2016, PC member
- AAIM 2016, PC member
- WG 2016, PC member
- CoopMAS 2015, PC member
- WG 2015, Invited speaker
- AGTAC 2015, PC member
- CoopMAS 2014, PC member
- AAIM 2014, PC member
- MFCS 2013, PC member
- CoopMAS 2013, PC member
- ACiD 2010, Organiser
- IWOCA 2009, PC member
- WG 2008, Organiser
- BCTCS 2008, Organiser

- Advanced Algorithms

Lecture materials are on duo (local access only).