for Parameterized Complexity" within the Algorithms and Complexity
Group at the Vienna University of Technology (TU Wien). The project
investigates the parameterized complexity of problems not only in the
traditional graph setting, but also in areas such as Artificial
Intelligence and Integer Linear Programming. The candidate will be
supervised by Robert Ganian (Project PI).
Applicants are expected to have excellent mathematical skills as well
as an interest and background in discrete algorithms.
The position should start in the second half of 2018 and is for up to
three years (the expected duration of the PhD program). The salary is
according to the FWF standard contracts for PhD candidates (approx.
EUR 38,000.00 gross, p.a.), which allows for a convenient life in
Vienna close to the city center.
The application should include the candidate's CV, an abstract of the
diploma/masters thesis, a short motivation letter, and two letters of
recommendation (all five items in a single pdf file; alternatively,
letters of recommendation may be sent directly by their authors). The
application should also mention possible starting dates and should be
sent to rganian@gmail.com by 30 April 2018.
Enquiries and questions about the position may also be sent to
rganian@gmail.com.
**********************************************************
*
* 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
