research
∙
08/28/2023
Mutual visibility in hypercube-like graphs
Let G be a graph and X⊆ V(G). Then, vertices x and y of G are X-visible ...
share
research
∙
08/03/2023
Time-optimal geodesic mutual visibility of robots on grids within minimum area
The Mutual Visibility is a well-known problem in the context of mobile r...
research
∙
07/31/2023
Asynchronous Silent Programmable Matter: Line Formation
Programmable Matter (PM) has been widely investigated in recent years. I...
research
∙
05/27/2021
Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility
Among fundamental problems in the context of distributed computing by au...
research
∙
02/10/2021
Speeding up Routing Schedules on Aisle-Graphs with Single Access
In this paper, we study the Orienteering Aisle-graphs Single-access Prob...
research
∙
10/27/2020
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs
Given a set R of robots, each one located at different vertices of an in...
research
∙
10/23/2020
A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study
Following the wide investigation in distributed computing issues by mobi...
research
∙
09/12/2019
Optimal Routing Schedules for Robots Operating in Aisle-Structures
In this paper, we consider the Constant-cost Orienteering Problem (COP) ...
research
∙
08/27/2018
Turning Cliques into Paths to Achieve Planarity
Motivated by hybrid graph representations, we introduce and study the fo...
research
∙
08/30/2017
