18 citations · 23 across the 6 of their papers we have counts for
6 papers
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…
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…
Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard
Luciano Gualà, Stefano Leucci, Emanuele Natale
The twentieth century has seen the rise of a new type of video games targeted at a mass audience of "casual" gamers. Many of these games require the player to swap items in order t…