[DMANET] POSTDOC POSITIONS IN ALGORITHMS AND COMPLEXITY AT OXFORD

Two postdoc positions are 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 will run from 01/2017 to 12/2021 and will focus 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.

The positions are available from 1 January 2017 (or later) and will be for 3 years (with the possibility of extension). The positions comes with a travel support and no teaching duties (but the possibility of doing some teaching). The postholders will be members of Oxford's Algorithms and Complexity Theory Group.

The deadline is 30 November. Interviews will be held on 15 December.

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