School of Computer Science Studentship 2026/27 - Algorithms for metric-based problems on graphs

This PhD studentship in the School of Computer Science at the University of Leeds focuses on addressing problems in graph theory and graph algorithms. The research aims to study the distance-metric of interesting graph classes and propose efficient algorithms for related optimization problems. As most combinatorial optimization problems are NP-hard, the project will explore fixed-parameter tractable algorithms or approximation algorithms, building on algorithmic meta-theorems and frameworks to solve combinatorial optimization problems on graphs. The studentship provides full funding for 3.5 years, including full academic fees and a tax-free maintenance grant. The candidate will work under the supervision of Dr. Dibyayan Chakraborty in the Algorithms and Complexity research group. The project requires a strong background in advanced graph theory and algorithms, with research experience in structural or algorithmic graph theory considered advantageous. This is a highly competitive opportunity with only one funded place available. The successful candidate will contribute to cutting-edge research in graph algorithms and computational complexity theory, working within a leading international research-intensive university environment.