A. Di Fonso

collaborators

4 papers

cs.CC2024

On the approximability of graph visibility problems

Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano +1

Visibility problems have been investigated for a long time under different assumptions as they pose challenging combinatorial problems and are connected to robot navigation problem…

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