54 citations · 237 across the 33 of their papers we have counts for
7 papers · 1 filter
Fast approximation and exact computation of negative curvature parameters of graphs
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan +3
In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov…
Maximal Exploration of Trees with Energy-Constrained Agents
Evangelos Bampas, Jérémie Chalopin, Shantanu Das +2
We consider the problem of exploring an unknown tree with a team of initially colocated mobile agents. Each agent has limited energy and cannot, as a result, traverse more than…
Energy-efficient Delivery by Heterogeneous Mobile Agents
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das +4
We consider the problem of delivering messages between specified source-target pairs in a weighted undirected graph, by mobile agents initially located at distinct nodes of…
Collaborative Delivery with Energy-Constrained Mobile Robots
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das +5
We consider the problem of collectively delivering some message from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent has a l…
Anonymous Graph Exploration with Binoculars
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
We investigate the exploration of networks by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the agent halts after th…
Rendezvous in Networks in Spite of Delay Faults
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel +1
Two mobile agents, starting from different nodes of an unknown network, have to meet at the same node. Agents move in synchronous rounds using a deterministic algorithm. Each agent…