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 | 111 | 2012 |

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 | 79 | 2018 |

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 | 60 | 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 | 54 | 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 | 42 | 2016 |

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 | 40 | 2016 |

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 | 37 | 2014 |

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 | 36 | 2018 |

Computing top-*k* Closeness Centrality Faster in Unweighted GraphsE Bergamini, M Borassi, P Crescenzi, A Marino, H Meyerhenke ACM Transactions on Knowledge Discovery from Data (TKDD) 13 (5), 1-40, 2019 | 35 | 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 | 30 | 2015 |

On computing the hyperbolicity of real-world graphs M Borassi, D Coudert, P Crescenzi, A Marino Algorithms-ESA 2015, 215-226, 2015 | 28 | 2015 |

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 | 26 | 2012 |

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 | 24 | 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 | 24 | 2012 |

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, 2014 | 23 | 2014 |

Finding the diameter in real-world graphs P Crescenzi, R Grossi, C Imbrenda, L Lanzi, A Marino European Symposium on Algorithms, 302-313, 2010 | 23 | 2010 |

Detecting artificial behaviours in the bitcoin users graph DDF Maesa, A Marino, L Ricci Online Social Networks and Media 3, 63-74, 2017 | 21 | 2017 |

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 | 19 | 2012 |

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 | 18 | 2012 |

Fast and simple computation of top-k closeness centralities M Borassi, P Crescenzi, A Marino arXiv preprint arXiv:1507.01490, 2015 | 17 | 2015 |