Lukas Retschmeier

activity

20242026

collaborators

Showing 2025Show all

3 papers · 1 filter

cs.CC2025

On the Parameterized Complexity of Semitotal Domination on Graph Classes

Lukas Retschmeier

For a given graph $G = (V, E)$ , a subset of the vertices $D \subseteq V$ is called a semitotal dominating set, if $D$ is a dominating set and every vertex $v \in D$ is within distan…

cs.DS2025

Revisiting a Successful Reduction Rule for Dominating Set

Lukas Geis, Alexander Leonhardt, Johannes Meintrup +3

Given a graph $G = (V, E)$ with $n$ vertices and $m$ edges, the DominatingSet problem asks for a set $D \subseteq V$ of minimal cardinality such that every vertex either is in $D$ …

cs.CR2025

Private Lossless Multiple Release

Joel Daniel Andersson, Lukas Retschmeier, Boel Nelson +1

Koufogiannis et al. (2016) showed a $gradual release$ result for Laplace noise-based differentially private mechanisms: given an $ε$ -DP release, a new release wi…