position (salary: £31,866 per annum at grade 7) within the School of
Computing at the University of Leeds. The position is part of the EPSRC
funded project (EP/V00252X/1) on the "Next Generation of Algorithms for
Mixed Integer Linear Programming (MILP)" led by Dr. Sebastian Ordyniak.
The project focuses on the development of novel algorithms and algorithmic
lower
bounds for MILP based on the principles of parameterized
complexity (PC). Towards this aim we will develop novel ways to measure
and exploit the structure of MILP instances based on decompositional,
backdoor, and hybrid approaches. We will also explore
how the novel algorithmic lower bounds and upper bounds can best be
exploited for various problems in TCS, AI, and ML.
The project comes with a generous travel budget, which will allow us to
closely collaborate with the leading research groups within PC and the
complexity of MILP such as the algorithms and complexity groups at Charles
University in
Prague, TU Vienna, University of Warwick, Royal Holloway University of
London, and the University of Bergen.
Candidates interested in the position should have:
- a PhD degree (or be close to completion) in Computer Science or
Mathematics
- a strong background in algorithms and complexity, more specifically, in
parameterized complexity and/or the computational complexity of MILP
- very good scientific writing and communication skills
Participation and presentations at scientific conferences are expected
and will be funded.
If you are interested in working in an internationally connected,
world-leading research team within the Algorithms research group at
the University of Leeds, please apply online using following link:
http://jobs.leeds.ac.uk/EPSCP1032
Informal inquiries to sordyniak@gmail.com are also welcome.
The deadline for online applications is the 5.12.2020.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* 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.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************