Daniel Paulusma's Homepage
Contact
Professor, Head of 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).
Research
My main interests lie in graph theory and algorithms, computational complexity and cooperative game theory. In particular I consider the computational complexity of graph problems under input restrictions.
I have written several survey papers on graph colouring for special graph classes
(see here, here and here)
and clique-width for hereditary graph classes (see here).
My recent work in game theory involves
kidney exchange,
matching games,
and
voting games.
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).
Grants
- 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
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
Visiting Research Students
Editorial Work
Conference Activities
- 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
Teaching
In 2020-2021 I teach the following module:
Lecture materials are on duo (local access only).
Links