<html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body>
<p>-------- Forwarded Message --------</p>
<div class="moz-forward-container">
<table class="moz-email-headers-table" cellspacing="0" cellpadding="0" border="0">
<tbody>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Subject:
</th>
<td>[DMANET] Postdoctoral Researcher in TCS at the
University of Leeds (deadline 3.10.2021)</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Fri, 17 Sep 2021 11:18:39 +0100</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Sebastian Ordyniak <a class="moz-txt-link-rfc2396E" href="mailto:sordyniak@gmail.com"><sordyniak@gmail.com></a></td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">To: </th>
<td><a class="moz-txt-link-abbreviated" href="mailto:dmanet@zpr.uni-koeln.de">dmanet@zpr.uni-koeln.de</a></td>
</tr>
</tbody>
</table>
<br>
<br>
We are happy to invite applications for a 18-months postdoctoral
research<br>
position (salary: £31,866 per annum at grade 7) within the School
of<br>
Computing at the University of Leeds. The position is part of the
EPSRC<br>
funded project (EP/V00252X/1) on the "Next Generation of
Algorithms for<br>
Mixed Integer Linear Programming (MILP)" led by Dr. Sebastian
Ordyniak.<br>
<br>
The project focuses on the development of novel algorithms and
algorithmic<br>
lower<br>
bounds for MILP based on the principles of parameterized<br>
complexity (PC). Towards this aim we will develop novel ways to
measure<br>
and exploit the structure of MILP instances based on
decompositional,<br>
backdoor, and hybrid approaches. We will also explore<br>
how the novel algorithmic lower bounds and upper bounds can best
be<br>
exploited for various problems in TCS, AI, and ML.<br>
<br>
The project comes with a generous travel budget, which will allow
us to<br>
closely collaborate with the leading research groups within PC and
the<br>
complexity of MILP such as the algorithms and complexity groups at
Charles<br>
University in<br>
Prague, TU Vienna, University of Warwick, Royal Holloway
University of<br>
London, and the University of Bergen.<br>
<br>
Candidates interested in the position should have:<br>
<br>
- a PhD degree (or be close to completion) in Computer Science or<br>
Mathematics<br>
<br>
- a strong background in algorithms and complexity, more
specifically, in<br>
parameterized complexity and/or the computational complexity of
MILP<br>
<br>
- very good scientific writing and communication skills<br>
<br>
Participation and presentations at scientific conferences are
expected<br>
and will be funded.<br>
<br>
If you are interested in working in an internationally connected,<br>
world-leading research team within the Algorithms research group
at<br>
the University of Leeds, please send your application<br>
to <a class="moz-txt-link-abbreviated" href="mailto:sordyniak@gmail.com">sordyniak@gmail.com</a> (a detailed cv is sufficient at this stage)
until<br>
3.10.2021.<br>
<br>
</div>
</body>
</html>