[Job-offers-cs] A postdoctoral position at the Czech Technical University in Prague

[Pekka Orponen]

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

Subject: 	[DMANET] A postdoctoral position at the Czech Technical 
University in Prague
Date: 	Fri, 28 Oct 2022 12:39:06 +0000
From: 	Suchy, Ondrej <Ondrej.Suchy at fit.cvut.cz>
To: 	dmanet at zpr.uni-koeln.de <dmanet at zpr.uni-koeln.de>



A one-year full-time postdoc position (with probable extension) is 
available in the G2OAT research group at the Czech Technical University 
in Prague (CTU), Czech Republic with a preferred starting date of 
January 2023 (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 mentor for the position is Ondřej Suchý. The main topic for 
the project is in the
intersection of parameterized complexity and computational social choice.

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 2 associate 
professors, 2 assistant professors, 3 postdocs, and 3 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.

The successful candidate will get a monthly salary of 65 thousand CZK 
(about 2500 EUR) (the Czech Republic's cost of living is at 66% of the 
US price level to the OECD statistics). There are no teaching duties 
associated with this position. The position is institutionally funded, 
i.e., funded by the Czech Technical University in Prague.

We are seeking highly motivated individuals holding a Ph.D. in computer 
science, discrete mathematics, or related areas. The ideal candidate is 
familiar with several of the following areas: Parameterized complexity, 
structural graph theory, game theory, and 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 Ph.D. or its equivalent within the 
last 7 years or is very close to receiving 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.

The closing date is November 20, 2022.

The candidate should send a CV and a recommendation letter, which can be 
either attached to the application or sent directly by the recommender 
to ondrej.suchy at fit.cvut.cz.

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

-------------- next part --------------
An HTML attachment was scrubbed...
URL: https://list.aalto.fi/pipermail/job-offers-cs/attachments/20221029/84aed177/attachment-0001.htm