000Sommersemester 2009: Seminar Ausgewählte Kapitel der Informatik (Assistenz)
Wintersemester 2008/2009: Vorlesung Informatik II (Assistenz)
(Co-)Supervision (excerpt)
Masterthesis Bounding the difference between the maximum degree and the clique cover number
Department for Computer Science, University of Cologne, 2015
Masterthesis Vererbende Graphklassen mit beschränkter Differenz des Maximalgrads und der Stabilitätszahl
Department for Computer Science, University of Cologne, 2015
Bachelorthesis on Optimization problems in dotted intervall graphs
Department for Computer Science, University of Cologne, 2015
Diplomathesis Graphen, in denen die Differenz von Maximalgrad und Cliquenzahl höchstens 2 ist
Department for Computer Science, University of Cologne, 2015
Talks (excerpt)
Oberseminar 2015, Chair of Management Science, RWTH Aachen University:
000Graphen, in denen der Abstand zwischen dem Maximalgrad und der Cliquenzahl beschränkt ist
KOLKOM 2014 - Colloquium on Combinatorics:
000On bounding the maximum degree by a monotone graph parameter
Oberseminar 2011, Department for Computer Science, University of Cologne:
000Graphen,
in denen die Differenz zwischen dem Maximalgrad und der Cliquenzahl durch eine Konstante
beschränkt ist
HEREDITARNIA 2011:
000 Reed-perfect graphs
CID 2011 - Colouring, Independence, and Domination:
000 Graphs in which the difference between the the maximum degree and the maximum clique is bounded
by a constant
KOLKOM 2010 - Colloquium on Combinatorics:
000In search of counterexamples to Reed's Conjecture that are minimal or regular
ODSA 2010 - Optimal Discrete Structures and Algorithms:
000On minimal counterexamples to Reed's Conjecture
FRICO 2010 - Future Research in Combinatorial Optimization:
000On Reed's Conjecture
CTW 2010 - Cologne Twente Workshop:
000On Reed's Conjecture in triangle-free graphs
FRICO 2009 - Future Reseach In Combinatorial Optimization:
000Über die Reed'sche Vermutung in dreiecksfreien Graphen
000(Best Student Talk Award)