Two PhD student positions in parametrized complexity, Berlin (Germany)

Two PhD positions are available in the DFG-funded Junior Research Group "Efficient preprocessing for hard problems" led by Stefan Kratsch at TU Berlin. Successful candidates will perform research on parameterized complexity and kernelization, and related topics. The main focus of research is on rigorous study of polynomial-time preprocessing for hard combinatorial problems.

The junior research group is associated with the "Algorithms and complexity" group chaired by Prof. Rolf Niedermeier. Both positions are fulltime for an intended length of 3 to 4 years, with an initial contract period of 2 years. There are no teaching obligations. The positions are available immediately. Starting salary is roughly 1800 Euros net (includes mandatory health insurance; 3000 Euros gross).

Interested applicants should send their application by December 1, 2012. For more information, see http://www.mpi-inf.mpg.de/~skratsch/positions.html or contact Dr. Stefan Kratsch at skratsch at mpi-inf.mpg.de.