We announce

ONE PHD POSITION (full)

at Technische Universität Berlin, Germany, at the Department of Mathematics.
The position is for three years, and it is part of the research
project “Combinatorial structures and algorithms in highly symmetric
graphs” funded by the German Research Foundation (DFG), headed by
Torsten Mütze (http://page.math.tu-berlin.de/~muetze). There is no
teaching obligation.

The position is within the Combinatorial Optimization and Graph
Algorithms Group headed by Martin Skutella
(https://www.coga.tu-berlin.de), with close links to the Discrete
Mathematics group headed by Stefan Felsner
(https://www3.math.tu-berlin.de/diskremath).

We expect that a candidate has a Master degree and a solid background
in discrete mathematics and the theory of algorithms. Ideally, the
applicant has knowledge in graph theory, combinatorial algorithms,
posets, polytopes, and/or combinatorial geometry.

Please send your application documents electronically as a single PDF
file consisting of
– motivation letter
– curriculum vitae
– the Master thesis (or a draft of it)
– copies of diplomas/certificates/grades
to muetze@math.tu-berlin.de
In addition, one letter of reference (recommendation letter) should be
sent directly to the same email address. The application deadline is
Friday, January 25, 2019.

Informal inquiries about the position can be directed at any time to
the same email address.

Torsten Mütze
Institut für Mathematik
Technische Universität Berlin
Straße des 17. Juni 136
10623 Berlin
Germany