Stefan Lendl

activity

20172024

most citedCombinatorial Optimization Problems with Interaction Costs: Complexity and Solvable Cases

5 citations · 10 across the 9 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

cs.DS2018

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…

cs.DS2018★ 2 cited

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…

math.CO2018

On sequences covering all rainbow $k$ -progressions

Leonardo Alese, Stefan Lendl, Paul Tabatabai

Let $ac (n, k)$ denote the smallest positive integer with the property that there exists an $n$ -colouring $f$ of ${1, \dots, ac (n, k)}$ such that for every $k$ -subset $R…

Dispersing obnoxious facilities on a graph

On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games

On sequences covering all rainbow k-progressions

On sequences covering all rainbow $k$ -progressions