Research activities

Group members' research interests are detailed below. Many members make preprints of recent papers available on their personal pages; see also Research day papers and Durham Research Online.

Andrei Krokhin has research interests in constraint satisfaction problems, computational complexity, combinatorial optimization, universal algebra, logic and finite model theory, discrete mathematics.

Hajo Broersma has research interests in discrete mathematics; graph theory including cycles and paths, colouring and labelling, graph classes, claw-free graphs, planar graphs, connectivity, vulnerability, spanning trees; Ramsey theory; computational complexity; telecommunications.

Magnus Bordewich has research interests in computational complexity of exact and approximate counting problems; randomised algorithms; Markov Chain Monte Carlo sampling techniques; applications of all of these to problems in phylogenetics.

Stefan Dantchev has research interests in computational complexity; proof complexity; mathematical logic; weak fragments of arithmetic; integer programming; constraint satisfaction; satisfiability (SAT) solving.

Tom Friedetzky has research interests in randomised algorithms; probabilistic analysis; sub-linear time algorithms; Monte Carlo Markov chains; communication networks (in particular load balancing).

Matthew Johnson has research interests in graph theory including colouring, algorithms and decompositions; combinatorial optimization; combinatorial designs.

Daniel Paulusma has research interests in graph theory and algorithms; combinatorial optimization; cooperative game theory.

Iain Stewart has research interests in computational complexity; finite model theory and descriptive complexity; graph theory and algorithms; interconnection networks for parallel and distributed computing; theoretical aspects of artificial intelligence; group theory; e-Science.

Petr Golovach is a research associate working with Daniel Paulusma and Hajo Broersma on the EPSRC-funded project Algorithmic Aspects of Graph Coloring. Before coming to Durham, he was a research associate at the University of Bergen.   His research interests are in the area of graph theory, graph algorithms, complexity and parameterized complexity.

Anna Huber is a postdoctoral researcher working with Andrei Krokhin.

Ross Kang is a research associate working with Magnus Bordewich on the EPSRC-funded project Approximation and mixing times in the ferromagnetic Potts model. Prior to working in Durham, he was a postdoctoral research fellow at McGill University, and before that a doctoral student in Oxford under the supervision of Colin McDiarmid. His research interests include graph colouring, random structures and algorithms.

Barnaby Martin is a postdoctoral researcher working with Iain Stewart on the EPSRC-funded project Quantified Constraints and Generalisations.

Viresh Patel is a research associate working with Hajo Broersma on the EPSRC-funded project Structural Vulnerability Measures for Networks and Graphs. Before coming to Durham, he was a PhD student at the LSE under the supervision of Graham Brightwell and Jan van den Heuvel.   His research interests include extremal graph and hypergraph theory, posets, and algorithms.

Artem Pyatkin is also working with Hajo Broersma on the EPSRC-funded project Structural Vulnerability Measures for Networks and Graphs.  He obtained his PhD and Habilitation from the Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences which is located in Novosibirsk Akademgorodok.

Jeremy Kemp is studying for an MSc by Research supervised by Iain Stewart.

Ioannis Lignos is a PhD student supervised by Matthew Johnson. He works on the EPSRC-funded project Extending the Theory of Colour Graphs.

Mahmoud Maqableh is a PhD student supervised by Stefan Dantchev.

Lars Nagel is a PhD student supervised by Tom Friedetzky. He works on the EPSRC-funded project Property Testing.

Robert Powell is a PhD student supervised by Andrei Krokhin.

Jian Song is a PhD student supervised by Daniel Paulusma.  He works on the EPSRC-funded project Algorithmic Aspects of Graph Colouring.

Former Members

Berdnt Muller was a postdoctoral researcher and teaching fellow in Durham until September 2010.   He is now a Senior Lecturer at the University of Glamorgan.

Pim van 't Hof was a postgraduate student supervised by Daniel Paulusma.  He was awarded his PhD in 2010.  He is now a Postdoc at the Algorithms Research Group at the University of Bergen, Norway

Luke Mathieson was a postgraduate student supervised by Stefan Szeider. He was awarded his PhD in 2009. He is now a Postdoc at the CIBM at Newcastle University, Australia.

Mark Rhodes was a postgraduate student and teaching fellow in Durham.  He was awarded his PhD in 2009.  He now works as a Software Developer for ScottLogic.

Stefan Szeider was a Reader in Durham until October 2009.  He now works at the Vienna University of Technology.

Fedor Fomin visited Durham from September 2008 to July 2009. He is a member of the Algorithms Research Group at the University of Bergen.

Catarina Carvalho was a research associate in Durham until September 2008. She is now a Postdoctoral Fellow at the Centre of Algebra of the University of Lisbon.

Marko Samer was a research associate in Durham until September 2008.   He left to work in the Formal Methods in Systems Engineering Group at TU Darmstadt, Germany.

Prabhu Manyem visited Durham in 2008. He is a lecturer at Shanghai University.

Mike Fellows joined the group in 2006-7 while he was in Durham as a Distinguished Fellow of the Institute of Advanced Study. He is a Professor of Computer Science at the University of Newcastle in Australia.

Florent Madelaine was a research associate in Durham until 2007. He is now a lecturer at the University of Auvergne.