activity
20122021
most citedGuarding and Searching Polyhedra

9 citations · 15 across the 6 of their papers we have counts for

collaborators

12 papers

cs.CG2021

Chasing Puppies: Mobile Beacon Routing on Closed Curves

Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna +5

We solve an open problem posed by Michael Biro at CCCG 2013 that was inspired by his and others' work on beacon-based routing. Consider a human and a puppy on a simple closed curve…

cs.CC2020

Cyclic Shift Problems on Graphs

Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta

We study a new reconfiguration problem inspired by classic mechanical puzzles: a colored token is placed on each vertex of a given graph; we are also given a set of distinguished c…

cs.DC2020

Mobile RAM and Shape Formation by Programmable Particles

Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro +2

We investigate computational issues in the distributed model Amoebots of programmable matter. In this model, the computational entities, called particles, are anonymous finite-stat…

cs.DC2019

Oblivious Permutations on the Plane

Shantanu Das, Giuseppe A. Di Luna, Paola Flocchini +3

We consider a distributed system of n identical mobile robots operating in the two dimensional Euclidian plane. As in the previous studies, we consider the robots to be anonymous,…

cs.DC2017

Line-Recovery by Programmable Particles

Giuseppe Di Luna, Paola Flocchini, Giuseppe Prencipe +2

Shape formation has been recently studied in distributed systems of programmable particles. In this paper we consider the shape recovery problem of restoring the shape when of…

cs.DC2016

Square Formation by Asynchronous Oblivious Robots

Marcello Mamino, Giovanni Viglietta

A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way a…