#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2010

2017

- This year (3)
- Last 5 years (22)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Let G be an unweighted n-node undirected graph. A βadditive spanner of G is a spanning subgraph H of G such that distances in H are stretched at most by an additive term β w.r.t. the corresponding distances in G. A natural research goal related with spanners is that of designing sparse spanners with low stretch. In this paper, we focus on fault-tolerant… (More)

- Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
- ESA
- 2014

The resiliency of a network is its ability to remain effectively functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the requirement of being resilient. In this paper we address this trade-off for the prominent case of the broadcasting routing… (More)

- Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
- STACS
- 2016

Let G be an n-node and m-edge positively real-weighted undirected graph. For any given integer f ≥ 1, we study the problem of designing a sparse f-edge-fault-tolerant (f -EFT) σ-approximate single-source shortest-path tree (σ-ASPT), namely a subgraph of G having as few edges as possible and which, following the failure of a set F of at most f edges in G,… (More)

- Luciano Gualà, Stefano Leucci, Emanuele Natale
- 2014 IEEE Conference on Computational…
- 2014

The twenty-first 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 to form matches of three and are collectively known as tile-matching match-three games. Among these, the most influential one is arguably Bejeweled in which the… (More)

- Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
- SIROCCO
- 2013

- Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
- WINE
- 2010

Let be given a graph G = (V,E) whose edge set is partitioned into a set R of red edges and a set B of blue edges, and assume that red edges are weighted and form a spanning tree of G. Then, the Stackelberg Minimum Spanning Tree (StackMST) problem is that of pricing (i.e., weighting) the blue edges in such a way that the total weight of the blue edges… (More)

- Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
- Theor. Comput. Sci.
- 2012

In this paper we study a generalization of the classic network creation game in the scenario in which the n players sit on a given arbitrary host graph, which constrains the set of edges a player can activate at a cost of α ≥ 0 each. This finds its motivations in the physical limitations one can have in constructing links in practice, and it has been… (More)

- Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
- SIROCCO
- 2014

- Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
- TOPC
- 2014

Network creation games have been extensively studied, both by economists and computer scientists, due to their versatility in modeling individual-based community formation processes. These processes, in turn, are the theoretical counterpart of several economics, social, and computational applications on the Internet. In their several variants, these games… (More)