3 papers
cs.DS2026
Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan +1
In the d-Euclidean Distance Matrix Completion (d-EDMC) problem, one aims to determine whether a given partial matrix of pairwise distances can be extended to a full Euclidean dista…
cs.GT2025
Tractable Graph Structures in EFX Orientation
Václav Blažej, Sushmita Gupta, M. S. Ramanujan +1
Since its introduction, envy-freeness up to any good (EFX) has become a fundamental solution concept in fair division of indivisible goods. Its existence remains elusive -- even fo…
cs.CG2025
When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach +2
Distance geometry explores the properties of distance spaces that can be exactly represented as the pairwise Euclidean distances between points in (), or e…