Îçҹ̽»¨

Dr. Michael Gentner

Wintersemester 2017/18

• Angewandte Diskrete Mathematik
• Kombinatorik

Wintersemester 2016/17

• Advanced Discrete Algorithms
  

Sommersemester 2016

• Angewandte Operations Research
  (Modul der School of Advanced Professional Studies)
  

Wintersemester 2015/16

• Angewandtes Operations Research

Sommersemester 2015

• Graph Theory II

• with M. Fürst, , S. Jäger, D. Rautenbach, Equating k Maximum Degrees in Graphs without Short Cycles,
• with , S. Jäger, D. Rautenbach, Large Values of the Clustering Coefficient,
• with D. Rautenbach, Some Comments on the Slater number,
• with D. Rautenbach, Some Bounds on the Zero Forcing Number of a Graph,
• with D. Rautenbach, Dynamic Monopolies for Degree Proportional Thresholds in Connected Graphs of Girth at least Five and Trees,
• with L. Penso, D. Rautenbach, and , Extremal Values and Bounds for the Zero Forcing Number,
• with , D. Rautenbach, Smallest Domination Number and Largest Independence Number of Graphs and Forests with given Degree Sequence,
• with , D. Rautenbach, Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence,
• with , C. Löwenstein, D. Rautenbach, Independence in Uniform Linear Triangle-Free Hypergraphs,
• with D. Rautenbach, Feedback vertex sets in cubic multigraphs,