Oliver Schaudt

activity

20132020

most citedA Note on Connected Dominating Set in Graphs Without Long Paths And Cycles

3 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.DS2017

Fast Algorithms for Delta-Separated Sparsity Projection

Henning Bruhn, Oliver Schaudt

We describe a fast approximation algorithm for the $Δ$ -separated sparsity projection problem. The $Δ$ -separated sparsity model was introduced by Hegde, Duarte and Cevher (2009) to…

cs.CC2017

The Parameterized Complexity of the Equidomination Problem

Oliver Schaudt, Fabian Senger

A graph $G = (V, E)$ is called equidominating if there exists a value $t \in N$ and a weight function $ω : V \to N$ such that the total weight of a subset $D\…