Author

S. Siebertz

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors

For every fixed proper minor-closed class $\mathscr C$ and every $\epsilon>0$, we give a deterministic LOCAL algorithm that returns a dominating set of size at most $(2a(\mathscr C)+1+\epsilon)\gamma_f(G)$ on every $G\in\mathscr C$. Here $a(\mathscr C)$ is the supremum edge-to-vertex ratio in $\mathscr C$, and $\gamma_...

S. Amiri, S. Siebertz · 0 citations

#edge computing Preprint Oct 2026

A Logic for Minor-Free Graph Classes: Model Checking, Dependence, and Combinatorial Reconfiguration

It is shown that for every weakly sparse graph class $\mathscr C$, the class $\mathscr C_Z$ is monadically dependent for $\textsf{FOscon}$ if and only if $\mathscr C$ excludes a fixed minor.

Nikolas Mählmann, Patrice Ossona de Mendez, Nicole Schirrmacher et al. · 0 citations

Preprint Sep 2026

On the Parameterized Complexity of Coloring Discovery

Coloring Discovery asks whether a possibly improper initial coloring can be made proper within a prescribed number of allowed changes. We study the parameterized complexity of three modification step models that were studied previously in the literature: recoloring one vertex (color flipping), swapping the colors of ar...

Eric L. Decker, S. Siebertz · 0 citations