MARINO, ANDREA Statistiche
MARINO, ANDREA
DIPARTIMENTO DI INFORMATICA
Using graph distances for named-entity linking
In corso di stampa Blanco, Roi; Boldi, Paolo; Marino, Andrea
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs
2020-01-01 Conte, A.; Crescenzi, P.; Marino, A.; Punzi, G.
Finding Structurally and Temporally Similar Trajectories in Graphs
2020-01-01 Grossi, Roberto; Marino, Andrea; Moghtasedi, Shima
Large-scale clique cover of real-world networks
2020-01-01 Conte, A.; Grossi, R.; Marino, A.
Leveraging the Users Graph and Trustful Transactions for the Analysis of Bitcoin Price
2020-01-01 Crowcroft, Jon; DI FRANCESCO MAESA, Damiano; Magrini, Alessandro; Marino, Andrea; Ricci, Laura
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
2020-01-01 Conte, A.; Grossi, R.; Marino, A.; Versari, L.
The bow tie structure of the Bitcoin users graph
2020-01-01 Di Francesco Maesa, D.; Marino, A.; Ricci, L.
Truly scalable K-Truss and max-truss algorithms for community detection in graphs
2020-01-01 Conte, A.; De Sensi, D.; Grossi, R.; Marino, A.; Versari, L.
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph
2019-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea
The graph structure of bitcoin
2019-01-01 Di Francesco Maesa, D.; Marino, A.; Ricci, L.
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs
2018-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca
BUbiNG: Massive Crawling for the Masses
2018-01-01 Boldi, Paolo; Marino, Andrea; Santini, Massimo; Vigna, Sebastiano
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick
2018-01-01 Conte, Alessio; Ferraro, Gaspare; Grossi, Roberto; Marino, Andrea; Sadakane, Kunihiko; Uno, Takeaki
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes
2018-01-01 Conte, Alessio; DE MATTEIS, Tiziano; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
Degrees of Separation and Diameter in Large Graphs
2018-01-01 Crescenzi, Pierluigi; Marino, Andrea
Discovering K-Trusses in Large-Scale Networks
2018-01-01 Conte, Alessio; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs
2018-01-01 Grossi, Roberto; Marino, Andrea; Versari, Luca
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search
2018-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca
Listing Subgraphs by Cartesian Decomposition
2018-01-01 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca
Listing subgraphs by cartesian decomposition
2018-01-01 Conte, A.; Grossi, R.; Marino, A.; Rizzi, R.; Versari, L.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Using graph distances for named-entity linking | In corso di stampa | Blanco, Roi; Boldi, Paolo; Marino, Andrea | |
| Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs | 1-gen-2020 | Conte, A.; Crescenzi, P.; Marino, A.; Punzi, G. | |
| Finding Structurally and Temporally Similar Trajectories in Graphs | 1-gen-2020 | Grossi, Roberto; Marino, Andrea; Moghtasedi, Shima | |
| Large-scale clique cover of real-world networks | 1-gen-2020 | Conte, A.; Grossi, R.; Marino, A. | |
| Leveraging the Users Graph and Trustful Transactions for the Analysis of Bitcoin Price | 1-gen-2020 | Crowcroft, Jon; DI FRANCESCO MAESA, Damiano; Magrini, Alessandro; Marino, Andrea; Ricci, Laura | |
| Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs | 1-gen-2020 | Conte, A.; Grossi, R.; Marino, A.; Versari, L. | |
| The bow tie structure of the Bitcoin users graph | 1-gen-2020 | Di Francesco Maesa, D.; Marino, A.; Ricci, L. | |
| Truly scalable K-Truss and max-truss algorithms for community detection in graphs | 1-gen-2020 | Conte, A.; De Sensi, D.; Grossi, R.; Marino, A.; Versari, L. | |
| ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph | 1-gen-2019 | Conte, Alessio; Grossi, Roberto; Marino, Andrea | |
| The graph structure of bitcoin | 1-gen-2019 | Di Francesco Maesa, D.; Marino, A.; Ricci, L. | |
| 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 | |
| BUbiNG: Massive Crawling for the Masses | 1-gen-2018 | Boldi, Paolo; Marino, Andrea; Santini, Massimo; Vigna, Sebastiano | |
| 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 | |
| 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 | |
| Degrees of Separation and Diameter in Large Graphs | 1-gen-2018 | Crescenzi, Pierluigi; Marino, Andrea | |
| Discovering K-Trusses in Large-Scale Networks | 1-gen-2018 | Conte, Alessio; DE SENSI, Daniele; Grossi, Roberto; Marino, Andrea; Versari, Luca | |
| Efficient Algorithms for Listing k Disjoint st-Paths in Graphs | 1-gen-2018 | Grossi, Roberto; Marino, Andrea; Versari, Luca | |
| Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search | 1-gen-2018 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca | |
| Listing Subgraphs by Cartesian Decomposition | 1-gen-2018 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca | |
| Listing subgraphs by cartesian decomposition | 1-gen-2018 | Conte, A.; Grossi, R.; Marino, A.; Rizzi, R.; Versari, L. |