Konstantinos S. Stavropoulos

According to our database, Konstantinos S. Stavropoulos authored at least 8 papers between 2009 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Characterising bounded expansion by neighbourhood complexity.

Felix Reidl, Fernando Sánchez Villaamil, Konstantinos S. Stavropoulos

Eur. J. Comb., 2019

2018

Coloring and Covering Nowhere Dense Graphs.

Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos

SIAM J. Discret. Math., 2018

2017

The maximum k-differential coloring problem.

Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Konstantinos S. Stavropoulos, Sankar Veeramoni

J. Discrete Algorithms, 2017

A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs.

Nathan J. Bowler, Joshua Erde, Florian Lehner, Martin Merker, Max Pitz, Konstantinos S. Stavropoulos

Discret. Appl. Math., 2017

2016

Cops, Robber and Medianwidth Parameters.

Konstantinos S. Stavropoulos

CoRR, 2016

2015

On the Medianwidth of Graphs.

Konstantinos S. Stavropoulos

CoRR, 2015

Colouring and Covering Nowhere Dense Graphs.

Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2009

Outerplanar Obstructions for the Feedback Vertex Set.

Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos

Electron. Notes Discret. Math., 2009