only)
The Algorithms group at the University of Leeds (UK) is offering a fully
funded 3.5-year PhD studentship on Parameterized Complexity and
Approximation. Parameterized Complexity is a vastly growing area within
theoretical computer science that allows for the development of exact and
approximation algorithms for computationally hard problems by exploiting
the structure of inputs and doing a multivariate complexity analysis. The
goal of this project is to develop more efficient parameterized
approximation algorithms and preprocessing algorithms (also known as
kernelization) for a wide range of NP-hard graph problems.
Requirements: Applicants should have at least a first class or an upper
second class British Bachelors Honours degree (or equivalent) in an
appropriate discipline, i.e., computer science or mathematics. Applicants
are expected to have excellent mathematical skills as well as an interest
in discrete algorithms.
For details and application process please visit
https://www.findaphd.com/phds/project/phd-studentship-in-algorithms-and-complexity/?p181498
Contact details: Fahad Panolan (f.panolan@leeds.ac.uk)
**********************************************************
*
* 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
