To content
Department of Com­pu­ter Science
LS 2 - Efficient Algorithms and Complexity Theory

Prof. (apl.) Dr. Beate Bollig


Research interests: 
computational complexity and design and analysis of efficient algorithms

Awards:

  • Teaching award 2019 at TU Dortmund (category II)
  • Teaching award 2006 at TU Dortmund (joint prize awarded to the chair of Prof. Dr. Ingo Wegener)
  • Dissertation prize at TU Dortmund (computer science)
  • Hans-Uhde award for the best diploma in computer science at TU Dortmund

Mentoring

The Mentoring program in computer science was awarded in 2018.

Projects (DFG) (in German)

  • Entwurf und Analyse impliziter BDD-basierter Graphalgorithmen (DFG BO 2755/1-1 and BO 2755/1-2)
  • Theoretische Analyse der Robustheit stochastischer Optimierungsprozesse (DFG WE 1066/11)

Additional information

Publications