18 citations · 35 across the 11 of their papers we have counts for
17 papers
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…
Finding single-source shortest -disjoint paths: fast computation and sparse preservers
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà +3
Let be a directed graph with vertices, edges, and non-negative edge costs. Given , a fixed source vertex , and a positive integer , we consider the problem of…
Cutting Bamboo Down to Size
Davide Bilò, Luciano Gualà, Stefano Leucci +2
This paper studies the problem of programming a robotic panda gardener to keep a bamboo garden from obstructing the view of the lake by your house. The garden consists of bambo…
Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni +2
Given an -vertex non-negatively real-weighted graph , whose vertices are partitioned into a set of clusters, a \emph{clustered network design problem} on consists of…
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
Davide Bilò, Feliciano Colella, Luciano Gualà +2
A tree -spanner of a positively real-weighted -vertex and -edge undirected graph is a spanning tree of which approximately preserves (i.e., up to a multiplicat…
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges
Davide Bilò, Feliciano Colella, Luciano Gualà +2
Computing \emph{all best swap edges} (ABSE) of a spanning tree of a given -vertex and -edge undirected and weighted graph means to select, for each edge of , a…
Rational Fair Consensus in the GOSSIP Model
Andrea Clementi, Luciano Gualà, Guido Proietti +1
The \emph{rational fair consensus problem} can be informally defined as follows. Consider a network of (selfish) \emph{rational agents}, each of them initially supporting a \em…
Compact and Fast Sensitivity Oracles for Single-Source Distances
Davide Bilò, Luciano Gualà, Stefano Leucci +1
Let denote a distinguished source vertex of a non-negatively real weighted and undirected graph with vertices and edges. In this paper we present two efficient \emp…
Locality-based Network Creation Games
Davide Bilò, Luciano Gualà, Stefano Leucci +1
Network creation games have been extensively studied, both from economists and computer scientists, due to their versatility in modeling individual-based community formation proces…
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
Davide Bilò, Luciano Gualà, Stefano Leucci +1
Let be an -node and -edge positively real-weighted undirected graph. For any given integer , we study the problem of designing a sparse \emph{f-edge-fault-tolera…
Path-Fault-Tolerant Approximate Shortest-Path Trees
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni +2
Let be an -nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\em single-source shortest-path tree} (SPT) of with a \emph{…
Improved Purely Additive Fault-Tolerant Spanners
Davide Bilò, Fabrizio Grandoni, Luciano Gualà +2
Let be an unweighted -node undirected graph. A \emph{-additive spanner} of is a spanning subgraph of such that distances in are stretched at most by an ad…
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
Davide Bilò, Luciano Gualà, Stefano Leucci +1
Let be given a graph whose edge set is partitioned into a set of \emph{red} edges and a set of \emph{blue} edges, and assume that red edges are weighted and form…
The Max-Distance Network Creation Game on General Host Graphs
Davide Bilò, Luciano Gualà, Stefano Leucci +1
In this paper we study a generalization of the classic \emph{network creation game} in the scenario in which the players sit on a given arbitrary \emph{host graph}, which const…
Exact and approximate algorithms for movement problems on (special classes of) graphs
Davide Bilò Luciano Gualà, Stefano Leucci, Guido Proietti
When a large collection of objects (e.g., robots, sensors, etc.) has to be deployed in a given environment, it is often required to plan a coordinated motion of the objects from th…
Fault-Tolerant Approximate Shortest-Path Trees
Davide Bilò, Luciano Gualà, Stefano Leucci +1
The resiliency of a network is its ability to remain \emph{effectively} functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a ne…
Bounded-Distance Network Creation Games
Davide Bilò, Luciano Gualà, Guido Proietti
A network creation game simulates a decentralized and non-cooperative building of a communication network. Informally, there are players sitting on the network nodes, which att…