18 citations · 44 across the 26 of their papers we have counts for
42 papers
Almost Linear 3-Spanners of Temporal Cliques
Julia Baligacs, Davide Bilò, Václav Blažej +2
Temporal graphs model dynamic networks by assigning positive integer time labels to the edges, while information propagates along temporal paths, whose edge labels are traversed in…
Complexity Thresholds for the Constrained Colored Token Swapping Problem
Davide Bilò, Stefano Leucci, Andrea Martinelli
Consider the following puzzle: a farmland consists of several fields, each occupied by either a farmer, a fox, a chicken, or a caterpillar. Creatures in neighboring fields can swap…
On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
Davide Bilò, Giordano Colli, Luca Forlizzi +1
The minimum \emph{Monitoring Edge-Geodetic Set} problem asks for a minimum vertex subset such that for every edge of the input graph , there exist a two vertices $u,v \i…
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…