PhD studentship in Algorithms and complexity

The Algorithms group at the University of Leeds (UK) is offering a fully funded 3.5-year PhD studentship on Parameterized Complexity and Approximation. Parameterized Complexity is a vastly growing area within theoretical computer science that allows for the development of exact and approximation algorithms for computationally hard problems by exploiting the structure of inputs and doing a multivariate complexity analysis. The goal of this project is to develop more efficient parameterized approximation algorithms and preprocessing algorithms (also known as kernelization) for a wide range of NP-hard graph problems. The studentship provides full academic fees together with a tax-free maintenance grant at the standard UKRI rate for 3.5 years. Applicants should have at least a first class or an upper second class British Bachelors Honours degree (or equivalent) in computer science or mathematics, with excellent mathematical skills and an interest in discrete algorithms.