2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.CG2020★ 2 cited
Computing the Fréchet distance of trees and graphs of bounded tree width
Maike Buchin, Amer Krivošija, Alexander Neuhaus
We give algorithms to compute the Fréchet distance of trees and graphs with bounded tree width. Our algorithms run in time for trees of bounded degree, and $O(n^2\sqrt{n \…
cs.CG2020★ 2 cited
On the complexity of the middle curve problem
Maike Buchin, Nicole Funk, Amer Krivošija
For a set of curves, Ahn et al. introduced the notion of a middle curve and gave algorithms computing these with run time exponential in the number of curves. Here we study the com…
cs.CG2019
Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
Amer Krivošija, Alexander Munteanu
We study a variant of the median problem for a collection of point sets in high dimensions. This generalizes the geometric median as well as the (probabilistic) smallest enclosing…