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.
Promising Andrei Krokhin and Daniel Paulusma have been awarded a three-year EPSRC grant for work on The Complexity of Promise Constraint Satisfaction. Their proposal was ranked first at a very competitive Prioritisation Panel.
Invited Talk Andrei Krokhin will speak at the Computational Complexity Conference in San Diego in June.
Combinatorics Workshop Viktor Zamaraev will be speaking at the British Mathematical Colloquium in June.
Dagstuhl Daniel Paulusma is organizing a workshop in July 2019 on Graph Colouring: from Structure to Algorithms.
Satellite George Mertzios is organizing a satellite workshop of ICALP 2018 on Algorithmic Aspects of Temporal Graphs.
Playing Away On 6 December, Tom Friedetzky will trek over to Maths to give a Statistics Seminar.
Doctoral Success Congratulations to Chris Wastell on passing his PhD examination.
AlgoUK now has a website and has announced its first workshop at King's College London, 6-7 February 2018.
NODES We host the organisation's next meeting on 29 November: our own Iain Stewart and Tom Nye (Newcastle University) will be speaking. Full details here. A couple of weeks later, we will participate in the NODES Industry Day.
Seminar On 24 October, Barnaby Martin gave a talk in the St Andrews School of Computer Science on The Complexity of Quantified Constraints.
Workshop George Mertzios has been invited to talk at GROW 2017 (Workshop on Graph Classes, Optimization, and Width Parameters).
Welcome We are pleased to greet two new members of the group: Viktor Zamaraev joins us as a postdoctoral researcher, and Giacomo Paesani will study for a PhD.
Graphs and Networks Course A ten week course on Spectra and Geometry of Graphs and Networks begins at 1pm on 9 October. It is being led by Norbert Peyerimhoff as a MAGIC (Mathematics Access Grid Instruction and Collaboration) course.
ALGOUK Iain Stewart and Daniel Paulusma have won an EPSRC grant that will fund a range of activities to bring together researchers on algorithms in the UK and facilitate interactions with researchers in other disciplines and industry.
Congratulations to Aidan Chalk on a successful outcome to his PhD examination. Aidan has taken up a position with the Science and Technology Facilities Council.
Symposium Our colleagues in Maths are organizing a meeting on Markov Processes, Mixing Times and Cutoff.
Congratulations to Tom Friedetzky on promotion to Associate Professor.
Talks Barnaby Martin gave the York Semigroups Seminar on 3 May discussing his work on generating sets for powers of finite algebras. He also gave the Séminaire ALGO at the Université de Caen Normandie on 23 May.
Success We congratulate Anthony Stewart on the outcome of his PhD viva.
Journal Iain Stewart has joined the Editorial Board of Philosophical Transactions of the Royal Society A which was founded in 1660 and is the world's first scientific journal.
Book Andrei Krokhin and his collaborator Stanislav Zivny have edited an open-access volume of surveys on The Constraint Satisfaction Problem: Complexity and Approximability.
Invited Speaker In September, Daniel Paulusma will be talking at the Cycles and Colourings workshop in Slovakia.
Conference George Mertzios and Iain Stewart are on the Programme Committee of I-SPAN 2017, the 14th International Symposium on Pervavise Systems, Algorithms, and Networks that takes place in Exeter in June.
Scotland In April, Max Gadouleau will be talking at the Scottish Combinatorics Meeting 2017.
Café Society Barnaby Martin will give an informal talk about his research at Cafe Scientifique Durham City.
Research Funding George Mertzios has been awarded an EPSRC grant for his project on Algorithmic Aspects of Temporal Graphs.
Off Again After a busy year with us, André Nichterlein returns whence he came (Berlin).