#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2010

2019

- This year (14)
- Last 5 years (41)
- Last 10 years (45)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

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

Given an n-vertex and m-edge non-negatively real-weighted graph G = (V, E, w), whose vertices are partitioned into a set of k clusters, a clustered network design problem on G consists of finding a… (More)

Counting graphlets is a well-studied problem in graph mining and social network analysis. Recently, several papers explored very simple and natural approaches based on Monte Carlo sampling of Markov… (More)

In this paper we introduce a mathematical model that captures some of the salient features of recommender systems that are based on popularity and that try to exploit social ties among the users. We… (More)

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

- Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
- ISAAC
- 2017

We present a sorting algorithm for the case of recurrent random comparison errors. The algorithm essentially achieves simultaneously good properties of previous algorithms for sorting n distinct… (More)

- Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
- ArXiv
- 2018

We consider the problem of sorting n elements in the case of persistent comparison errors. In this model (Braverman and Mossel, SODA’08), each comparison between two elements can be wrong with some… (More)

Real life graphs and networks are prone to failure of nodes (vertices) and links (edges). In particular, for a pair of nodes s and t and a failing edge e in an n-vertex unweighted graph G = (V (G),… (More)

- Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
- SIROCCO
- 2015

- 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… (More)