Michele Borassi

22 papers A* 3A 3B 1Misc 1Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2020 A* conf
Sliding Window Algorithms for k-Clustering Problems.
NeurIPS
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
2020 J jnl
Sliding Window Algorithms for k-Clustering Problems.
CoRR
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
2019 A* conf
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives.
PODS
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
2019 J jnl
Computing top-
ACM Trans. Knowl. Discov. Data
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2019 J jnl
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation.
ACM J. Exp. Algorithmics
Michele Borassi, Emanuele Natale
2017 A* conf
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs.
SODA
Michele Borassi, Pierluigi Crescenzi, Luca Trevisan
2017 J jnl
Computing top-k Closeness Centrality Faster in Unweighted Graphs.
CoRR
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2016 J jnl
A Note on the Complexity of Computing the Number of Reachable Vertices in a Digraph.
CoRR
Michele Borassi
2016 J jnl
A note on the complexity of computing the number of reachable vertices in a digraph.
Inf. Process. Lett.
Michele Borassi
2016 J jnl
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs.
CoRR
Michele Borassi, Pierluigi Crescenzi, Luca Trevisan
2016 A conf
Computing Top-
ALENEX
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2016 A conf
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation.
ESA
Michele Borassi, Emanuele Natale
2016 J jnl
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation.
CoRR
Michele Borassi, Emanuele Natale
2015 J jnl
Fast and Simple Computation of Top-k Closeness Centralities.
CoRR
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
2015 J jnl
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.
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
2015 J jnl
Hyperbolicity Measures "Democracy" in Real-World Networks.
CoRR
Michele Borassi, Alessandro Chessa, Guido Caldarelli
2015 — conf
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems.
ICTCS
Michele Borassi, Pierluigi Crescenzi, Michel Habib
2015 A conf
On Computing the Hyperbolicity of Real-World Graphs.
ESA
Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino
2014 J jnl
Into the Square - On the Complexity of Quadratic-Time Solvable Problems.
CoRR
Michele Borassi, Pierluigi Crescenzi, Michel Habib
2014 Misc conf
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.
FUN
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
2014 J jnl
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.
Bioinform.
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
2013 B conf
Telling Stories Fast.
SEA
Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu