Euclidean distance matrices (EDMs) are a major tool for localization from distances, with
applications ranging from protein structure determination to global positioning and manifold …

A growing number of research papers shed light on automated machine learning (AutoML)
frameworks, which are becoming a promising solution for building complex machine …

The dynamical distance geometry problem (dynDGP) is the problem of finding a realization
in a Euclidean space of a weighted undirected graph G representing an animation by …

The Distance Geometry Problem (DGP) asks whether a simple weighted undirected graph
can be realized in a given space (generally Euclidean) so that a given set of distance …

We propose a coarse-grained representation for the solutions of discretizable instances of
the Distance Geometry Problem (DGP). In several real-life applications, the distance …

We revisit a simple, yet capable to provide good solutions, procedure for solving the
Distance Geometry Problem (DGP). This procedure combines two main components: the …

Distance-based motion adaptation leads to the formulation of a dynamical Distance
Geometry Problem (dynDGP) where the involved distances simultaneously represent the …

The de facto standard for storing human motion data on a computer involves a
representation based on Euler angles. This representation, while effective, has several short …

Over the last years, my research activity has mainly been focused on Distance Geometry
(DG). Differently from the classical Euclidean Geometry, DG solely relies on distances, and …

Distance Geometry (DG) est l'étude des concepts géométriques basés sur la distance. Un
des premiers résultats historiques dans le contexte de DG est la formule de Heron, dont …