Several one‐year post‐doc positions are available at the Computer Science Institute of Charles University, with a possibility of one-year extension. The positions are in areas of algorithms, cryptography, computational complexity, combinatorics, graph theory and networks. Applicable hosts are:

- Zdeněk Dvořák (graph theory and algorithms)
- Andreas Feldmann (algorithms and parametrized complexity)
- Pavel Hubáček (cryptography and computational complexity)
- Vít Jelínek (combinatorics and graph theory)
- Michal Koucký (algorithms and computational complexity)
- Martin Koutecký (algorithms and parametrized complexity)
- Jaroslav Nešetřil (network science)
- Irena Penev (combinatorics and graph theory)
- Jiří Sgall (algorithms and computational complexity)
- Robert Šámal (combinatorics and graph theory)

**Starting date:** Fall 2019 or beginning of 2020.

The application should indicate the area of interest and contain:

- Short letter of motivation (research statement),
- Professional CV (including the list of publications),
- Two letters of recommendation.

**Application deadline:** February 28, 2019.

The application and the recommendation letters should be sent electronically to: `positions@iuuk.mff.cuni.cz`.
Inquires about the positions can be directed to `koucky@iuuk.mff.cuni.cz`.