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

Showing 2023Show all

4 papers · 1 filter

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…