Heiko Röglin

Teaching at the University of Bonn

Teaching at Maastricht University

Teaching (Assistance) at RWTH Aachen University

Supervised Theses

  • Implementierung und Visualisierung von Algorithmen zur Minimierung endlicher Automaten
    Frantisek Baluska, Bachelor Thesis, University of Bonn, October 2014.
  • Experimentelle Analyse der Komplexität von Mean Payoff Spielen
    Katharina Bauer, Bachelor Thesis, University of Bonn, October 2014.
  • On Pareto-optimal Solutions in Multi-objective Optimization
    Yannik Lobsensky, Master Thesis, University of Bonn, September 2014.
  • Advice-Komplexität des k-Server-Problems
    Geraldine Reichard, Bachelor Thesis, University of Bonn, September 2014.
  • Minimierung der Diskrepanz eines Mengensystems
    Oliver Scharf, Diploma Thesis, University of Bonn, August 2014.
  • Verbesserung der Analyse der geglätteten Komplexität des k-Means-Algorithmus
    Carsten Oliver Fischer, Bachelor Thesis, University of Bonn, August 2014.
  • Rucksackproblem mit unbekannter Kapazität
    Bastian Braun, Bachelor Thesis, University of Bonn, July 2014.
  • Smoothed Analysis of the SSP Algorithm and Local Search
    Clemens Rösner, Master Thesis, University of Bonn, March 2014.
  • Smoothed Analysis of the Simplex Method
    Martin Licht, Diploma Thesis, University of Bonn, November 2013.
  • Kompetitive Analyse des Economical-Caching-Problems
    Katharina Reichel, Bachelor Thesis, University of Bonn, November 2013.
  • Probabilistische Analyse der Qualit├Ąt einfacher Scheduling-Algorithmen
    Michael Etscheid, Bachelor Thesis, University of Bonn, March 2013.
  • Analyse des Winner-Gaps
    Florian Liss, Diploma Thesis, University of Bonn, January 2013.
  • Theoretical Analysis of Certain Clustering Problems with Applications in Biology
    Elena-Madalina Cososchi, Bachelor Thesis, University of Bonn, March 2012.
  • Local Media Intelligence
    Yanick Slikboer, Master Thesis, Maastricht University, March 2011.
  • Experimental Evaluation of the k-Means Method
    Jan Mittelstädt, Bachelor Thesis, Maastricht University, June 2010.
  • Probabilistische Analysen zu Branch-and-Bound-Verfahren für das Rucksackproblem
    Matthias Botzen, Diploma Thesis, RWTH Aachen, April 2008.
  • Exact Algorithms for the Multiple Choice Knapsack Problem
    Jan Dominik Rose, Diploma Thesis, RWTH Aachen, February 2008.
  • Online-Algorithmen für die Steuerung des Motor-Lichtmaschine-Systems
    Jacob Spönemann, Diploma Thesis, RWTH Aachen, January 2008.
  • Computing Approximate Equilibria in Network Congestion Games
    Andreas Emil Feldmann, Diploma Thesis, RWTH Aachen, October 2007.
  • Experimentelle Untersuchungen zu Probabilistischen Instanzen für das Rucksack-Problem
    Falk Sperber, Diploma Thesis, RWTH Aachen, October 2005.