Daniel Paulusma's Homepage
Senior Lecturer in the Algorithms and Complexity research group (ACiD).
My interests lie in graph theory and algorithms, combinatorial optimization and cooperative game theory.
A list of my papers can be found
- Exact Algorithms for NP-Hard Problems, EPSRC EP/D053633/1, 2006-2010, PI
- Structural Vulnerability Measures for Networks and Graphs, EPSRC EP/F064551/1, 2009-2012, PI from 2011
- Algorithmic Aspects of Graph Coloring, EPSRC EP/G043434/1, 2009-2013, PI
- Detecting Induced Graph Patterns, EPSRC EP/K025090/1, 2013-2016, PI
- Algorithmic Aspects of On-line Graph Coloring, Royal Society JP090172, Joint Project with Jiri Fiala, 2009-2011
- Coping with NP-Hardness: Parameterized and Exact algorithms, Royal Society JP100692, Joint Project with Fedor Fomin, 2011-2014
The grants from EPSRC provided funding for Research Associates:
- Pim van 't Hof, successfully defended his PhD thesis in May 2010
- Jian Song, successfully defended his PhD thesis in February 2013
- 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 and Volume 52, Issue 1, August 2008, pp. 32-56,
with Asaf Levin and Gerhard Woeginger
- Exploiting Network Structure to Obtain Faster Algorithms, Institute of Advanced Study, Durham University, Sir Derman Christopherson / Sir James Knott Foundation Fellowship, 2011
In 2012-2013 I teach
- Year 3: Distributed Computing (ASAM-DC)
- MSc: Distributed Computing (DC)
- MSc: Information Search for the WWW (ISWWW) with
- MSc: Research Methods & Professional Issues (RMPI)
More information can be found on DUO.
Theoretical Computer Science Conferences