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
-
Max Gadouleau’s new editorial appointment
We congratulate Max Gadouleau on becoming a member of the Editorial Board of the journal Designs, Codes, and Cryptography!
-
Felicia Lucke Postdoc Mobility Fellowship
Congratulations to Felicia Lucke for obtaining a 2-year Postdoc Mobility Fellowship for the project “The Impact of Forbidden Structures on Matching Cuts and the Chromatic Number”, funded by the Swiss National Science Foundation (SNSF). Felicia will undertake the project at ENS Lyon, starting in September 2025.
-
ISAAC 2024 Best Paper
Congratulations to Barnaby Martin and Daniel Paulusma for their paper Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the “H”-graphs (with Vadim Lozin, Sukanya Pandey, Mark Siggers, Siani Smith and Erik Jan van Leeuwen) which has been awarded best paper at The 35th International Symposium on Algorithms and Computation (ISAAC 2024)!
-
New people in ACiD
We welcome Kunanon Burathep, Yilin Li, Yiming Qiu and Felicia Lucke as new ACiD members! The first three join us a PhD students and the last as a postdoc.
-
LMS CS Colloquium
Peter Davies-Peck will give a talk at the upcoming LMS CS Colloquium on 10th December 2024. Registration is available here.
-
Danny Vagnozzi
We welcome Danny to ACiD to work with Andrei Krokhin on Promise Constraint Satisfaction Problems! Danny is fresh from a postdoc in Edinburgh on Spectral Graph Theory. Danny studied Maths at Durham before doing a PhD in Cambridge with Anuj Dawar. Welcome back Danny!
Contact us:
email: [email protected]
tel:+44 (0) 191 334 1700
Find us: Directions, Maps, App