Sebastian Siebertz

Kernelization and Sparseness: the Case of Dominating Set

We prove that for every positive integer

Dynamic definability

r

First-Order and Monadic Second-Order Model-Checking on Ordered Structures

and for every graph class

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs

\mathcal G

A Local Constant Factor MDS Approximation for Bounded Genus Graphs

of bounded expansion, the

The Generalised Colouring Numbers on Classes of Bounded Expansion

r

Graph Searching Games and Width Measures for Directed Graphs

-Dominating Set problem admits a linear kernel on graphs from

Distributed Domination on Graph Classes of Bounded Expansion

\mathcal G

On the generalised colouring numbers of graphs that exclude a fixed minor

. Moreover, when

Vertex Disjoint Paths in Upward Planar Graphs

\mathcal G