Michele Borassi

Publication Activity (10 Years)

Years Active: 2013-2020
Publications (10 Years): 14

Top Topics

Walsh Hadamard Transform

Streaming Time Series

Top Venues

ACM J. Exp. Algorithmics

Publications

Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
Sliding Window Algorithms for k-Clustering Problems. CoRR (2020)
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
Sliding Window Algorithms for k-Clustering Problems. NeurIPS (2020)
Michele Borassi, Emanuele Natale
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. ACM J. Exp. Algorithmics 24 (1) (2019)
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives. PODS (2019)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13 (5) (2019)
Michele Borassi, Pierluigi Crescenzi, Luca Trevisan
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. SODA (2017)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR (2017)
Michele Borassi
A note on the complexity of computing the number of reachable vertices in a digraph. Inf. Process. Lett. 116 (10) (2016)
Michele Borassi
A Note on the Complexity of Computing the Number of Reachable Vertices in a Digraph. CoRR (2016)
Michele Borassi, Emanuele Natale
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. ESA (2016)
Michele Borassi, Emanuele Natale
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. CoRR (2016)
Michele Borassi, Pierluigi Crescenzi, Michel Habib
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. Electron. Notes Theor. Comput. Sci. 322 (2016)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Closeness Centrality Faster in Unweighted Graphs. ALENEX (2016)
Michele Borassi, Pierluigi Crescenzi, Luca Trevisan
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. CoRR (2016)
Michele Borassi, Alessandro Chessa, Guido Caldarelli
Hyperbolicity Measures "Democracy" in Real-World Networks. CoRR (2015)
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
Fast and Simple Computation of Top-k Closeness Centralities. CoRR (2015)
Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino
On Computing the Hyperbolicity of Real-World Graphs. ESA (2015)
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. Theor. Comput. Sci. 586 (2015)
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. FUN (2014)
Michele Borassi, Pierluigi Crescenzi, Michel Habib
Into the Square - On the Complexity of Quadratic-Time Solvable Problems. CoRR (2014)
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
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. Bioinform. 30 (1) (2014)
Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu
Telling Stories Fast. SEA (2013)