5 papers
Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1
Networks are often modeled using graphs, and within this setting we introduce the notion of -fault-tolerant mutual visibility. Informally, a set of vertices i…
Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
In the field of swarm robotics, one of the most studied problem is Gathering. It asks for a distributed algorithm that brings the robots to a common location, not known in advance.…
Gathering in Non-Vertex-Transitive Graphs Under Round Robin
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
The Gathering problem for a swarm of robots asks for a distributed algorithm that brings such entities to a common place, not known in advance. We consider the well-known OBLOT mod…
On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
The OBLOT model has been extensively studied in theoretical swarm robotics. It assumes weak capabilities for the involved mobile robots, such as they are anonymous, disoriented, no…
Burning some myths on privacy properties of social networks against active attacks
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1
This work focuses on showing some arguments addressed to dismantle the extended idea about that social networks completely lacks of privacy properties. We consider the so-called ac…