A one-year postdoc position (with a possibility of extension) is offered at
Computer Science Institute of Charles University (https://www.mff.cuni.cz/en/iuuk).
The (negotiable) starting date: September 1, 2021.
The position is funded by the "Algorithms and Complexity within and beyond
Bounded Expansion" project; the candidates are expected to have a background in
structural, geometric, and/or algorithmic graph theory.
The candidates must have a Ph.D. degree in mathematics or theoretical computer
science completed within the last 4 years (with exceptions for individual
circumstances such as parental leave) or be expected to obtain the degree by
the starting date of the position.
The application should contain:
* A short letter of motivation.
* Professional CV (including the list of publications).
* Two letters of recommendation.
Application deadline: March 1, 2021.
Inquiries and applications should be sent to Zdeněk Dvořák <rakdver@iuuk.mff.cuni.cz>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************