54 citations · 62 across the 10 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 2 cited
Space-Efficient Plane-Sweep Algorithms
Amr Elmasry, Frank Kammer
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of items and that the available wo…
cs.DS2015★ 54 cited
On Temporal Graph Exploration
Thomas Erlebach, Michael Hoffmann, Frank Kammer
A temporal graph is a graph in which the edge set can change from one time step to the next. The temporal graph exploration problem TEXP is the problem of computing a foremost expl…