Gabriele Di Stefano

collaborators

9 papers

math.CO2026

The general position number of digraphs

Ullas Chandran S. V., Gabriele Di Stefano, Grahame Erskine +3

The general position number for graphs ask for largest vertex subsets $S$ such that no three vertices are contained on a common shortest path. We examine this problem in the settin…

math.CO2026

Mutual-visibility Coloring of Graphs

Saneesh Babu, Gabriele Di Stefano, Aparna Lakshmanan S

The mutual-visibility chromatic number of a graph $G$ is the smallest number of colors needed to color the vertices of $G$ such that each color class is a mutual-visibility set. In…

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

The vertex visibility number of graphs

Dhanya Roy, Gabriele Di Stefano, Sandi KlavÅ¾ar +1

If $x \in V (G)$ , then $S \subseteq V (G) ∖ {x}$ is an $x$ -visibility set if for any $y \in S$ there exists a shortest $x, y$ -path avoiding $S$ . The $x$ -visibility number $v_x(G)…

cs.DS2025

On Computing Top- $k$ Simple Shortest Paths from a Single Source

Mattia D'Emidio, Gabriele Di Stefano

We investigate the problem of computing the top- $k$ simple shortest paths in weighted digraphs. While the single-pair variant -- finding the top- $k$ simple shortest paths between t…