3 papers
cs.LG2025
Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
Marco Bressan, Victor Chepoi, Emmanuel Esposito +1
Abstract notions of convexity over the vertices of a graph, and corresponding notions of halfspaces, have recently gained attention from the machine learning community. In this wor…
math.CO2025
Boundary rigidity of systolic and Helly complexes
Martín Blufstein, Jérémie Chalopin, Victor Chepoi
In this article, we prove that finite (weakly) systolic and Helly complexes can be reconstructed from their boundary distances (computed in their 1-skeleta). Furthermore, Helly com…
cs.DS2025
On -unimodality of radius functions in graphs: structure and algorithms
Jérémie Chalopin, Victor Chepoi, Feodor Dragan +2
For every weight assignment to the vertices in a graph , the radius function maps every vertex of to its largest weighted distance to the other vertices. The cente…