Algorithms and Complexity in Durham
A research group in the Department of Computer Science

Click on a name to reach a member's webpage where you can find more details about them and their activities, and contact details. Many members make available preprints of their publications.

You can also find out where in the world you can find some of our former members.

Academic Staff
Eleni Akrida graph algorithms and complexity, as well as approximation algorithms and probabilistic analysis of algorithms.
Magnus Bordewich counting problems; randomised algorithms; Markov Chain Monte Carlo sampling techniques; phylogenetics.
Konrad Dąbrowski
(Teaching Fellow)
graph algorithms, parameterized complexity, structural graph theory
Stefan Dantchev computational complexity; proof complexity; logic; constraint satisfaction; SAT solving.
Tom Friedetzky randomised algorithms; probabilistic analysis; sub-linear time algorithms; load balancing.
Maximilien Gadouleau coding theory, network coding and information theory; finite dynamical systems, including boolean networks and cellular automata; memoryless computation; transformation semigroups.
Ioannis Ivrissimtzis multiresolution geometry, geometric modeling particularly subdivision surfaces, mesh encoding and applying statistical learning methods in surface reconstruction.
Matthew Johnson graph theory including colouring, algorithms and decompositions; combinatorial optimization.
Andrei Krokhin constraint satisfaction, combinatorial optimization, universal algebra, logic, finite model theory.
Barnaby Martin computational and proof complexity, logic, constraint satisfaction, graph theory, SAT solving.
George Mertzios algorithms and complexity, foundations of networks, combinatorial optimization and algorithmic game theory.
Daniel Paulusma graph theory and algorithms; combinatorial optimization; cooperative game theory.
Norbert Peyerimhoff
(Department of Mathematical Sciences)
spectral geometry, schrodinger operators, symmetric spaces, dynamical systems, graph theory.
Robert Powell computational complexity, constraint satisfaction.
Iain Stewart interconnection networks for parallel computing; descriptive and computational complexity, finite model theory; group theory; graph algorithms; theoretical aspects of AI; GPGPU computing
Research Staff
Nick Brettell matroid theory, graph theory, algorithms
Jakub Oprsalconstraint satisfaction, combinatorial optimization, universal algebra, logic, combinatorics
Research Students
Giacomo Paesani Abdul Ghani Siani Smith
Karl Southern Isobel Friedlander Xin Zhang
Latifah Abduh Henry Westmacott Harit Anoushka