Thursday, October 18, 2018

[DMANET] PhD Position in Parameterized Algorithms (deadline extension)

The Algorithms group at the University of Sheffield (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.

The candidate will be supervised by Dr. Sebastian Ordyniak.

Applicants are expected to have excellent mathematical skills as well as an
interest in discrete algorithms.

Funding Notes:

This fully funded studentship is open to UK or EU students, and provides a
tax-free living allowance at the standard Research Council rate (£14,777
p.a. for 2018/19) and full student tuition fees for three years.


The application should include the candidate's CV, an abstract of the
diploma/masters thesis, and a short motivation letter (if possible in a
single pdf file). The application should also mention possible starting
dates and should be sent to by 15. December 2018. The
PhD project starting date is flexible.

For informal inquiries please contact Dr. Sebastian Ordyniak at

* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.