<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] A postdoctoral position at the Czech Technical
University in Prague</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Fri, 27 May 2022 15:27:19 +0200</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Dusan Knop <a class="moz-txt-link-rfc2396E" href="mailto:knop@kam.mff.cuni.cz"><knop@kam.mff.cuni.cz></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>
A roughly 16 months full-time postdoc position is available in the<br>
G2OAT research group at the Czech Technical University in Prague<br>
(CTU), The Czech Republic with a preferred starting date of
October<br>
2022 (slightly negotiable). The research interests of the group
range<br>
from graph<br>
algorithms, through classical and parameterized complexity and
integer<br>
linear programming to combinatorial games. The prospective mentor
for<br>
the position is DuĊĦan Knop. The main topic for the project is in
the<br>
intersection of parameterized complexity and computational social<br>
choice.<br>
<br>
The research group Graphs, Games, Optimization, Algorithms, and<br>
Theoretical Computer Science (G2OAT) is a part of the Department
of<br>
Theoretical Computer Science at the Faculty of Information
Technology<br>
at CTU. The department also includes Stringology and Arborology<br>
research groups. The G2OAT research group is rather small,
comprising<br>
2 associate professors, 2 assistant professors, 2 postdocs, and 4<br>
Ph.D. students. A successful candidate will work at CTU's main
campus<br>
which features a range of amenities such as the National Technical<br>
Library, and a laid-back atmosphere with cafes and other social<br>
hangout places.<br>
<br>
The successful candidate will get a monthly salary of 65 thousand
CZK<br>
(about 2500 EUR) (the Czech Republic's cost of living is at 68% of
the<br>
US price level to the OECD statistics). There are no teaching
duties<br>
associated with this position. These positions are institutionally<br>
funded, i.e., funded by the Czech Technical University in Prague.<br>
<br>
We are seeking highly motivated individuals holding a Ph.D. in<br>
computer science, discrete mathematics, or related areas. The
ideal<br>
candidate is familiar with several of the following areas:<br>
Parameterized complexity, integer linear programming, structural
graph<br>
theory, game<br>
theory, and computational social choice. Experience in
optimization<br>
and in particular approximation algorithms or hardness of<br>
approximation is appreciated but not required. The candidate's
high<br>
scientific potential should be witnessed by publications in the
area<br>
of algorithms or discrete math in impacted journals and in
proceedings<br>
of highly ranked international conferences.<br>
<br>
The successful candidate must:<br>
<br>
* Be a researcher who has received a Ph.D. or its equivalent
within<br>
the last 7 years or is close to receiving one,<br>
* have a strong publication record (with at least two publications
in<br>
a journal with IF), and<br>
* be fluent in English (both written and spoken), prior knowledge
of<br>
Czech is not required.<br>
<br>
The closing date is June 15, 2022.<br>
<br>
The candidate should send a CV and a recommendation letter, which
can<br>
be either attached to the application or sent directly by the<br>
recommender to <a class="moz-txt-link-abbreviated" href="mailto:dusan.knop@fit.cvut.cz">dusan.knop@fit.cvut.cz</a>.<br>
<br>
Interested candidates are encouraged to make informal inquiries to
the<br>
above address.<br>
<br>
</div>
</body>
</html>