Let G be a graph and X⊆ V(G). Then, vertices x and y of G
are X-visible ...
The Mutual Visibility is a well-known problem in the context of
mobile r...
Programmable Matter (PM) has been widely investigated in recent years. I...
Among fundamental problems in the context of distributed computing by
au...
In this paper, we study the Orienteering Aisle-graphs Single-access Prob...
Given a set R of robots, each one located at different vertices of an
in...
Following the wide investigation in distributed computing issues by mobi...
In this paper, we consider the Constant-cost Orienteering Problem (COP) ...
Motivated by hybrid graph representations, we introduce and study the
fo...
We show that any planar drawing of a forest of three stars whose vertice...