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
(495)- Published
Bounded and Approximate Strong Satisfiability in Workflows
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- E-pub ahead of print
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
Research output: Contribution to journal › Article
- Forthcoming
Sparsification of SAT and CSP Problems via Tractable Extensions
Research output: Contribution to journal › Article
Projects
(32)Analyzing Security-aware Workflows (funded by Leverhulme Trust)
Project: Research
Polytope methods in parameterized complexity
Project: Research
ID: 17743304