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

[Pekka Orponen]

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 June 2025 (negotiable).
The research interests of the group range from graph algorithms,
through game theory, mechanism design, combinatorial games, to classical
and parameterized complexity and integer linear programming.
The prospective mentors for the position are Tomáš Valla and Dušan Knop. The
main topic for the project is in the algorithmic and combinatorial game 
theory,
with extensions to related fields like approximation algorithms or 
parameterized
complexity.

The research group Graphs, Games, Optimization, Algorithms, and Theoretical
Computer Science (G2OAT) https://ggoat.fit.cvut.cz/index.html 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, 6 assistant professors,
4 postdocs, and 6 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
2750 EUR) (the Czech Republic's cost of living is at 66% of the US price 
level
according 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 applicants are expected to have a strong background in 
combinatorics, graph
theory, foundations of algorithmic game theory or combinatorial game theory.
Additionally, specialization in the following areas is a bonus: graph
algorithms, cops-and-robber-type problems, computational complexity or
approximation algorithms, Ramsey theory and positional games. 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
* have a strong publication record (with at least 3 publications in a 
journal
with IF), and
* be fluent in English (both written and spoken), prior knowledge of 
Czech is
not required.

The preliminary communication and informal inquiries containing the
applicant's CV and motivation letter should be sent to
Tomáš Valla tomas.valla at fit.cvut.cz.
The closing date for this communication is February 23, 2025.

The formal application procedure description will be sent to the applicant
by Tomáš Valla after a preliminary interview - the call is not yet
formally opened at the university webpages and it is to be opened soon.