27 citations · 104 across the 19 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CG2016★ 2 cited
Covering many points with a small-area box
Mark de Berg, Sergio Cabello, Otfried Cheong +2
Let be a set of points in the plane. We show how to find, for a given integer , the smallest-area axis-parallel rectangle that covers points of in $O(nk^2 \log…
cs.CG2016
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
Ulrike Große, Joachim Gudmundsson, Christian Knauer +2
We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We pr…