[Job-offers-cs] Two 2-year postdoc positions in Theoretical Computer Science at CTU Prague

[Pekka Orponen]

-------- Forwarded Message --------

Subject: 	[DMANET] Two 2-year postdoc positions in Theoretical Computer 
Science at CTU Prague
Date: 	Thu, 29 Jul 2021 12:50:26 +0200
From: 	Dusan Knop <knop at kam.mff.cuni.cz>
To: 	dmanet at zpr.uni-koeln.de



Two 2-year full-time postdoc positions are available in the G2OAT
research group at the Czech Technical University in Prague (CTU),
Czech Republic with preferred starting date January 2022 (slightly
negotiable). The research interests of the group range from graph
algorithms, through classical and parameterized complexity and integer
linear programming to combinatorial games. The prospective mentors of
the positions are Ondřej Suchý and Dušan Knop.

The research group Graphs, Games, Optimization, Algorithms and
Theoretical Computer Science (G2OAT) is a part of the Department of
Theoretical Computer Science at the Faculty of Information Technology
at CTU. The department also includes Stringology and Arborology
research groups. The G2OAT research group is rather small, comprising
1 associate professor, 2 assistant professors, 2 postdocs and 4 Ph.D.
students. A successful candidate will work at CTU's main campus which
features a range of amenities such as the National Technical Library,
and a laid-back atmosphere with cafes and other social hangout places.

Successful candidates will get a monthly salary of 65 thousand CZK
(about 2500 EUR) (the Czech Republic cost of living is at 68% of the
US price level by OECD statistics). There are no teaching duties
associated with this position. These positions are institutionally
funded, i.e., funded by the Czech Technical University in Prague.

We are seeking highly motivated individuals holding a PhD in computer
science, discrete mathematics, or related areas. The ideal candidate
is familiar with several of the following areas: Parameterized
complexity, integer linear programming, structural graph theory, game
theory, computational social choice. Experience in optimization and in
particular approximation algorithms or hardness of approximation is
appreciated but not required. The candidate's high scientific
potential should be witnessed by publications in the area of
algorithms or discrete math in impacted journals and in proceedings of
highly ranked international conferences.

The successful candidate must:

* be a researcher who has received a PhD or its equivalent within the
last 7 years or be close to receive one,
* have a strong publication record (with at least two publications in
a journal with IF), and
* be fluent in English (both written and spoken), prior knowledge of
Czech is not required.

Further details about the positions and application process can be found at
https://old.fit.cvut.cz/en/postdoc-positions>(topics 3 and 9).

We prefer candidates to have a recommendation letter, which can be
either attached to the application or sent directly by the recommender
to ondrej.suchy at fit.cvut.cz or dusan.knop at fit.cvut.cz.

Interested candidates are encouraged to make informal inquiries to the
above addresses.

-------------- next part --------------
An HTML attachment was scrubbed...
URL: https://list.aalto.fi/pipermail/job-offers-cs/attachments/20210731/9328d630/attachment-0001.htm