8 citations · 66 across the 52 of their papers we have counts for
5 papers · 1 filter
Neighborhood complexity and kernelization for nowhere dense classes of graphs
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer +4
We prove that whenever is a graph from a nowhere dense graph class , and is a subset of vertices of , then the number of subsets of that are realized as…
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes
Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Nowhere dense classes of graphs are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations. From an algorithmic perspective, a character…
The Generalised Colouring Numbers on Classes of Bounded Expansion
Stephan Kreutzer, Michał Pilipczuk, Roman Rabinovich +1
The generalised colouring numbers , , and were introduced by Kierstead and Yang as generalisations of the usual colouring…
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-kn…
On the Generalised Colouring Numbers of Graphs that Exclude a Fixed Minor
Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz +2
The generalised colouring numbers and were introduced by Kierstead and Yang as a generalisation of the usual colouring number, and have sin…