Required are a PhD degree in Computer Science or related area and excellent knowledge of algorithms and complexity, preferably in the setting of parameterized complexity and fixed-parameter tractability. Some background in graph theory, combinatorics, satisfiability, computational logic, or constraint satisfaction is of advantage.
The position is research-only, but interested candidates have the opportunity get involved in teaching.
Applications must be made by September 27, 2019, via this online form: https://form.jotformeu.com/szeider/fpt-postdoc
The application should include the candidate's CV, an abstract of their PhD thesis, a motivation letter, and a list of three references.
Informal inquires by email are welcome.
**********************************************************
*
* 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
