A 2-year postdoc position in algorithms and complexity is available with Rahul Santhanam at the University of Oxford. Applicants must have a PhD in theoretical computer science or mathematics, with experience in complexity theory and/or parameterized algorithms and exact algorithms for NP-hard problems.
The CS department at TU Dortmund searches for a junior professor in algorithms theory.
The position is initially for three years with the possibility of extension for another
three years after a positive evaluation. There is no tenure or tenure track option. The
candidate must be fluent in German or English. Official announcement (in German; apologies) see below.