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
(512)- Published
On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Forthcoming
Approximation algorithms for general cluster routing problem
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Forthcoming
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games
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