We are seeking researchers/postdocs or PhD-intershipsto complement the
team for the junior project "Extremal graph theory and its applications"
funded by the Czech Science Foundation. We are looking for strong
candidates with background in extremal graph theory, theory of random
graphs, or theory of graph limits. The position isfromFebruary2017, or
later, till December 2017.There are no teaching duties. Among the
conditions imposed by the Czech Science Foundation there is an age limit
of 35 (with possible exceptions for well-documented maternity/parental
leave or long lasting illness).
The project takes place in Prague at the Institute of Computer Science
http://www.ustavinformatiky.cz/?id_jazyk=en&id_stranky=of the Czech
Academy of Sciences. The web-pages of the group can be found under the
following link http://uivty.cs.cas.cz/ExtrA.
Please send your application with your CV and proof of education to
ics@cs.cas.cz <mailto:ics@cs.cas.cz>. Informal inquires can be sent to
Diana Piguet (piguet@cs.cas.cz <mailto:piguet@cs.cas.cz>) or to Tuan
Tran (tran@cs.cas.cz <mailto:tran@cs.cas.cz>). The position isopen until
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
