18 citations · 44 across the 26 of their papers we have counts for
26 papers · 1 filter
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…
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…
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs
Davide Bilò, Shiri Chechik, Keerti Choudhary +3
Despite extensive research on distance oracles, there are still large gaps between the best constructions for spanners and distance oracles. Notably, there exist sparse spanners wi…
Finding Diameter-Reducing Shortcuts in Trees
Davide Bilò, Luciano Gualà, Stefano Leucci +1
In the \emph{-Diameter-Optimally Augmenting Tree Problem} we are given a tree of vertices as input. The tree is embedded in an unknown \emph{metric} space and we have un…