Antonio Mucherino

Date: 16:00 – 16:30, Thursday, 28.04.2022
Location: BBG 169 & MS Teams ICS Colloquium

Title: Discretizable Distance Geometry
Abstract: Distances between pairs of atoms in a given molecule can be estimated by experiments of Nuclear Magnetic Resonance (NMR). The battery power allowing for a two-way communication between pairs of sensors in a network can give information about their proximity. Distances also play a fundamental role when assigning a specific morphology to an animated character. Several are in fact the applications that can be formulated as a Distance Geometry Problem (DGP). The DGP basically asks whether a simple weighted undirected graph G can be realized in the K-dimensional Euclidean space, so that some distance constraints are satisfied, where both G and K > 0 are inputs of the problem. In this seminar, I’ll briefly review the basic ideas behind the Discretizable DGP (DDGP), a special class of the DGP where the search space can be discretized, and present some ongoing research in this domain.