Gabriele Di Stefano

activity

20212024

collaborators

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

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