25 citations · 30 across the 5 of their papers we have counts for
6 papers
Cops & Robber on Periodic Temporal Graphs
Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro +1
We consider the Cops and Robber pursuit-evasion game when the edge-set of the graph is allowed to change in time, possibly at every round. Specifically, the game is played on an in…
Population Protocols with Faulty Interactions: the Impact of a Leader
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi +3
We consider the problem of simulating traditional population protocols under weaker models of communication, which include one-way interactions (as opposed to two-way interactions)…
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi +3
In this paper we investigate the computational power of Population Protocols (PP) under some unreliable and/or weaker interaction models. More precisely, we focus on two features r…
Robots with Lights: Overcoming Obstructed Visibility Without Colliding
G. A. Di Luna, P. Flocchini, S. Gan Chaudhuri +2
Robots with lights is a model of autonomous mobile computational entities operating in the plane in Look-Compute-Move cycles: each agent has an externally visible light which can a…
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard +2
In infrastructure-less highly dynamic networks, computing and performing even basic tasks (such as routing and broadcasting) is a very challenging activity due to the fact that con…
Building Fastest Broadcast Trees in Periodically-Varying Graphs
Arnaud Casteigts, Paola Flocchini, Bernard Mans +1
Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communication routes at any instant. Still, connectivity can generally be established over time…