20 citations · 20 across the 6 of their papers we have counts for
7 papers
Smooth weakly modular graphs
Victor Chepoi, Bruno J. Schmidt, Peter F. Stadler
A graph is called smooth (respectively, strongly smooth) if for any two vertices , the distance point-shadow , respect…
Fit systolic groups, exactly
Martín Blufstein, Victor Chepoi, Huaitao Gui +1
A systolic complex/bridged graph is fit when its (metric) intervals are "not too large". We prove that uniformly locally finite fit systolic complexes have Yu's Property A. In part…
Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
Jérémie Chalopin, Victor Chepoi, Maria Kokkou
In this paper, we present a 2-local proof labeling scheme with labels in for leader election in anonymous meshed graphs. Meshed graphs form a general class of graphs d…
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…
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…
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…
Bucolic Complexes
Bostjan Brešar, Jérémie Chalopin, Victor Chepoi +2
We introduce and investigate bucolic complexes, a common generalization of systolic complexes and of CAT(0) cubical complexes. They are defined as simply connected prism complexes…