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
(502)- Published
From classical proof theory to P vs. NP: a guide to bounded theories
Research output: Chapter in Book/Report/Conference proceeding › Other contribution
- Forthcoming
Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs
Research output: Contribution to journal › Article
- E-pub ahead of print
Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search
Research output: Contribution to conference › Paper
Projects
(32)Analyzing Security-aware Workflows (funded by Leverhulme Trust)
Project: Research
Polytope methods in parameterized complexity
Project: Research
ID: 17743304