Daniel Paulusma's Homepage

Contact

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

Office: E252
Tel: + 44 (0)191 33 41723
Email: daniel.paulusma@durham.ac.uk

Professor in the Algorithms and Complexity research group (ACiD)

Bibliography

I was an Assistant Professor at the University of Twente (2001-2004) where I obtained my PhD degree in 2001 and Master's degree in 1997. I moved to Durham in 2004, where I had positions as Lecturer (2004-2011), Senior Lecturer (2011-2013) and Reader (2013-2015) before becoming Professor in 2015. I was Director of Research for the School of Engineering and Computing Sciences (2014-2017).

Publications

My main interests lie in graph theory and algorithms, computational complexity and cooperative game theory. A list of my papers can be found here.

Grants

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-2019, PI
Detecting Induced Graph Patterns, EPSRC EP/K025090/1, 2013-2016, 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
Exact Algorithms for NP-Hard Problems, EPSRC EP/D053633/1, 2006-2010, PI
Coping with NP-Hardness: Parameterized and Exact algorithms, Royal Society JP100692, Joint Project with Fedor Fomin, 2011-2014, PI
Algorithmic Aspects of On-line Graph Coloring, Royal Society JP090172, Joint Project with Jiri Fiala, 2009-2011, PI

Awards

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

Research Associates

PhD Students

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

Visiting Research Students

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

Editorial Work

Associate Editor of The Computer Journal (Oxford University Press)
Editor of Graphs and Combinatorics (Springer)
Associate Editor of International Transactions in Operational Research (Wiley)
Editor of of Journal of Graph Theory (Wiley)
Associate Editor of Networks (Wiley)
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
Co-editor of the Proceedings of WG 2008 (Springer)

Conference Activities

CiE 2019, Co-chair
AAMAS 2019, SPC member
WG 2019, PC member
BCTCS & ALGOUK 2019, Co-organiser
BCC 2019, Invited speaker
Dagstuhl Seminar 19271 Co-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, Co-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, Co-organiser
IWOCA 2009, PC member
WG 2008, Co-organiser
BCTCS 2008, Co-organiser

Teaching

In 2018-2019 I teach part of the following modules:

Mathematics for Computer Science
Theory of Computation
Theoretical Computer Science IV

Lecture materials are on duo (local access only).