The Max Planck Institute for Informatics seeks a Group Leader for the Algorithms
and Complexity Department (directed by Kurt Mehlhorn). The department currently
conducts research in the areas foundations and discrete mathematics,
combinatorial optimization, bio-inspired computation, computational geometry,
computer algebra, algorithmic game theory, and software libraries. More
information can be found at http://www.mpi-inf.mpg.de/departments/d1.
This is a five-year appointment at the W2 level, which is roughly equivalent to
the assistant or associate professor level in the US system. All of our previous
Group Leaders have secured tenured professorships during their time at the
Institute. The primary criterion for selection is the ability to conduct
high-quality internationally recognized research in algorithms or complexity.
Please include your curriculum vitae, three selected publications, referee
contact details, and a 2500 word research statement. Applications should be sent
as a single pdf-file to d1-office@mpi-inf.mpg.de. The deadline for applications
is October 30th, 2013.
For further information regarding the position, please contact Kurt Mehlhorn
(mehlhorn@mpi-inf.mpg.de).
**********************************************************
*
* 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/
*
**********************************************************