<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] Postdoc position in parameterized algorithms /
kernelization at TU Eindhoven (deadline September 15th)</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Mon, 15 Aug 2022 13:53:55 +0000</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Jansen, Bart <a class="moz-txt-link-rfc2396E" href="mailto:b.m.p.jansen@tue.nl"><b.m.p.jansen@tue.nl></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> <a class="moz-txt-link-rfc2396E" href="mailto:dmanet@zpr.uni-koeln.de"><dmanet@zpr.uni-koeln.de></a></td>
</tr>
</tbody>
</table>
<br>
<br>
The Algorithms group of TU Eindhoven is offering a 1-year postdoc
position in parameterized algorithms and kernelization, funded by
the ERC Starting grant 'ReduceSearch'. For more information about
the positions and how to apply, please visit:<br>
<br>
<a class="moz-txt-link-freetext" href="https://jobs.tue.nl/en/vacancy/postdoc-position-quotreduce-search-projectquot-948352.html">https://jobs.tue.nl/en/vacancy/postdoc-position-quotreduce-search-projectquot-948352.html</a>><br>
For your convenience I have copied the text from this website
below.<br>
<br>
TU Eindhoven is offering a 1-year postdoc position for a talented
and motivated researcher with a strong interest in algorithms and
complexity. The research is supported by ERC Starting grant
"Rigorous Search Space Reduction" and is aimed at advancing the
theory of algorithmic preprocessing. The project investigates
questions such as: why does preprocessing lead to such large
speedups for some NP-hard problems? How does a preprocessing
algorithm reduce the search space of the follow-up algorithm?
Which aspects of a problem input make it amenable to
preprocessing? How can new preprocessing algorithms be developed
that deliver speedups of several orders of magnitude? These
questions are tackled using the framework of parameterized
complexity and kernelization, and are asked for a diverse set of
NP-hard problems concerning graphs, logic, and constraint
satisfaction.<br>
<br>
The position is supervised by dr. Bart M. P. Jansen
(<a class="moz-txt-link-freetext" href="https://www.win.tue.nl/~bjansen/">https://www.win.tue.nl/~bjansen/</a> )<br>
<br>
Job requirements<br>
The postdoctoral candidate is required to have a strong background
in algorithms or computational complexity. Experience within the
domain of parameterized complexity, kernelization, or constraint
satisfaction problems is a plus. Candidates are expected to be
fluent in English, both oral and in writing, and to have obtained
a PhD degree.<br>
<br>
The postdoctoral candidate will be expected to conduct independent
research on topics relevant to the above agenda, to publish this
research at conferences and journals, and to cooperate with the
PhD candidates and principal investigator of the ReduceSearch
project. The position does not have any required teaching duties.
If the postdoctoral candidate wishes to further their development
by assisting with the daily supervision of master- or PhD
students, there will be opportunities to do so.<br>
<br>
The starting date is negotiable, but must be no later than January
1st 2023. The position is offered for a period of one year, which
may be extended.<br>
<br>
Conditions of employment<br>
A meaningful job in a dynamic and ambitious university with the
possibility to present your work at international conferences.<br>
A full-time employment for 1 year.<br>
You will have free access to high-quality training programs on
general skills, didactics and topics related to research and
valorization.<br>
A gross monthly salary and benefits in accordance with the
Collective Labor Agreement for Dutch Universities.<br>
Additionally, an annual holiday allowance of 8% of the yearly
salary, plus a year-end allowance of 8.3% of the annual salary.<br>
The position comes with ample travel budget to engage in research
activities abroad.<br>
A broad package of fringe benefits (including an excellent
technical infrastructure, moving expenses, and savings schemes).<br>
Should you come from abroad and comply with certain conditions,
you can make use of the so-called '30% facility', which permits
you not to pay tax on 30% of your salary.<br>
Family-friendly initiatives are in place, such as an international
spouse program, and excellent on-campus children day care and
sports facilities.<br>
Information and application<br>
If you are interested in the postdoc position and would like to
apply, please send us your application by using the 'apply for
this job' button at the top of this page. Your application must
contain the following documents:<br>
<br>
A motivation letter describing your background and reasons for
applying for this position.<br>
A 1-page research statement describing research interests and
goals.<br>
A detailed CV including a publications list and overview of
presentations at scientific meetings.<br>
Names and contact information of two academic references.<br>
You can upload only 5 documents up to 2 MB each.<br>
Please send us your application before September 15th 2022; you
can only apply using the "Apply now button" on the website of the
Technical University of Eindhoven.<br>
Screening of applicants will start as soon as applications are
received and will continue until the position has been filled.<br>
<br>
About the research environment<br>
TU Eindhoven features a rich environment for algorithmic research.
The cluster Algorithms, Geometry, and Applications, including full
professors Mark de Berg and Bettina Speckmann investigates
(parameterized, approximation, and classic) algorithms for
problems in computational geometry and graph theory. The
Combinatorial Optimization group (prof. Frits Spieksma) focuses on
problems in scheduling and optimization. In addition, TU Eindhoven
is one of the four cornerstones of the NETWORKS project which
investigates algorithmic and stochastic problems on complex
networks. All combined, this research environment offers the
postdoctoral researcher interesting possibilities for
collaboration.<br>
<br>
About TU Eindhoven<br>
TU Eindhoven (TU/e) is a mid-size technical university located in
the heart of the high-tech industry in the Netherlands, named the
Brainport region. Eindhoven is the fifth largest city in the
Netherlands, and including suburbs it has about 420,000
inhabitants. TU/e is a highly ranked university both in research
and education. Our training and research programs are highly
regarded and we foster close relationships with companies,
organizations and research institutes in the Brainport region and
beyond. TU/e is a social and inspiring university with a fine
culture. You'll quickly feel at home, surrounded by people who
share your scientific ambitions. The TU/e currently has nine
departments, with over 11,000 students in total.<br>
<br>
More information<br>
Further information with respect to the positions can be obtained
from dr. Bart M. P. Jansen via email b.m.p.jansen[at]tue.nl<br>
Further information concerning employment conditions can be found
here or obtained from HR Services for Mathematics and Computer
Science viaemail HRServices.MCS[at]tue.nl.<br>
<br>
<br>
</div>
</body>
</html>