The newly established Algorithms and Complexity Theory group headed by
Prof. Marvin Künnemann at TU Kaiserslautern invites applications for PhD
positions. The starting date is as soon as possible.
The group's research focuses on recent methods in fine-grained
complexity theory & algorithm design, giving exciting opportunities to
explore the complexity landscape of polynomial-time problems. This
includes both conditional lower bounds as well as algorithm design &
engineering informed by such lower bounds.
Topics include: fine-grained complexity theory, algorithm engineering,
graph algorithms, computational geometry, string algorithms, database
theory, multivariate and parameterized algorithms as well as algorithms
for large data sets.
Successful applicants will explore algorithmic barriers for
polynomial-time problems and/or engineer fast algorithms. Background in
competitive programming is appreciated, but not mandatory.
TU Kaiserslautern offers a strong research environment, an international
atmosphere and comfortable working & living conditions. There will be
possibilities for collaborations with other researchers, including
groups at Max Planck Institute for Software Systems and Max Planck
Institute for Informatics as well as institutions abroad.
The salary is according to TV-L E13 scale.
TU Kaiserslautern strongly encourages qualified female academics to
apply. It is a family-friendly university, which offers a high level of
support to applicants with children. Disabled applicants will be given
preference when equally qualified (please enclose evidence). TU
Kaiserslautern values the diversity of its members and enables equal
opportunities for all.
In case of questions, please feel free to contact Marvin Künnemann
(kuennemann@cs.uni-kl.de).
To apply, please send an e-mail to kuennemann@cs.uni-kl.de including a
CV, transcript of records, a thesis draft (if available) and a research
statement detailing your interests. Candidates will be considered until
the position is filled.
**********************************************************
*
* 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/
*
**********************************************************