Andrea Marino
Andrea Marino
Email verificata su unifi.it - Home page
TitoloCitata daAnno
Topical clustering of search results
U Scaiella, P Ferragina, A Marino, M Ciaramita
Proceedings of the fifth ACM international conference on Web search and data …, 2012
1012012
BUbiNG: Massive crawling for the masses
P Boldi, A Marino, M Santini, S Vigna
ACM Transactions on the Web (TWEB) 12 (2), 12, 2018
652018
Optimal listing of cycles and st-paths in undirected graphs
E Birmelé, R Ferreira, R Grossi, A Marino, N Pisanti, R Rizzi, G Sacomoto
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
592013
On computing the diameter of real-world undirected graphs
P Crescenzi, R Grossi, M Habib, L Lanzi, A Marino
Theoretical Computer Science 514, 84-95, 2013
542013
Blind image clustering based on the normalized cuts criterion for camera identification
I Amerini, R Caldelli, P Crescenzi, A Del Mastio, A Marino
Signal Processing: Image Communication 29 (8), 831-843, 2014
342014
Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
A Conte, R Grossi, A Marino, L Versari
332016
Computing top-k closeness centrality faster in unweighted graphs
E Bergamini, M Borassi, P Crescenzi, A Marino, H Meyerhenke
ACM Transactions on Knowledge Discovery from Data (TKDD) 13 (5), 53, 2019
282019
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games
M Borassi, P Crescenzi, M Habib, WA Kosters, A Marino, FW Takes
Theoretical Computer Science 586, 59-80, 2015
282015
Uncovering the bitcoin blockchain: an analysis of the full users graph
DDF Maesa, A Marino, L Ricci
2016 IEEE International Conference on Data Science and Advanced Analytics …, 2016
272016
On computing the hyperbolicity of real-world graphs
M Borassi, D Coudert, P Crescenzi, A Marino
Algorithms-ESA 2015, 215-226, 2015
252015
Finding the diameter in real-world graphs
P Crescenzi, R Grossi, C Imbrenda, L Lanzi, A Marino
European Symposium on Algorithms, 302-313, 2010
232010
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets
V Acuña, E Birmelé, L Cottret, P Crescenzi, F Jourdan, V Lacroix, ...
Theoretical Computer Science 457, 1-9, 2012
222012
Structural and dynamical analysis of biological networks
C Klein, A Marino, MF Sagot, P Vieira Milreu, M Brilli
Briefings in functional genomics 11 (6), 420-433, 2012
222012
Data-driven analysis of Bitcoin properties: exploiting the users graph
DDF Maesa, A Marino, L Ricci
International Journal of Data Science and Analytics 6 (1), 63-80, 2018
212018
On the solvability of the six degrees of kevin bacon game
M Borassi, P Crescenzi, M Habib, W Kosters, A Marino, F Takes
International Conference on Fun with Algorithms, 52-63, 2014
202014
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure
PV Milreu, CC Klein, L Cottret, V Acuña, E Birmelé, M Borassi, C Junot, ...
Bioinformatics 30 (1), 61-70, 2013
202013
On computing the diameter of real-world directed (weighted) graphs
P Crescenzi, R Grossi, L Lanzi, A Marino
International Symposium on Experimental Algorithms, 99-110, 2012
192012
Efficient bubble enumeration in directed graphs
E Birmelé, P Crescenzi, R Ferreira, R Grossi, V Lacroix, A Marino, ...
International Symposium on String Processing and Information Retrieval, 118-129, 2012
172012
Detecting artificial behaviours in the Bitcoin users graph
DDF Maesa, A Marino, L Ricci
Online Social Networks and Media 3, 63-74, 2017
152017
Fast and simple computation of top-k closeness centralities
M Borassi, P Crescenzi, A Marino
arXiv preprint arXiv:1507.01490, 2015
142015
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20