Our group is interested in Algorithms and Complexity for problems involving graphs and/or geometry. This includes but is not limited to computational geometry, geometric graph theory, graph drawing and geometric optimization problems
We aim for a creative, collaborative, and fun environment where we strive to create fundamental breakthroughs in algorithms and complexity theory.
The position is full-time, includes teaching (in German), and the salary is in accordance with TVL-13.
What you should bring:
- excellent master degree in computer science, mathematics, or a related field,
- strong background in theoretical computer science, in particular in algorithms, complexity and discrete mathematics,
- team spirit, and
- enthusiasm in teaching.
Please reach out to Linda Kleist (kleist@cs.uni-potsdam.de ) to learn more about these opportunities. For an application, send your CV, a brief statement including your motivation and research interests, as well as certificates by 15.09.24 (later applications may still be considered until position is 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
