Daniel Paulusma's Homepage


Contact

Address: School of Engineering and Computing Sciences
Durham University
Science Laboratories
South Road
Durham
DH1 3LE
England
Office: CS 2.18
Telephone: + 44 (0)191 33 41723
Fax: + 44 (0)191 33 41701
Email: daniel.paulusma@durham.ac.uk

Research

Member of the Algorithms and Complexity research group (ACiD). My interests lie in

- graph theory and algorithms
- combinatorial optimization
- cooperative game theory.

A list of my papers can be found here .

I have an EPSRC grant on Exact Algorithms for NP-Hard Problems. Pim van 't Hof is the PhD student funded by this grant.

Together with Hajo Broersma, I have an EPSRC grant on Algorithmic Aspects of Graph Coloring. Petr Golovach is the Research Associate and Jian Song is the PhD student funded by this grant.

I am a co-editor of WG 2008 and a PC member of IWOCA 2009.


Teaching

In 2009-2010 I teach

- Algorithms and Complexity (TC-AC, first term)
- Distributed Computing (ASAM-DC)
- Information Search for the WWW (ISWWW, together with Matthew Johnson).

More information can be found on DUO.


Links

Theoretical Computer Science Conferences