MARINO, ANDREA

MARINO, ANDREA  

Statistica, Informatica, Applicazioni 'G. Parenti' (DiSIA)  

Mostra records
Risultati 1 - 20 di 75 (tempo di esecuzione: 0.026 secondi).
Titolo Data di pubblicazione Autore(i) File
Algorithms for Biological Graphs: Analysis and Enumeration 2013 Andrea Marino
Algorithms for Biological Graphs: Analysis and Enumeration 2014 Marino A
Analysis and enumeration: Algorithms for biological graphs 2015 Marino Andrea
An analysis of the Bitcoin users graph: inferring unusual behaviours, 2016 Di Francesco Maesa Damiano; Marino Andrea; Ricci Laura
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs 2019 Crescenzi, Pierluigi; Magnien, Clémence; Marino, Andrea
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 2018 Alessio Conte; Roberto Grossi; Andrea Marino; Luca Versari
Blind image clustering based on the Normalized Cuts criterion for camera identification 2014 I. Amerini; R. Caldelli; P. Crescenzi; A. Del Mastio; A. Marino
The bow tie structure of the Bitcoin users graph 2019 Maesa D.D.F.; Marino A.; Ricci L.
BUbiNG: Massive Crawling for the Masses 2018 Paolo Boldi; Andrea Marino; Massimo Santini; Sebastiano Vigna
BUbiNG: Massive crawling for the masses 2014 Boldi, Paolo; Marino, Andrea; Santini, Massimo; Vigna, Sebastiano
Clique covering of large real-world networks 2016 Conte Alessio; Grossi Roberto; Marino Andrea
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 2018 Alessio Conte; Gaspare Ferraro; Roberto Grossi; Andrea Marino; Kunihiko Sadakane; Takeaki Uno
Coloring temporal graphs 2022 Marino A.; Silva A.
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 2011 P. Crescenzi; R. Grossi; L. Lanzi; A. Marino
Computing top-k closeness centrality faster in unweighted graphs 2016 Bergamini Elisabetta; Borassi Michele; Crescenzi Pierluigi; Marino Andrea; Meyerhenke Henning
Computing top-k Closeness Centrality Faster in Unweighted Graphs 2019 Bergamini, Elisabetta; Borassi, Michele; Crescenzi, Pierluigi; Marino, Andrea; Meyerhenke, Henning
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 2018 Alessio Conte; Tiziano De Matteis; Daniele De Sensi; Roberto Grossi; Andrea Marino; Luca Versari
Data-driven analysis of Bitcoin properties: exploiting the users graph 2018 Di Francesco Maesa, Damiano; Marino, Andrea; Ricci, Laura
Degrees of Separation and Diameter in Large Graphs 2018 Crescenzi, Pierluigi; Marino, Andrea
Detecting artificial behaviours in the Bitcoin users graph 2017 Damiano Di Francesco Maesa; Andrea Marino; Laura Ricci