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

  • LMS CS Colloquium

    Peter Davies-Peck will give a talk at the upcoming LMS CS Colloquium on 10th December 2024. Registration is available here.

    See more including links

  • 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!

    See more including links

  • Anouk Sommer

    We welcome to Durham Anouk Sommer, who is funded by DAAD over the summer to work on the project Schnell aber spät: breaking Deutsche Bahn even more with graph theory. Anouk joins us from the Karlsruhe Institute of Technology in Germany, where she is a student.

    See more including links

  • Algorithmic Meta-classifications for Graph Containment

    Congratulations to PI Daniel Paulusma and CIs Matthew Johnson, Barnaby Martin and Vadim Lozin (Warwick) on the award of a Leverhulme Trust Research Project Grant! The project will run for three years and provides funding for a postdoctoral position (36 months) and a teaching fellow (10 months) position in Durham. The start date is 1…

    See more including links

  • PACS 2024

    Andrei Krokhin is an invited speaker at the Workshop on Parameterized Algorithms and Constraint Satisfaction – July 7, Tallinn, Estonia – a satellite workshop to LICS/ICALP 2024. He will speak on a Theory of Gadget Reductions for CSPs.

    See more including links

  • SAND 2024

    Thomas Erlebach was one of the three invited speakers at SAND 2024 and gave an invited talk with title “Exploration and Rendezvous in Temporal Graphs” there this Wednesday. Thomas was also a co-author of the following SAND 2024 paper for which Nils Morawietz (a PhD student from University of Jena) won the SAND 2024 Best…

    See more including links

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