team(http://uivty.cs.cas.cz/ExtrA/people.html)for the project
"Embedding, Packing and Limits in Graphs" funded by the Czech Science
Foundation. The candidatesshould have strong background in extremal
graph theory, probabilistic method, or theory of graph limits and should
have obtained their PhD after December 2010 (maternity, parental and
sick leave can be taken into consideration). The position is full-time
from April1, 2019(starting date is negotiable) until December 2021,when
the project ends (part-time position can be considered). Gross salary is
38000 – 40000 CZK/month
(seehttps://www.numbeo.com/cost-of-living/comparison.jsp)There areno
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), 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> andarrange fortwo reference
lettersto the same address. The closing date is January 20,2019.
Kind regards,
Diana Piguet
--
Diana Piguet
Institute of computer science
Czech Academy of Sciences
Pod Vodárenskou věží 271/2
182 07 Praha 8
**********************************************************
*
* 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
