5 citations · 9 across the 14 of their papers we have counts for
17 papers
Online Competitive Searching for Rays in the Half-plane
Elmar Langetepe, Florian Gans
We consider the problem of searching for rays (or lines) in the half-plane. The given problem turns out to be a very natural extension of the cow-path problem that is lifted into t…
NP-hardness and a PTAS for the Euclidean Steiner Line Problem
Simon Bartlmae, Paul J. Jünger, Elmar Langetepe
The Euclidean Steiner Tree Problem (EST) seeks a minimum-cost tree interconnecting a given set of terminal points in the Euclidean plane, allowing the use of additional intersectio…
Simple Grid Polygon Online Exploration Revisited
Maximilian Brock, Martin Brückmann, Elmar Langetepe +1
Due to some significantly contradicting research results, we reconsider the problem of the online exploration of a simple grid cell environment. In this model an agent attains loca…
Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface
Annika Bonerath, Anne Driemel, Jan-Henrik Haunert +3
In this paper, we analyze the approximation quality of a greedy heuristic for automatic map labeling. As input, we have a set of events, each associated with a label at a fixed pos…
Minimum-Error Triangulations for Sea Surface Reconstruction
Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert +6
We apply state-of-the-art computational geometry methods to the problem of reconstructing a time-varying sea surface from tide gauge records. Our work builds on a recent article by…
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…