Algorithms and Complexity Group

Royal Holloway, University of London


Our group is concerned with the study of fundamental questions in algorithms and complexity, including parameterised complexity and algorithms, exact, randomised, heuristic and approximate algorithms, computational complexity, limitations on the efficiency of computation in various computational models, constraint satisfaction, combinatorial optimisation, and more.

See more details at: here


Prof Dave Cohen
Dr Argyrios Deligkas
Dr Edward Eiban
Prof Gregory Gutin
Prof Iddo Tzameret (head of the group)
Prof Magnus Wahlström