22 citations · 23 across the 4 of their papers we have counts for
5 papers
Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
David Coudert, André Nusser, Laurent Viennot
Hyperbolicity is a graph parameter which indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networkin…
(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping
Milutin Brankovic, Kevin Buchin, Koen Klaren +3
Due to the massively increasing amount of available geospatial data and the need to present it in an understandable way, clustering this data is more important than ever. As cluste…
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
Karl Bringmann, Marvin Künnemann, André Nusser
Consider the natural question of how to measure the similarity of curves in the plane by a quantity that is invariant under translations of the curves. Such a measure is justified…
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
Karl Bringmann, Marvin Künnemann, André Nusser
The Fréchet distance provides a natural and intuitive measure for the popular task of computing the similarity of two (polygonal) curves. While a simple algorithm computes it in ne…
Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks
Emilio Cruciani, Emanuele Natale, André Nusser +1
Consider the following process on a network: Each agent initially holds either opinion blue or red; then, in each round, each agent looks at two random neighbors and, if the two ha…