25 citations · 106 across the 23 of their papers we have counts for
34 papers
Safe Exploration of Arbitrary Dynamic Dangerous Networks
Caterina Feletti, Paola Flocchini, Giuseppe Prencipe +1
Given a team of agents on the nodes of a graph-based network, the exploration problem requires each node to be visited by at least one agent. In the classical distributed setting o…
Universal Dancing by Luminous Robots under Sequential Schedulers
Caterina Feletti, Paola Flocchini, Debasish Pattanayak +2
The Dancing problem requires a swarm of autonomous mobile robots to form a sequence of patterns, aka perform a choreography. Existing work has proven that some crucial restrict…
Universal Pattern Formation by Oblivious Robots Under Sequential Schedulers
Paola Flocchini, Alfredo Navarra, Debasish Pattanayak +2
We study the computational power that oblivious robots operating in the plane have under sequential schedulers. We show that this power is much stronger than the obvious capacity t…
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…
Black Hole Search by Scattered Agents in Dynamic Rings
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe +1
In this paper, we address the challenge of locating a black hole within a dynamic graph using a set of scattered agents, which start from arbitrary positions in the graph. A black…
On Asynchrony, Memory, and Communication: Separations and Landscapes
Paola Flocchini, Nicola Santoro, Yuichi Sudo +1
Research on distributed computing by a team of identical mobile computational entities, called robots, operating in a Euclidean space in --$\mathit…