Skip to main content

Jobs / Vacancies

We are hiring!

We are looking for new team members in the group of Theoretical Computer Science at the University of Potsdam. The starting date is negotiable.

Our group is interested in Algorithms and Complexity for problems involving graphs and/or geometry. This includes but is not limited to computational geometry, geometric graph theory, graph drawing and geometric optimization problems. We aim for a creative, collaborative, and fun environment where we strive to create fundamental breakthroughs in algorithms and complexity theory.

The position is full-time, includes teaching (in German), and the salary is in accordance with TVL-13.

What you should bring:

  • excellent master degree in computer science, mathematics, or a related field,
  • strong background in theoretical computer science, in particular in algorithms, complexity and discrete mathematics,
  • team spirit, and
  • enthusiasm in teaching.

Please reach out to Linda Kleist (kleistcs.uni-potsdamde) to learn more about these opportunities. For an application, send your CV, certificates, as well as a brief statement including your motivation and research interests.