CINECA IRIS Institutional Research Information System

MARINO, ANDREA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.764
EU - Europa 1.063
AS - Asia 438
AF - Africa 228
SA - Sud America 11
Continente sconosciuto - Info sul continente non disponibili 2
OC - Oceania 2
Totale 4.508
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.699
IT - Italia 452
CN - Cina 240
BG - Bulgaria 155
SE - Svezia 155
CI - Costa d'Avorio 112
FR - Francia 71
CA - Canada 64
NG - Nigeria 57
SN - Senegal 57
DE - Germania 53
SG - Singapore 48
VN - Vietnam 47
NL - Olanda 37
FI - Finlandia 32
GB - Regno Unito 29
HK - Hong Kong 25
TR - Turchia 21
RU - Federazione Russa 16
GR - Grecia 13
KR - Corea 13
IN - India 12
BE - Belgio 10
JP - Giappone 10
UA - Ucraina 10
CH - Svizzera 8
BR - Brasile 7
TW - Taiwan 6
IR - Iran 5
PH - Filippine 5
RO - Romania 5
CZ - Repubblica Ceca 4
IE - Irlanda 4
PE - Perù 3
PL - Polonia 3
EU - Europa 2
MY - Malesia 2
QA - Qatar 2
RE - Reunion 2
AE - Emirati Arabi Uniti 1
AU - Australia 1
CL - Cile 1
EE - Estonia 1
ES - Italia 1
HU - Ungheria 1
KZ - Kazakistan 1
LV - Lettonia 1
NO - Norvegia 1
NZ - Nuova Zelanda 1
PA - Panama 1
SK - Slovacchia (Repubblica Slovacca) 1
Totale 4.508
Salva come PNG Salva come JPEG
Città #
Woodbridge 376
Fairfield 363
Houston 317
Ann Arbor 200
Chandler 197
Ashburn 170
Seattle 158
Sofia 155
Cambridge 135
Wilmington 126
Beijing 116
Abidjan 112
New York 89
Milan 82
Princeton 64
Florence 62
Dakar 57
Lagos 57
Lawrence 56
Ottawa 54
Serra 52
Marseille 51
Des Moines 33
Naaldwijk 31
Medford 28
Nanjing 27
Dong Ket 25
Boulder 20
San Diego 20
Izmir 19
Jacksonville 18
Torino 18
Dicomano 17
Redwood City 15
Rome 15
Hong Kong 14
Nanchang 12
Changsha 11
Piano 11
Brussels 10
Dearborn 10
Düsseldorf 9
Hebei 9
Shenyang 9
Central District 8
Indiana 7
Jiaxing 7
Pisa 7
Bern 6
Capannori 6
Paris 6
Shanghai 6
Hefei 5
Parabiago 5
Tianjin 5
Dublin 4
Jüchen 4
London 4
Rho 4
Belo Horizonte 3
Boardman 3
Gallarate 3
Geldrop 3
Kunming 3
Lima 3
Mountain View 3
Pavia 3
Signa 3
Tokyo 3
Vancouver 3
Vólos 3
Arezzo 2
Bremen 2
Buffalo 2
Casoria 2
Cerro Maggiore 2
Dallas 2
Falls Church 2
Fremont 2
Gladbeck 2
Guangzhou 2
L'Etang-Sale 2
Lacchiarella 2
Las Vegas 2
Livorno 2
Los Angeles 2
Mandaluyong City 2
Montecatini Terme 2
Ogden 2
Osaka 2
Pistoia 2
Praia A Mare 2
Pune 2
Quezon City 2
Rio De Janeiro 2
Saint-folquin 2
San Francisco 2
Sete Lagoas 2
Xian 2
Ames 1
Totale 3.607
Salva come PNG Salva come JPEG
Nome #
An analysis of the Bitcoin users graph: inferring unusual behaviours, 205
Detecting artificial behaviours in the Bitcoin users graph 132
Data-driven analysis of Bitcoin properties: exploiting the users graph 131
On computing the diameter of real-world undirected graphs 126
null 120
Enumerating Cyclic Orientations of a Graph 119
Efficient bubble enumeration in directed graphs 116
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 113
Blind image clustering based on the Normalized Cuts criterion for camera identification 112
Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph 111
Directing road networks by listing strong orientations 111
Topical clustering of search results 106
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 103
The bow tie structure of the Bitcoin users graph 97
Clique covering of large real-world networks 96
Node Similarity with q-Grams for Real-World Labeled Networks 96
Leveraging the Users Graph and Trustful Transactions for the Analysis of Bitcoin Price 95
On computing the diameter of real-world directed (weighted) graphs 92
Structural and dynamical analysis of biological networks 92
Large-scale clique cover of real-world networks 92
Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets 91
The graph structure of bitcoin 90
Degrees of Separation and Diameter in Large Graphs 88
Discovering K-Trusses in Large-Scale Networks 88
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 87
Smooth movement and Manhattan path based Random Waypoint mobility 85
Telling metabolic stories to explore metabolomics data: A case study on the yeast response to cadmium exposure 85
A fast algorithm for large common connected induced subgraphs 82
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 80
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound 79
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs 77
Computing top-a; closeness centrality faster in unweighted graphs 75
Spatial node distribution of Manhattan path based random waypoint mobility models with applications 72
BUbiNG: Massive Crawling for the Masses 72
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 68
Entity-linking via graph-distanceminimization 67
Listing maximal independent sets with minimal space and bounded delay 66
BUbiNG: Massive Crawling for the Masses 61
null 61
Optimal head-driven parsing complexity for Linear Context-Free Rewriting Systems 59
null 59
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 59
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 55
null 54
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 54
null 51
On the solvability of the six degrees of Kevin Bacon game: A faster graph diameter and radius computation method 49
Telling stories fast: Via linear-time delay pitch enumeration 45
null 42
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 42
null 41
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 40
Optimal Listing of Cycles and st-Paths in Undirected Graphs 39
Truly scalable K-Truss and max-truss algorithms for community detection in graphs 36
Listing Subgraphs by Cartesian Decomposition 34
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs 31
Analysis and enumeration: Algorithms for biological graphs 27
Finding Structurally and Temporally Similar Trajectories in Graphs 27
Listing subgraphs by cartesian decomposition 24
Using graph distances for named-entity linking 15
Synchronous context-free grammars and optimal linear parsing strategies 13
On computing the hyperbolicity of real-world graphs 11
Listing acyclic orientations of graphs with single and multiple sources 10
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games 8
Totale 4.664
Salva come PNG Salva come JPEG
Categoria #
all - tutte 11.866
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 11.866
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019368 0 0 0 0 0 0 0 0 0 100 150 118
2019/2020913 120 57 28 76 80 85 96 85 95 67 95 29
2020/2021410 27 25 19 35 25 22 14 47 50 32 55 59
2021/2022590 10 44 29 25 123 99 27 33 29 17 17 137
2022/2023887 68 107 46 36 118 71 1 39 294 13 81 13
2023/2024406 38 45 73 29 71 107 23 10 7 3 0 0
Totale 4.664