research group led by Assistant Professor Sebastian Forster at
University of Salzburg, Austria. The position is within the ERC-funded
project "Dynamic Algorithms Against Strong Adversaries" (DynASoAr). The
main goal of this project is to design new dynamic algorithms with
theoretical guarantees for fundamental graph problems.
* Requirements: PhD in computer science or mathematics with research
experience in graph algorithms
* Start date: Fall 2022, negotiable
* Application deadline: February 20, 2022. Late applications will be
considered until the position is filled.
If you are interested in this position, then please send your CV
including a list of publications, a short letter of motivation, and the
names of two references to forster@cs.sbg.ac.at. Please include the
words "application" or "postdoc" in the subject line. Inquiries about
the position, the goals of the project, and the research environment are
welcome as well.
**********************************************************
*
* 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/
*
**********************************************************