Algorithms and Complexity in Durham
A research group in the School of Engineering and Computing Sciences

ACiD, Algorithms and Complexity in Durham, is a world-leading research group and one of the largest UK groups working in this area with research programmes involving many international collaborators. Theoretical Computer Science comprises the development of algorithmic techniques that efficiently exploit the power of modern computers, the study of the limits of computation and the ways in which we can cope with, and take advantage of, intractability, and the science of the unsolvable.

The group is broad-based with differing research foci within the general area of algorithms and complexity including computational complexity, proof complexity, descriptive complexity, (algorithmic) graph theory, exact algorithms, randomised algorithms, approximation algorithms, finite model theory, constraint satisfaction, interconnection networks, universal algebra and mathematical logic.

Former Members


Opportunities for Research Students If you are interested in beginning a PhD or MSc by Research in October 2014, please email us (or consult a member of the group who you would like to work with). It is possible that you will be eligible for funding from a Research Council award. Or search our Funding database.

Talks Konrad Dąbrowski has set up a series of Computer Science Junior Seminars for postdocs and PhD students to present ongoing research.

Welcome to Archontia Giannopoulou who joins us as a Research Associate.

Congratulations to Daniel Allsop on the award of MSc (Research).

Elected Iain Stewart has been elected as a member of the Executive of UKCRC (the UK Computing Research Committee) and to the Council of the London Mathematical Society.

Network Coding In recognition of the recent appointment of Max Gadouleau, we will be hosting a meeting on Network coding, partitions and security on 20 November.

Ins and Outs At the start of the new academic year, we welcome ACiD postdocs Alejandro Erickson and (for a second time) Konrad Dąbrowski, and PhD students Carl Feghali, Anthony Stewart, Nihan Tokac and Chris Wastell, and we bid farewell to Anna Huber who takes up a lectureship at the University of Derby.

Research Funding Max Gadouleau has been awarded an EPSRC grant to fund his project Memoryless Computation and Network Coding.

Best of 2012 Andrei Krokhin (and co-authors Laszlo Egri, Benoit Larose and Pascal Tesson) has been cited in Computer Reviews' Notable Computing Books and Articles of 2012 for the paper The Complexity of the List Homomorphism Problem for Graphs.

Congratulations to Daniel Paulusma on his promotion to Reader.

Farewell to researchers Konrad Dąbrowski and Nicholas Georgiou who have moved on to further postdoctoral positions in, respectively, the ESSEC Business School in France and the Department of Mathematics here in Durham.

Congratulations to Aidan Chalk on the award of MSc (Research) for his work on bee colony optimization problems.

Research Grant Norbert Peyerimhoff and Stefan Dantchev (with colleagues Ioannis Ivrissimtzis and Alina Vdovina (Newcastle)) have obtained funding from EPSRC for their project Topology, Geometry and Laplacians of Simplicial Complexes.

Congratulations to James Gate and Jian Song on successful PhD vivas.

EPSRC Funding Daniel Paulusma and Iain Stewart have been awarded a grant for their project Detecting Induced Graph Patterns.

IAS Seminars The Institute of Advanced Study's thematic activity Times as Misty Window is a series of seminars on the use of phylogenetic methods.

Grant Success George Mertzios and Iain Stewart have been awarded large EPSRC grants to support their work on, respectively, intersection graph models and interconnection networks.

Congratulations to Jeremy Kemp on the award of MSc (Research) for his thesis on All-Pairs Shortest Path Algorithms Using CUDA.

Graph Theory Our colleagues in Maths are organizing Graph Theory and Interactions in July 2013 as part of the LMS Durham Research Symposia.

Click here to read older news items

Contact us:
tel:+44 (0) 191 334 1700
Find us: Directions, Maps, App