| BUbiNG: Massive crawling for the masses P Boldi, A Marino, M Santini, S Vigna ACM Transactions on the Web (TWEB) 12 (2), 1-26, 2018 | 128 | 2018 |
| 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 | 124 | 2012 |
| Data-driven analysis of bitcoin properties: exploiting the users graph D Di Francesco Maesa, A Marino, L Ricci International Journal of Data Science and Analytics 6, 63-80, 2018 | 106 | 2018 |
| 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 | 102 | 2016 |
| 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 | 99 | 2013 |
| 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 | 82 | 2013 |
| Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques A Conte, R Grossi, A Marino, L Versari 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 61 | 2016 |
| 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), 1-40, 2019 | 58 | 2019 |
| 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 | 58 | 2015 |
| D2K: scalable community detection in massive networks via small-diameter k-plexes A Conte, T De Matteis, D De Sensi, R Grossi, A Marino, L Versari Proceedings of the 24th ACM SIGKDD International Conference on Knowledge …, 2018 | 54 | 2018 |
| 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 | 47 | 2014 |
| Detecting artificial behaviours in the bitcoin users graph DDF Maesa, A Marino, L Ricci Online Social Networks and Media 3, 63-74, 2017 | 46 | 2017 |
| 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 | 41 | 2012 |
| On computing the hyperbolicity of real-world graphs M Borassi, D Coudert, P Crescenzi, A Marino Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 36 | 2015 |
| An analysis of the bitcoin users graph: inferring unusual behaviours D Di Francesco Maesa, A Marino, L Ricci Complex Networks & Their Applications V: Proceedings of the 5th …, 2017 | 35 | 2017 |
| Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure PV Milreu, CC Klein, L Cottret, V Acuna, E Birmele, M Borassi, C Junot, ... Bioinformatics 30 (1), 61-70, 2014 | 29 | 2014 |
| On computing the diameter of real-world directed (weighted) graphs P Crescenzi, R Grossi, L Lanzi, A Marino Experimental Algorithms: 11th International Symposium, SEA 2012, Bordeaux …, 2012 | 29 | 2012 |
| Finding the diameter in real-world graphs: Experimentally turning a lower bound into an upper bound P Crescenzi, R Grossi, C Imbrenda, L Lanzi, A Marino Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK …, 2010 | 29 | 2010 |
| On the Solvability of the Six Degrees of Kevin Bacon Game: A Faster Graph Diameter and Radius Computation Method M Borassi, P Crescenzi, M Habib, W Kosters, A Marino, F Takes Fun with Algorithms: 7th International Conference, FUN 2014, Lipari Island …, 2014 | 27 | 2014 |
| 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 | 26 | 2012 |
