Konstantinos Stavropoulos

Sprechstunden:
By Appointment.

Teaching

• Vorlesung und Übung: Diskrete Mathematik.

• Übung: Mathematik für Physiker I.

• Vorlesung: Diskrete Mathematik.

• Übung: Mathematik für Physiker I.

• Vorlesung: Combinatorial Group Theory.

PhD Dissertation

• On Graph Sparsity and Structure: Colourings and Graph Decompositions

Publications and Preprints

• (with J. Rue and D. M. Thilikos) Outerplanar obstructions for a feedback vertex set, Eurocomb 2009 and European Journal of Combinatorics 33.5 (2012): 948-968 (Journal).
• (with M. Grohe, S. Kreutzer, R. Rabinovich, and S. Siebertz) Colouring and covering nowhere dense graphs, Graph-Theoretic Concepts in Computer Science. WG 2015. Lecture Notes in Computer Science, vol 9224. Springer, Berlin, Heidelberg (Proceedings/ArXiv).
  WG 2015 Best Paper Award.
• (with F. Reidl and F. Sanchez Villaamil) Characterising bounded expansion by neighbourhood complexity, submitted (ArXiv).
• On the medianwidth of graphs, submitted (ArXiv).
• Cops, robber and medianwidth parameters, submitted (ArXiv).
• (with M.A. Bekos, M. Kaufmann, S.G. Kobourov and S. Veeramoni) The maximum k-differential colouring problem, Journal of Discrete Algorithms, Volume 45, 2017, Pages 35-53, (Journal).
• (with N. Bowler, J. Erde, F. Lehner, M. Merker and M. Pitz) A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs, Discrete Applied Mathematics, Volume 229, 2017, Pages 151-153, (Journal/ArXiv).