activity
20092026
most citedWeakly modular graphs and nonpositive curvature

54 citations · 237 across the 33 of their papers we have counts for

collaborators
Showing 2016Show all

5 papers · 1 filter

cs.DS2016

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…

cs.DS2016★ 25 cited

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…

cs.FL2016★ 4 cited

A counterexample to Thiagarajan's conjecture on regular event structures

Jérémie Chalopin, Victor Chepoi

We provide a counterexample to a conjecture by Thiagarajan (1996 and 2002) that regular event structures correspond exactly to event structures obtained as unfoldings of finite 1-s…

cs.DC2016

Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions

Jérémie Chalopin, Emmanuel Godard, Antoine Naudin

We investigate the exploration and mapping of anonymous graphs by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the…

cs.DC2016★ 17 cited

Convergecast and Broadcast by Power-Aware Mobile Agents

Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz +3

A set of identical, mobile agents is deployed in a weighted network. Each agent has a battery -- a power source allowing it to move along network edges. An agent uses its battery p…