Contact
Postal address:
Department of Computer Science, Royal Holloway, University of London, Egham Hill, Egham, Surrey
Organisation profile
The Centre is concerned with studying various kinds of algorithms, parameterised, exact, randomised, heuristic and approximate, for problem arising in graph and hypergraph theory, constraint satisfaction, combinatorial optimisation, and their numerous applications. Our current main focus in theory, is parameterised algorithms and complexity and, in applications, access control in information security. Members of the Centre for Algorithms and Applications are listed here.
Publications
(486)- Forthcoming
On r-Simple k-Path and Related Problems Parameterized by k/r
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- E-pub ahead of print
Binary constraint satisfaction problems defined by excluded topological minors
Research output: Contribution to journal › Article
- E-pub ahead of print
Domain Reduction for Valued Constraints by Generalising Methods from CSP
Research output: Contribution to conference › Paper
Projects
(31)Polytope methods in parameterized complexity
Project: Research
ID: 17743304