Research Fellow in Parameterized Complexity of Integer Linear Programming

University of Leeds

Leeds, United Kingdom

Job posting number: #7072383 (Ref:EPSCP1032)

Posted: November 20, 2020

Job Description

Are you an ambitious researcher looking for your next challenge? Do you have a background in algorithms and complexity? Do you want to further your career in one of the UK’s leading research intensive Universities? 

As a Research Fellow, you will undertake research on the (parameterized) complexity of (Mixed) Integer Linear Programming (MILP), as part of the EPSRC project "Next Generation of Algorithms for Mixed Integer Linear Programming (MILP)", which is a collaboration between the University of Leeds and Charles University in Prague.

You will be expected to develop novel algorithms and algorithmic lower bounds for MILP based on the principles of parameterized complexity. Towards this aim you will develop novel ways to measure and exploit the structure of MILP instances based on decompositional, backdoor, and hybrid approaches. You will also be expected to explore how the novel algorithmic lower bounds and upper bounds can best be exploited for various problems in TCS, AI, and ML. You will build on state-of-the-art approaches for PC and MILP.

Within the role, there is scope and funding provided to disseminate via national and international conferences and workshops. Similarly, there is funding for visits to our international collaborators most importantly to visit our project partner Martin Koutechý at Charles University in Prague. The post, therefore, would be well suited to a researcher with excellent communication and engagement skills.

You should hold a PhD (or be close to completion) in Computer Science or Mathematics. A strong background in parameterized complexity and/or the complexity of MILP, witnessed by a strong publication record in these areas, are essential. Previous experience with the development of MILP solvers are desirable but not required. The ability to work effectively with both internal colleagues and external project partners is also essential.

This post is an opportunity to work in an internationally connected, world-leading research team within the Algorithms research group at The University of Leeds and to establish novel connections with the leading research groups on parameterized complexity and MILP in Europe.

To explore the post further or for any queries you may have, please contact: 

Sebastian Ordyniak, Lecturer

Email: s.ordyniak@leeds.ac.uk 

Location:  Leeds - Main Campus
Faculty/Service:  Faculty of Engineering & Physical Sciences
School/Institute:  School of Computing
Category:  Research
Grade:  Grade 7
Salary:  £33,797 to £40,322 p.a.
Post Type:  Full Time
Contract Type:  Fixed Term (2 years (grant funding))
Release Date:  Wednesday 18 November 2020
Closing Date:  Saturday 05 December 2020
Reference:  EPSCP1032


The University community is made up of a wide range of people with diverse backgrounds and circumstances, which we value and regard as a great asset. As part of our continued commitment to equality and inclusion, we strive to create an environment where everyone can reach their full potential and have a real opportunity to participate in and contribute to our activities.


Apply Now

Please mention to the employer that you saw this ad on Sciencejobs.org