Skip to main content

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

  • Thomas Erlebach keynote at ALGO 2025

    Thomas Erlebach recently gave the ALGOWIN keynote at ALGO 2025 in Warsaw on “Temporal Graphs: Exploration and Realization”.

    See more including links

  • David Kutner Career Development Fellowship

    Dave Kutner re-joins ACiD as a Career Development Fellow from August 2025. He will remain with us for three more years!

    See more including links

  • Farewell to our postdocs: Felicia, Jungho and Alberto!

    Felicia Lucke, Jungho Ahn and Alberto Larrauri all move to pastures new: ENS Lyon, Inha and Zaragoza, respectively. We wish them well in their new institutions!

    See more including links

  • Daniel Paulusma appointed to REF 2029 Computer Science and Informatics sub-panel

    Daniel Paulusma has been appointed to the REF 2029 Computer Science and Informatics sub-panel. Serving on a REF panel is a significant responsibility, as the outcomes directly shape the reputation, funding, and future direction of research across UK universities, and his expertise will contribute to assessing the quality and impact of research in the field.…

    See more including links

  • Paper at FCT 25!

    Congratulations to Tala Eagling-Vose, Matthew Johnson and Daniel Paulusma for their paper (with Konrad Dabrowski) “Finding d-Cuts in Probe H-Free Graphs” which has been accepted at the 25th International Symposium on Fundamentals of Computation Theory (FCT 2025). Tala will present the paper in Wrocław, Poland, in September.

    See more including links

  • Paper at EC 2025

    The list of papers accepted for the 26th ACM Conference on Economics and Computation (EC 2025) is out. It includes the latest paper in the EPSRC-funded grant KidneyAlgo project of Durham and Glasgow: R. Colley, D. Manlove, D. Paulusma and M. Zhang, Complexity and manipulation of international kidney exchange programs with country-specific parameters

    See more including links

Contact us:
email: [email protected]
tel:+44 (0) 191 334 1700
Find usDirectionsMapsApp