CINECA IRIS Institutional Research Information System

MARINO, ANDREA Statistiche

MARINO, ANDREA  

DIPARTIMENTO DI INFORMATICA  

Mostra records
Risultati 1 - 20 di 56 (tempo di esecuzione: 0.021 secondi).
Titolo Data di pubblicazione Autore(i) File
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 1-gen-2011 Crescenzi, Pilu; Grossi, Roberto; Lanzi, Leonardo; Marino, Andrea
A fast algorithm for large common connected induced subgraphs 1-gen-2017 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Tattini, Lorenzo; Versari, Luca
An analysis of the Bitcoin users graph: inferring unusual behaviours, 1-gen-2016 DI FRANCESCO MAESA, Damiano; Marino, Andrea; Ricci, LAURA EMILIA MARIA
Analysis and enumeration: Algorithms for biological graphs 1-gen-2015 Marino, Andrea
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 1-gen-2018 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca
Blind image clustering based on the Normalized Cuts criterion for camera identification 1-gen-2014 Amerini, I.; Caldelli, R.; Crescenzi, P.; Del Mastio, A.; Marino, Andrea
BUbiNG: Massive Crawling for the Masses 1-gen-2018 Boldi, Paolo; Marino, Andrea; Santini, Massimo; Vigna, Sebastiano
BUbiNG: Massive Crawling for the Masses 1-gen-2014 Boldi, Paolo; Marino, Andrea; Santini, Massimo; Vigna, Sebastiano
Clique covering of large real-world networks 1-gen-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 1-gen-2018 Conte, Alessio; Ferraro, Gaspare; Grossi, Roberto; Marino, Andrea; Sadakane, Kunihiko; Uno, Takeaki
Computing top-a; closeness centrality faster in unweighted graphs 1-gen-2016 Bergamini, Elisabetta; Borassi, Michele; Crescenzi, Pierluigi; Marino, Andrea; Meyerhenke, Henning
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 1-gen-2018 Conte, Alessio; DE MATTEIS, Tiziano; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
Data-driven analysis of Bitcoin properties: exploiting the users graph 1-gen-2017 Di Francesco Maesa, Damiano; Marino, Andrea; Ricci, Laura
Degrees of Separation and Diameter in Large Graphs 1-gen-2018 Crescenzi, Pierluigi; Marino, Andrea
Detecting artificial behaviours in the Bitcoin users graph 1-gen-2017 DI FRANCESCO MAESA, Damiano; Marino, Andrea; Ricci, LAURA EMILIA MARIA
Directing road networks by listing strong orientations 1-gen-2016 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca
Discovering K-Trusses in Large-Scale Networks 1-gen-2018 Conte, Alessio; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 1-gen-2019 Conte, Alessio; Grossi, Roberto; Marino, Andrea
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs 1-gen-2018 Grossi, Roberto; Marino, Andrea; Versari, Luca
Efficient bubble enumeration in directed graphs 1-gen-2012 Birmele, E.; Crescenzi, P; Ferreira, R.; Grossi, Roberto; Lacroix, V.; Marino, Andrea; Pisanti, Nadia; Sacomoto, G. A.; Sagot, M. F.