http://uivty.cs.cas.cz/ExtrA/people.html) for the project "Embedding,
Packing and Limits in Graphs" funded by the Czech Science Foundation.
The candidates should have a strong background in extremal graph theory,
probabilistic method, or theory of graph limit and should have obtained
their PhD after December 2010 (maternity, parental and sick leave can be
taken into consideration). The position is full-time until December
2021, when the project ends. The starting date is upon agreement.
Part-time position can be considered. Gross salary is 38000 – 40000
CZK/month depending on the experience and the expertise of the applicant
(see https://www.numbeo.com/cost-of-living/comparison.jsp). There are no
teaching duties and there is support for travel. The position is in the
beautiful city of Prague at the Institute of Computer Science of the
Czech Academy of Sciences.
For more information, please refer to our webpage
(http://uivty.cs.cas.cz/ExtrA/index.html), and/or contact the main
investigator Diana Piguet (piguet@cs.cas.cz <mailto:piguet@cs.cas.cz>).
Please send your application with your CV, a proof of education, to
ics@cs.cas.cz <mailto:ics@cs.cas.cz> and arrange for two reference
letters to the same address. The closing date is July 31, 2020, or until
the position is filled.
**********************************************************
*
* 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/
*
**********************************************************
Posts
