2 citations · 4 across the 4 of their papers we have counts for
6 papers
Minimizing the Continuous Diameter when Augmenting a Geometric Tree with a Shortcut
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari +2
We augment a tree with a shortcut to minimize the largest distance between any two points along the resulting augmented tree . We study this problem in a continuous…
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari +1
We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize its continuous diameter, i.e., the largest network distance between any two points on the a…
A Lower Bound on Supporting Predecessor Search in sorted Arrays
Carsten Grimm
We seek to perform efficient queries for the predecessor among values stored in sorted arrays. Evading the lower bound from merging arrays, we support pre…
Efficient Farthest-Point Queries in Two-Terminal Series-Parallel Networks
Carsten Grimm
Consider the continuum of points along the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms…
A Note on the Unsolvability of the Weighted Region Shortest Path Problem
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari +2
Let S be a subdivision of the plane into polygonal regions, where each region has an associated positive weight. The weighted region shortest path problem is to determine a shortes…
Network Farthest-Point Diagrams
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel +5
Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shorte…