5 citations · 6 across the 4 of their papers we have counts for
4 papers · 1 filter
Assistance and Interdiction Problems on Interval Graphs
Hung P. Hoang, Stefan Lendl, Lasse Wulf
We introduce a novel framework of graph modifications specific to interval graphs. We study interdiction problems with respect to these graph modifications. Given a list of origina…
An Investigation of the Recoverable Robust Assignment Problem
Dennis Fischer, Tim A. Hartmann, Stefan Lendl +1
We investigate the so-called recoverable robust assignment problem on balanced bipartite graphs with vertices, a mainstream problem in robust optimization: For two given linea…
Dispersing obnoxious facilities on a graph
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl +1
We study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal i…
On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games
Ante Ćustić, Stefan Lendl
We introduce a simplified model for platform game levels with falling platforms based on interval graphs and show that solvability of such levels corresponds to finding Steiner cyc…