8 citations · 36 across the 21 of their papers we have counts for
27 papers
When Should You Wait Before Updating? Toward a Robustness Refinement
Swan Dubois, Laurent Feuilloley, Franck Petit +1
Consider a dynamic network and a given distributed problem. At any point in time, there might exist several solutions that are equally good with respect to the problem specificatio…
Almost Universal Anonymous Rendezvous in the Plane
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc +1
Two mobile agents represented by points freely moving in the plane and starting at two distinct positions, have to meet. The meeting, called rendezvous, occurs when agents are at d…
Deterministic Treasure Hunt in the Plane with Angular Hints
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc +1
A mobile agent equipped with a compass and a measure of length has to find an inert treasure in the Euclidean plane. Both the agent and the treasure are modeled as points. In the b…
Robustness: a New Form of Heredity Motivated by Dynamic Networks
Arnaud Casteigts, Swan Dubois, Franck Petit +1
We investigate a special case of hereditary property in graphs, referred to as {\em robustness}. A property (or structure) is called robust in a graph if it is inherited by all…
Gracefully Degrading Gathering in Dynamic Rings
Marjorie Bournat, Swan Dubois, Franck Petit
Gracefully degrading algorithms [Biely \etal, TCS 2018] are designed to circumvent impossibility results in dynamic systems by adapting themselves to the dynamics. Indeed, such an…
Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc +1
We consider the task of rendezvous in networks modeled as undirected graphs. Two mobile agents with different labels, starting at different nodes of an anonymous graph, have to mee…