We welcome a new postdoc, Dr. Esther Galby, at our institute.
In the past years, Esther was working on her PhD thesis in Computer Science at the Universität des Saarlandes, Saarbrücken, and the Max-Planck-Institut für Informatik. Her main research interests lie in structural and algorithmic graph theory. At the Institute of Algorithms and Complexity, her research focuses on efficient algorithms to solve classical graph optimization problems.
We wish her best of success!
