"Extremal graph theory and its applications" funded by the Czech Science
Foundation. We are looking for candidateswith strong background in
extremal graph theory, theory of random graphs, or theory of graph
limits. The positions are available from 1.1.2016 for up to 3 years,
when the project ends. Possibility of part-time or short-time contract,
as well as student positions. 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 positions are open until the team capacity is
filled.
Please send your application with your CV and proof of education to
ics@cs.cas.cz<mailto:ics@cs.cas.cz>. We encourage prospective applicants
to contact the principal investigatorDiana Piguet
(piguet@cs.cas.cz)<mailto:piguet@cs.cas.cz> to discuss their research
interests before submitting their application.
--
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
