Serafino Cicerone

activity

20172025

most citedA methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study

4 citations · 6 across the 16 of their papers we have counts for

collaborators

16 papers

math.CO2025

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 $k$ -fault-tolerant mutual visibility. Informally, a set of vertices $X \subseteq V (G)$ i…

cs.DC2025

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.…

cs.DC2025

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…

cs.DC2025

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…

cs.SI2025

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…

cs.DC2024

An optimal algorithm for geodesic mutual visibility on hexagonal grids

Sahar Badri, Serafino Cicerone, Alessia Di Fonso +1

For a set of robots (or agents) moving in a graph, two properties are highly desirable: confidentiality (i.e., a message between two agents must not pass through any intermediate a…

math.CO2024

Mutual-visibility problems on graphs of diameter two

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1

The mutual-visibility problem in a graph $G$ asks for the cardinality of a largest set of vertices $S \subseteq V (G)$ so that for any two vertices $x, y \in S$ there is a shortest $x,…

math.CO2023

Mutual visibility in hypercube-like graphs

Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +2

Let $G$ be a graph and $X \subseteq V (G)$ . Then, vertices $x$ and $y$ of $G$ are $X$ -visible if there exists a shortest $u, v$ -path where no internal vertices belong to $X$ . The set…

cs.DC2023

Time-optimal geodesic mutual visibility of robots on grids within minimum area

Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1

The \textsc{Mutual Visibility} is a well-known problem in the context of mobile robots. For a set of $n$ robots disposed in the Euclidean plane, it asks for moving the robots witho…

math.CO2023

Mutual-visibility in distance-hereditary graphs: a linear-time algorithm

Serafino Cicerone, Gabriele Di Stefano

The concept of mutual-visibility in graphs has been recently introduced. If $X$ is a subset of vertices of a graph $G$ , then vertices $u$ and $v$ are $X$ -visible if there exists a…

math.CO2023

Variety of mutual-visibility problems in graphs

Serafino Cicerone, Gabriele Di Stefano, Lara Drozek +3

If $X$ is a subset of vertices of a graph $G$ , then vertices $u$ and $v$ are $X$ -visible if there exists a shortest $u, v$ -path $P$ such that $V (P) \cap X \subseteq {u, v}$ . If each…

math.CO2022★ 2 cited

Mutual-visibility in strong products of graphs via total mutual-visibility

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1

Let $G$ be a graph and $X \subseteq V (G)$ . Then $X$ is a mutual-visibility set if each pair of vertices from $X$ is connected by a geodesic with no internal vertex in $X$ . The mutua…

math.CO2021

On the mutual visibility in Cartesian products and triangle-free graphs

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar

Given a graph $G = (V (G), E (G))$ and a set $P \subseteq V (G)$ , the following concepts have been recently introduced: $(i)$ two elements of $P$ are \emph{mutually visible} if there is…

cs.DC2020

Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs

Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1

Given a set R of robots, each one located at different vertices of an infinite regular tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a…

cs.DC2020★ 4 cited

A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study

Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra

Following the wide investigation in distributed computing issues by mobile entities of the last two decades, we consider the need of a structured methodology to tackle the arisen p…

cs.DC2017

Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach

Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra

Given any multiset F of points in the Euclidean plane and a set R of robots such that |R|=|F|, the Arbitrary Pattern Formation (APF) problem asks for a distributed algorithm that m…