Algorithms and Complexity


Welcome to the website of the Algorithms and Complexity research group at the University of Bristol.

Our Research Interests. Our current research focusses on: Getting involved. We offer BSc/MEng projects for Bristol students (implementation/engineering of algorithms, algorithmic theory) as well as PhD positions in all areas relevant to our research. Students with an interest in algorithmic theory and a solid foundation in mathematics are strongly encouraged to get in touch.


November 2021Paper "Optimal Bounds for Dominating Set in Graph Streams" by Sanjeev Khanna and Christian Konrad accepted at ITCS 2022!
October 2021We welcome our new Research Associate Dr Pavel Dvorak to the group!
September 2021We welcome our new PhD student Cezar Alexandru to the group!
August 2021PhD student Kheeran Naidu presented his recent work at APPROX'21. Check out his presentation here.
July 2021Group webpage goes online!


Core Faculty

Raphaël Clifford

Christian Konrad
(Head of Group)

John Lapinskas

Pavel Dvorak
Hosted by Christian Konrad
PhD Students

Cezar Alexandru
Supervisor: Christian Konrad

Kheeran Naidu
Supervisor: Christian Konrad

Publications (since 2020)

2022 2021 2020


Algorithms and Complexity research group
School of Computer Science, Electrical and Electronic Engineering, and Engineering Maths (SCEEM)
Faculty of Engineering
University of Bristol
Merchant Venturers Building
Woodland Road
BS8 1UB, Bristol
United Kingdom

Group contact email: