[DMANET] Postdoc position in Algorithms and Complexity at Oxford

A postdoc position is available in the Department of Computer Science at the University of Oxford as part of the ERC Starting Grant Power of Algorithms in Discrete Optimisation (PowAlgDO) led by Standa Zivny. The project focuses on establishing the power of convex relaxations (such as linear and semidefinite programming) for various classes of constraint satisfaction problems (CSPs) with respect to exact and approximate solvability. Strong candidates with any background will be considered but the ideal background is approximation algorithms, combinatorics, convex relaxations, or CSPs.

The position is available from 1 December 2018 (although a different start date can be negotiated) and will be for 2 years (with the possibility of extension until December 2021). The position comes with a travel support and no teaching duties. The postholder will be a member of Oxford's Algorithms and Complexity Theory Group. Salary £40,792 - £48,677 p.a.

The deadline is noon 31 October UK time.

More details can be found at http://www.cs.ox.ac.uk/news/1565-full.html
**********************************************************
*
* 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/
*
**********************************************************