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
-
David Kutner to Glasgow
We congratulate David Kutner on his appointment to a three-month postdoctoral position with Kitty Meeks and Jess Enright at the University of Glasgow. He will be working on the EPSRC project Multilayer Algorithmics to Leverage Graph Structure. Meanwhile, we has submitted his thesis and we look forward to welcoming him back for his viva!
-
Jungho Ahn joins ACiD!
We welcome Jungho Ahn to Durham from KAIST in South Korea. Jungho comes to work with Daniel Paulusma, Barnaby Martin and Matthew Johnson on their Leverhulme Trust project Algorithmic meta-classifications for graph containment.
-
Andrei Krokhin joins the Editorial Board of TheoretiCS
Congratulations to Andrei, who has joined the editorial board of TheoretiCS (a Diamond Open Access electronic journal covering all areas of Theoretical Computer Science).
-
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)!
Contact us:
email: [email protected]
tel:+44 (0) 191 334 1700
Find us: Directions, Maps, App