2 citations · 4 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024
Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
Matthias Bentert, Klaus Heeger, Tomohiro Koana
We study the computational complexity of several polynomial-time-solvable graph problems parameterized by vertex integrity, a measure of a graph's vulnerability to vertex removal i…
cs.DS2023★ 2 cited
Threshold Testing and Semi-Online Prophet Inequalities
Martin Hoefer, Kevin Schewior
We study threshold testing, an elementary probing model with the goal to choose a large value out of i.i.d. random variables. An algorithm can test each variable once for…
cs.DS2019★ 2 cited
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters
Matthias Bentert, Klaus Heeger, Dušan Knop
In the presented paper we study the Length-Bounded Cut problem for special graph classes as well as from a parameterized-complexity viewpoint. Here, we are given a graph , two v…