18 citations · 44 across the 26 of their papers we have counts for
4 papers · 1 filter
Temporal queries for dynamic temporal forests
Davide Bilò, Luciano Gualà, Stefano Leucci +2
In a temporal forest each edge has an associated set of time labels that specify the time instants in which the edges are available. A temporal path from vertex to vertex i…
Graph Spanners for Group Steiner Distances
Davide Bilò, Luciano Gualà, Stefano Leucci +1
A spanner is a sparse subgraph of a given graph which preserves distances, measured w.r.t.\ some distance metric, up to a multiplicative stretch factor. This paper addresses th…
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…
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
Davide Bilò, Giordano Colli, Luca Forlizzi +1
Given an undirected connected graph on vertices, the minimum Monitoring Edge-Geodetic Set (MEG-set) problem asks to find a subset of minim…