19 citations · 41 across the 26 of their papers we have counts for
Showing 2017Show all
3 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…
math.CO2017
Maximal determinants of combinatorial matrices
Henning Bruhn, Dieter Rautenbach
We prove that whenever contains at most ones. We also prove an upper bound on the determinant of matrices with the -con…
math.CO2017
Frames, -paths and the Erdős-Pósa property
Henning Bruhn, Matthias Heinlein, Felix Joos
A key feature of Simonovits' proof of the classic Erdős-Pósa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this f…