Next Generation of (Parameterized) Algorithms for Problems in AI

   Faculty of Engineering and Physical Sciences

This project is no longer listed on and may not be available.

Click here to search for PhD studentship opportunities
  Dr Sebastian Ordyniak  Applications accepted all year round  Funded PhD Project (UK Students Only)

About the Project

The Algorithms group at the University of Leeds (UK) is offering a fully funded 3 year PhD studentship on the development of Parameterized Algorithms for Problems in Artificial Intelligence and Logic. Parameterized Complexity is a vastly growing area within theoretical computer science that allows for the development of exact algorithms for computational hard problems that exploit the structuredness of real-world instances. The goal of this project is to develop more efficient parameterized algorithms for a wide range of problems in computer science such as satisfiability of propositional formulas, constraint satisfaction, integer linear programming, as well as problems from graph theory and machine learning with the help of sophisticated algorithmic techniques such as meta-theorems, dynamic programming, decompositions, and backdoor sets.

Funding Notes

A highly competitive School of Computing studentship consisting of Academic Fees of £4,600 and Maintenance matching standard Research Council rate of £15,609 per year, currently for 2021/22.
This opportunity is open to UK applicants only, All candidates will be placed into the School of Computing Studentship Competition and selection is based on academic merit.
Search Suggestions
Search suggestions

Based on your current searches we recommend the following search filters.

PhD saved successfully
View saved PhDs