default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Borassi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c9]Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Sliding Window Algorithms for k-Clustering Problems. NeurIPS 2020- [i8]Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Sliding Window Algorithms for k-Clustering Problems. CoRR abs/2006.05850 (2020)
2010 – 2019
- 2019
- [j5]Michele Borassi, Emanuele Natale
:
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. ACM J. Exp. Algorithmics 24(1): 1.2:1-1.2:35 (2019) - [j4]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13(5): 53:1-53:40 (2019) - [c8]Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives. PODS 2019: 254-268 - 2017
- [c7]Michele Borassi, Pierluigi Crescenzi, Luca Trevisan:
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. SODA 2017: 920-939 - [i7]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR abs/1704.01077 (2017) - 2016
- [j3]Michele Borassi:
A note on the complexity of computing the number of reachable vertices in a digraph. Inf. Process. Lett. 116(10): 628-630 (2016) - [c6]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing Top-k Closeness Centrality Faster in Unweighted Graphs. ALENEX 2016: 68-80 - [c5]Michele Borassi, Emanuele Natale:
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. ESA 2016: 20:1-20:18 - [i6]Michele Borassi:
A Note on the Complexity of Computing the Number of Reachable Vertices in a Digraph. CoRR abs/1602.02129 (2016) - [i5]Michele Borassi, Pierluigi Crescenzi, Luca Trevisan:
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. CoRR abs/1604.01445 (2016) - [i4]Michele Borassi, Emanuele Natale:
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. CoRR abs/1604.08553 (2016) - 2015
- [j2]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: 59-80 (2015) - [c4]Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino:
On Computing the Hyperbolicity of Real-World Graphs. ESA 2015: 215-226 - [c3]Michele Borassi, Pierluigi Crescenzi, Michel Habib:
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. ICTCS 2015: 51-67 - [i3]Michele Borassi, Alessandro Chessa, Guido Caldarelli:
Hyperbolicity Measures "Democracy" in Real-World Networks. CoRR abs/1503.03061 (2015) - [i2]Michele Borassi, Pierluigi Crescenzi, Andrea Marino:
Fast and Simple Computation of Top-k Closeness Centralities. CoRR abs/1507.01490 (2015) - 2014
- [j1]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): 61-70 (2014) - [c2]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: 52-63 - [i1]Michele Borassi, Pierluigi Crescenzi, Michel Habib:
Into the Square - On the Complexity of Quadratic-Time Solvable Problems. CoRR abs/1407.4972 (2014) - 2013
- [c1]Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu:
Telling Stories Fast. SEA 2013: 200-211
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
