[DMANET] Post-doc positions at University of Regensburg

The newly founded Algorithms and Complexity Theory group at University of Regensburg is looking for post-docs in the areas of counting complexity and algebraic complexity, with a particular focus on graph homomorphism counts and parameterized aspects. The positions are funded by the ERC Starting Grant COUNTHOM, which studies fundamental computational problems through the lens of graph homomorphisms. This approach has already led to surprising algorithms and complexity results.

The application deadline is February 6, 2024. The initial contract term is one year, with the possibility for extension.

For more information, please consider
https://www.uni-regensburg.de/informatics-data-science/algorithms-complexity-theory/jobs
and/or contact Radu Curticapean <radu.curticapean@ur.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/
*
**********************************************************