Michele Borassi

According to our database, Michele Borassi authored at least 16 papers between 2013 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Sliding Window Algorithms for k-Clustering Problems.

Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Computing top-<i>k</i> Closeness Centrality Faster in Unweighted Graphs.

Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke

ACM Trans. Knowl. Discov. Data, 2019

KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation.

Michele Borassi, Emanuele Natale

ACM J. Exp. Algorithmics, 2019

Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives.

Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

2017

Computing top-k Closeness Centrality Faster in Unweighted Graphs.

Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke

CoRR, 2017

An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs.

Michele Borassi, Pierluigi Crescenzi, Luca Trevisan

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

A note on the complexity of computing the number of reachable vertices in a digraph.

Michele Borassi

Inf. Process. Lett., 2016

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, Frank W. Takes

Theor. Comput. Sci., 2015

Into the Square: On the Complexity of Some Quadratic-time Solvable Problems.

Michele Borassi, Pierluigi Crescenzi, Michel Habib

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Fast and Simple Computation of Top-k Closeness Centralities.

Michele Borassi, Pierluigi Crescenzi, Andrea Marino

CoRR, 2015

Hyperbolicity Measures "Democracy" in Real-World Networks.

Michele Borassi, Alessandro Chessa, Guido Caldarelli

CoRR, 2015

On Computing the Hyperbolicity of Real-World Graphs.

Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino

Proceedings of the Algorithms - ESA 2015, 2015

2014

Into the Square - On the Complexity of Quadratic-Time Solvable Problems.

Michele Borassi, Pierluigi Crescenzi, Michel Habib

CoRR, 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, Leen Stougie, Fabien Jourdan, Pierluigi Crescenzi, Vincent Lacroix, Marie-France Sagot

Bioinform., 2014

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, Frank W. Takes

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Telling Stories Fast.

Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013