Home
ACiD, Algorithms and Complexity in Durham, is a world-leading research group 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 research foci including computational complexity, proof complexity, descriptive complexity, graph theory, exact algorithms, randomised algorithms, approximation algorithms, parameterized algorithms, finite model theory, constraint satisfaction, interconnection networks, universal algebra and mathematical logic.
ACiD News
-
Talks from Max and Craig
Max Gadouleau will be giving a talk at the next Workshop on Applied Algebra and Geometry, in York on Tuesday 15th September. During this same week, Craig Millar will be speaking at the International Conference on Semigroups and Applications, which honours the 65th birthday of Vicky Gould (York). We send our love to Vicky for…
-
Computation A la Rice!
Max Gadouleau joined ALARICE, an ANR project from researchers in France: Kévin Perrot (Marseille) and Adrien Richard (Nice} for obtaining results “à la Rice”, such as general complexity bounds for finite dynamical systems. The grant enables Max to undertake research visits to Nice and elsewhere to collaborate on the project, which will be Nice.
-
Dave Kutner metamorphosises into a Postdoc!
David Kutner will take up a PDRA position on the 3-year Leverhulme project Signed graphs and their influence on opinion dynamics. Max Gadouleau is PI and Daniel Paulusma is CI. David will relinquish the Career Development Fellow position he currently holds at Durham.
-
Tala Eagling-Vose at GROW
Tala is invited to the prestigious 12th Workshop on Graph Classes, Optimization and Width Parameters (GROW) 2026 in Bedlewo, Poland. Tala will talk on colouring graphs without a subdivided H-graph. The workshop will run 27th September to 1st of October.
-
Invited Talk at GRIF
On 5 June, Daniel Paulusma gave an invited talk at Graphes en Région Île-de-France (GRIF) in Paris. He spoke on Graph Colouring under input restrictions.
-
Distinguished Paper at PODS!
Congratulations to Igor Razgon for winning, together with Matthias Lanzinger and Daniel Unterberger, a Distinguished Paper Award at the 2026 ACM SIGMOD/PODS Conference for their paper “FPT Parameterisations of Fractional and Generalised Hypertree Width”.
Contact us:
email: [email protected]
tel:+44 (0) 191 334 1700
Find us: Directions, Maps, App