Telling Stories Fast. - Michele Borassi; Pierluigi Crescenzi; Vincent Lacroix; Andrea Marino 001; Marie-France Sagot; Paulo Vieira Milreu (SEA, 2013)

On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. - Michele Borassi; Pierluigi Crescenzi; Michel Habib; Walter A. Kosters; Andrea Marino 001; Frank W. Takes (FUN, 2014)

Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. - Paulo Vieira Milreu; Cecilia Coimbra Klein; Ludovic Cottret; Vicente Acuña; Etienne Birmelé; Michele Borassi; Christophe Junot; Alberto Marchetti-Spaccamela; Andrea Marino 001; Leen Stougie; Fabien Jourdan; Pierluigi Crescenzi; et al. (Bioinform., 2014)

Into the Square - On the Complexity of Quadratic-Time Solvable Problems. - Michele Borassi; Pierluigi Crescenzi; Michel Habib (CoRR, 2014)

On Computing the Hyperbolicity of Real-World Graphs. - Michele Borassi; David Coudert; Pierluigi Crescenzi; Andrea Marino 001 (ESA, 2015)

Hyperbolicity Measures "Democracy" in Real-World Networks. - Michele Borassi; Alessandro Chessa; Guido Caldarelli (CoRR, 2015)

Fast and Simple Computation of Top-k Closeness Centralities. - Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001 (CoRR, 2015)

Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. - Michele Borassi; Pierluigi Crescenzi; Michel Habib (ICTCS, 2015)

Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. - Michele Borassi; Pierluigi Crescenzi; Michel Habib; Walter A. Kosters; Andrea Marino 001; Frank W. Takes (Theor. Comput. Sci., 2015)

A note on the complexity of computing the number of reachable vertices in a digraph. - Michele Borassi (Inf. Process. Lett., 2016)

An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. - Michele Borassi; Pierluigi Crescenzi; Luca Trevisan 001 (SODA, 2017)

Computing top-k Closeness Centrality Faster in Unweighted Graphs. - Elisabetta Bergamini; Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001; Henning Meyerhenke (CoRR, 2017)

Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives. - Michele Borassi; Alessandro Epasto; Silvio Lattanzi; Sergei Vassilvitskii; Morteza Zadimoghaddam (PODS, 2019)

KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. - Michele Borassi; Emanuele Natale (ACM J. Exp. Algorithmics, 2019)

Computing top-k Closeness Centrality Faster in Unweighted Graphs. - Elisabetta Bergamini; Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001; Henning Meyerhenke (ACM Trans. Knowl. Discov. Data, 2019)

Sliding Window Algorithms for k-Clustering Problems. - Michele Borassi; Alessandro Epasto; Silvio Lattanzi; Sergei Vassilvitskii; Morteza Zadimoghaddam (NeurIPS, 2020)