research
∙
03/03/2022
Efficient Fréchet distance queries for segments
We study the problem of constructing a data structure that can store a t...
share
research
∙
02/25/2022
The k-outlier Fréchet distance
The Fréchet distance is a popular metric for curves; however, its bottle...
research
∙
12/01/2021
Approximating Length-Restricted Means under Dynamic Time Warping
We study variants of the mean problem under the p-Dynamic Time Warping (...
research
∙
04/19/2021
Coresets for (k, ℓ)-Median Clustering under the Fréchet Distance
We present an algorithm for computing ϵ-coresets for (k, ℓ)-median clust...
research
∙
03/16/2021
Decomposing Polygons into Fat Components
We study the problem of decomposing (i.e. partitioning and covering) pol...
research
∙
09/03/2020
Approximating (k,ℓ)-Median Clustering for Polygonal Curves
In 2015, Driemel, Krivošija and Sohler introduced the (k,ℓ)-median probl...
research
∙
01/28/2020
Computing the Fréchet distance of trees and graphs of bounded tree width
We give algorithms to compute the Fréchet distance of trees and graphs w...
research
∙
01/28/2020
On the complexity of the middle curve problem
For a set of curves, Ahn et al. introduced the notion of a middle curve ...
research
∙
01/01/2020
A polynomial-time partitioning algorithm for weighted cactus graphs
Partitioning problems where the goal is to partition a graph into connec...
research
∙
03/06/2019
The k-Fréchet distance
We introduce a new distance measure for comparing polygonal chains: the ...
research
∙
12/21/2018