1 citations · 1 across the 3 of their papers we have counts for
4 papers
A New Model in Firefighting Theory
Rolf Klein, David Kübel, Elmar Langetepe +2
Continuous and discrete models for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexag…
Shortest-Path-Preserving Rounding
Herman Haverkort, David Kübel, Elmar Langetepe
Various applications of graphs, in particular applications related to finding shortest paths, naturally get inputs with real weights on the edges. However, for algorithmic or visua…
Geometric Firefighting in the Half-plane
Sang-Sub Kim, Rolf Klein, David Kübel +2
In 2006, Alberto Bressan suggested the following problem. Suppose a circular fire spreads in the Euclidean plane at unit speed. The task is to build, in real time, barrier curves t…
Optimal online escape path against a certificate
Elmar Langetepe, David Kübel
More than fifty years ago, Bellman asked for the best escape path within a known forest but for an unknown starting position. This deterministic finite path is the shortest path th…