Tuesday, April 11, 2017

[DMANET] An Assistant professor position in computer science in Prague

Applications are invited for a 3-year position as Assistant Professor in
Computer Science with specialization in Structural Combinatorics at the
Department of Applied Mathematics (KAM), Faculty of Mathematics and
Physics, Charles University in Prague, Czech Republic, with the
possibility of renewal and shift to tenure track.

Candidates should have a PhD in Mathematics, Computer Science or
Operations Research, and demonstrate strong potential for excellence in
research.

The successful candidate will be expected to conduct research related to
structural combinatorics, graph theory, design and analysis of
algorithms.

The successful applicant will teach in English and within three years
also in Czech, topics mainly from discrete mathematics and computer
science. Good knowledge of Czech is advantageous but not necessary.

Desirable are a previous postdoc in combinatorics and strong background
in graph theory and computer science.

Signed application in digital form, accompanied by a motivation letter,
curriculum vitae, proof of education, list of publications, and a
description of pedagogical experience should be sent to the Department
of human resources jancak@dekanat.mff.cuni.cz
by May 11, 2017. The candidates should also arrange for two
recommendation letters to be sent electronically to
Martin Loebl (head of KAM) loebl@kam.mff.cuni.cz
Selected candidates will be invited for interview in May.

Department web page:
http://kam.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/
*
**********************************************************