PhD studentship in Algorithms and Complexity

Faculty of Engineering and Physical Sciences EPSRC Project Proposals 2025/26 (jobs.ac.uk)

Project link: PhD studentship in Algorithms and complexity | Project Opportunities | PhD | University of Leeds

Number of Positions: 1

Funding: School of Computer Science Studentship consisting of the award of fees, together with a tax-free maintenance grant of £19,237 per year for 3.5 years. 

Lead Supervisor’s full name & email address

Dr Fahad Panolan: f.panolan@leeds.ac.uk   

Project summary

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.

Please state your entry requirements plus any necessary or desired background

A first class or an upper second class British Bachelors Honours degree (or equivalent) in an appropriate discipline such as Computer Science or Mathematics. Applicants are expected to have excellent mathematical skills as well as an interest in discrete algorithms.

Subject Area

Applied Mathematics, Computer Science & IT

Keywords

Computer sciences, computability, graph theory

Advert information