[DMANET] PhD positions in Algorithms and Complexity (Durham University, UK)

A number of funded PhD positions (subject to eligibility) starting in October 2018 are available in the Algorithms and Complexity Group (ACiD) of the Department of Computer Science at Durham University.

ACiD is a broad-based theoretical computer science research group working in computational complexity, proof complexity, descriptive complexity, graph theory, exact algorithms, randomised algorithms, approximation algorithms, parameterized algorithms, finite model theory, constraint satisfaction, interconnection networks, universal algebra and mathematical logic, see http://community.dur.ac.uk/algorithms.complexity/ for further details.

Details of the application process can be found at https://www.dur.ac.uk/computer.science/postgraduate/research/. As part of the application process, interested candidates should first email to algorithms.complexity@dur.ac.uk or contact a member of ACiD directly in order to discuss a possible PhD project. For a list of ACiD members see http://community.dur.ac.uk/algorithms.complexity/people.html, and for a list of examples of possible PhD projects see http://community.dur.ac.uk/algorithms.complexity/projects.html.

Applications are admitted until 14 January 2018.
**********************************************************
*
* 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/
*
**********************************************************