Parameterized algorithms and complexity

The area of parameterized algorithms and complexity was launched nearly thirty years ago. Many of its deep and important theoretical results have been obtained in the last decade, and it still contains numerous unsolved and challenging problems. Parameterized algorithms are used in many applications such as bioinformatics, social choice, information access control, medicine, psychology and cognitive science, and environmental sciences.

We are looking for applicants interested in algorithms and complexity, particularly in the areas of Parameterized Complexity, Graph Theory and Graph Algorithms, Constraint Satisfaction Problems and Combinatorial Optimisation.

For more information, see https://pure.royalholloway.ac.uk/portal/en/organisations/centre-for-algorithms-and-applications(020c2897-0bd8-44a8-b987-549cab327b97)/persons.html?filter=current

Informal enquiries about the project may be made by email to Professor Gregory Gutin ([Email Address Removed]) or Dr Magnus Wahlström
([Email Address Removed])

Applications must be made on-line to Royal Holloway, University of London https://www.royalholloway.ac.uk/studyhere/researchdegrees/applying/home.aspx

Suitable applicants will have a first or upper second class honours degree in Computer Science or a related discipline; with a
definite interest in mathematics and theoretical computer science; excellent mathematical and analytical skills; and must meet English language requirements.