The following doctoral projects have been successfully completed:

  • Katrin Casel Lower-Bounded Clustering - Models, Complexity and (Parameterised) Approximation defended on 21.03.2018
  • Meenakshi Paramasivan Operations on Graphs, Arrays and Automata defended on 25.09.2017
  • Anna Kasprzik Formal tree languages and their algorithmic learnability defended on 09.02.2012
  • Stefan Gulan On the Relative Descriptional Complexity of Regular Expressions and Finite Automata defended on 16.09.2011
  • Daniel Binkele-Raible Amortized Analysis of Exponential-Time and Parameterized Algorithms: Measure & Conquer and Reference Search Trees defended on 05.052010