Gabriele Di Stefano

activity

20172026

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

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

collaborators

24 papers

math.LO2026

A Reflection Calculus for Bar Induction and the Linearity of Consistency Strength Ordering

Fedor Pakhomov, Vlad Lazar

We introduce a novel extension of reflection calculus, $R C_{BI}$ , to analyze a family of extensions of $ACA_{0}$ generated by uniform $ω$ -model and syntactic reflec…

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

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

math.CO2024

Colouring a graph with position sets

Ullas Chandran S. V., Gabriele Di Stefano, Haritha S. +2

In this paper we consider a colouring version of the general position problem. The \emph{$\gp $-chromatic number} is the smallest number of colours needed to colour the vertices of…

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

Lower General Position Sets in Graphs

Gabriele Di Stefano, Sandi Klavžar, Aditi Krishnakumar +2

A subset $S$ of vertices of a graph $G$ is a \emph{general position set} if no shortest path in $G$ contains three or more vertices of $S$ . In this paper, we generalise a problem o…

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

On the Vertex Position Number of Graphs

Maya Thankachy, Elias John Thomas, Ullas Chandran +3

In this paper we generalise the notion of visibility from a point in an integer lattice to the setting of graph theory. For a vertex $x$ of a connected graph $G$ , we say that a set…

math.CO2022

On the General Position Number of Mycielskian Graphs

Elias John Thomas, Ullas Chandran, James Tuite +1

The general position problem for graphs was inspired by the no-three-in-line problem from discrete geometry. A set $S$ of vertices of a graph $G$ is a \emph{general position set} i…

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…

math.CO2021

Mutual Visibility in Graphs

Gabriele Di Stefano

Let $G = (V, E)$ be a graph and $P \subseteq V$ a set of points. Two points are mutually visible if there is a shortest path between them without further points. $P$ is a mutual-visibi…

math.CO2020

On monophonic position sets in graphs

Elias John Thomas, S. V. Ullas Chandran, James Tuite +1

The general position problem in graph theory asks for the largest set $S$ of vertices of a graph $G$ such that no shortest path of $G$ contains more than two vertices of $S$ . In th…

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…