MARINO, ANDREA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.874
EU - Europa 3.514
AS - Asia 2.780
SA - Sud America 685
AF - Africa 93
OC - Oceania 25
Continente sconosciuto - Info sul continente non disponibili 2
Totale 13.973
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.803
RU - Federazione Russa 1.123
IT - Italia 1.086
CN - Cina 589
SG - Singapore 586
HK - Hong Kong 585
BR - Brasile 557
IE - Irlanda 364
VN - Vietnam 354
SE - Svezia 259
KR - Corea 211
PL - Polonia 151
FR - Francia 102
CH - Svizzera 86
JO - Giordania 83
IN - India 75
BD - Bangladesh 72
GB - Regno Unito 71
JP - Giappone 67
AR - Argentina 63
AT - Austria 57
DE - Germania 45
FI - Finlandia 41
NL - Olanda 41
ID - Indonesia 40
ES - Italia 27
AU - Australia 25
CA - Canada 23
MX - Messico 23
EC - Ecuador 21
CI - Costa d'Avorio 20
BE - Belgio 19
TR - Turchia 19
ZA - Sudafrica 19
IQ - Iraq 18
UA - Ucraina 17
MA - Marocco 15
CL - Cile 13
NG - Nigeria 11
PK - Pakistan 11
CO - Colombia 10
PY - Paraguay 10
SA - Arabia Saudita 9
PH - Filippine 7
UZ - Uzbekistan 7
CR - Costa Rica 6
GE - Georgia 6
JM - Giamaica 6
BJ - Benin 5
KE - Kenya 5
NP - Nepal 5
RO - Romania 5
AL - Albania 4
DO - Repubblica Dominicana 4
MY - Malesia 4
PE - Perù 4
TJ - Tagikistan 4
TN - Tunisia 4
TW - Taiwan 4
VE - Venezuela 4
AE - Emirati Arabi Uniti 3
BW - Botswana 3
DZ - Algeria 3
EG - Egitto 3
IL - Israele 3
IR - Iran 3
LB - Libano 3
PA - Panama 3
AM - Armenia 2
AZ - Azerbaigian 2
CZ - Repubblica Ceca 2
ET - Etiopia 2
GR - Grecia 2
LK - Sri Lanka 2
LU - Lussemburgo 2
OM - Oman 2
UY - Uruguay 2
A1 - Anonimo 1
BG - Bulgaria 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BO - Bolivia 1
CG - Congo 1
DK - Danimarca 1
GA - Gabon 1
GT - Guatemala 1
HN - Honduras 1
HR - Croazia 1
HU - Ungheria 1
IM - Isola di Man 1
KH - Cambogia 1
KZ - Kazakistan 1
LI - Liechtenstein 1
LT - Lituania 1
LV - Lettonia 1
NI - Nicaragua 1
PR - Porto Rico 1
PT - Portogallo 1
SK - Slovacchia (Repubblica Slovacca) 1
SN - Senegal 1
Totale 13.970
Salva come PNG Salva come JPEG
Città #
Santa Clara 2.234
Ashburn 645
Fairfield 515
Hong Kong 469
Singapore 406
Dublin 352
San Jose 324
Chandler 254
Woodbridge 250
Milan 221
Seoul 209
Seattle 197
Houston 189
Cambridge 175
Beijing 166
Wilmington 162
Warsaw 148
Ann Arbor 133
Florence 125
Lawrence 122
Altamura 121
Ho Chi Minh City 106
The Dalles 100
Rome 97
Hefei 88
Bern 80
Lauterbourg 77
Hanoi 76
Princeton 76
Moscow 68
Tokyo 64
Los Angeles 59
Medford 58
Buffalo 57
Vienna 54
São Paulo 49
New York 44
Clifton 43
Mumbai 39
Dallas 34
Boston 33
Boardman 31
Council Bluffs 30
Kent 28
San Diego 25
Shanghai 25
Naaldwijk 23
Melbourne 22
Redondo Beach 22
Naples 21
Turin 21
Abidjan 20
Da Nang 19
Norwalk 19
Rio de Janeiro 18
Des Moines 17
Barcelona 16
Bologna 16
Figino 16
Jakarta 16
Dearborn 14
London 14
Palermo 14
Haiphong 13
Belo Horizonte 12
Brussels 12
Lappeenranta 12
New Delhi 12
West Jordan 12
Bari 11
Brasília 11
Chicago 11
Falls Church 11
Yubileyny 11
Genoa 10
Guayaquil 10
Helsinki 10
Santiago 10
Atlanta 9
Miano 9
Nuremberg 9
Orem 9
Santo André 9
Serra 9
Toronto 9
Abuja 8
Amsterdam 8
Brooklyn 8
Curitiba 8
Hillsboro 8
Izmir 8
Johannesburg 8
Monza 8
Padua 8
Pescara 8
Salt Lake City 8
Thái Bình 8
Alexandria 7
Biên Hòa 7
Cagliari 7
Totale 9.514
Salva come PNG Salva come JPEG
Nome #
Algorithms for Biological Graphs: Analysis and Enumeration 327
Data-driven analysis of Bitcoin properties: exploiting the users graph 263
Optimal Listing of Cycles and st-Paths in Undirected Graphs 228
Node Similarity with q-Grams for Real-World Labeled Networks 221
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 217
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 213
Computing top-k Closeness Centrality Faster in Unweighted Graphs 211
Listing maximal independent sets with minimal space and bounded delay 209
Efficient enumeration of graph orientations with sources 207
Blind image clustering based on the Normalized Cuts criterion for camera identification 201
Discovering K-Trusses in Large-Scale Networks 201
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 200
Directing road networks by listing strong orientations 198
Listing acyclic orientations of graphs with single and multiple sources 198
BUbiNG: Massive Crawling for the Masses 193
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs 191
Smooth movement and Manhattan path based random waypoint mobility 190
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 190
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 189
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 189
Leveraging the users graph and trustful transactions for the analysis of Bitcoin price 188
K-plex cover pooling for graph neural networks 188
Computing top-k closeness centrality faster in unweighted graphs 184
Clique covering of large real-world networks 184
Enumerating Cyclic Orientations of a Graph 183
ON COMPUTING THE DIAMETER OF REAL-WORLD DIRECTED (WEIGHTED) GRAPHS 182
Listing maximal subgraphs satisfying strongly accessible properties∗ 182
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs 182
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games 181
On computing the hyperbolicity of real-world graphs 179
On computing the diameter of real-world undirected graphs 178
An analysis of the Bitcoin users graph: inferring unusual behaviours, 178
On Computing Optimal Temporal Branchings 176
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 176
Listing Subgraphs by Cartesian Decomposition 176
Algorithms for Biological Graphs: Analysis and Enumeration 175
Detecting artificial behaviours in the Bitcoin users graph 175
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound 167
A fast discovery algorithm for large common connected induced subgraphs 167
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 167
Degrees of Separation and Diameter in Large Graphs 166
Topical clustering of search results 166
Entity-linking via graph-distanceminimization 164
On Computing Large Temporal (Unilateral) Connected Components 164
A fast algorithm for large common connected induced subgraphs 163
Using graph distances for named-entity linking 162
Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph 162
The bow tie structure of the Bitcoin users graph 158
Coloring temporal graphs 158
On Computing Optimal Temporal Branchings and Spanning Subgraphs 155
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. 154
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets 153
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs 151
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 146
Mobile mapping to support an integrated transport-territory modelling approach 146
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs 145
Analysis and enumeration: algorithms for biological graphs 145
On computing large temporal (unilateral) connected components 144
Synchronous context-free grammars and optimal linear parsing strategies 144
Structural and dynamical analysis of biological networks 144
The graph structure of bitcoin 143
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs 140
BUbiNG: Massive crawling for the masses 139
On Computing the Diameter of (Weighted) Link Streams 138
Large-scale clique cover of real-world networks 138
On the Solvability of the Six Degrees of Kevin Bacon Game 137
Edge-Disjoint Branchings in Temporal Graphs 135
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure 134
Telling Stories Fast 131
Eulerian Walks in Temporal Graphs 130
Efficient Bubble Enumeration in Directed Graphs 128
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 127
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional 126
Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs 125
Truly scalable K-Truss and max-truss algorithms for community detection in graphs 117
Edge-disjoint branchings in temporal digraphs 114
On computing the diameter of (weighted) link streams 114
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs 113
Finding Structurally and Temporally Similar Trajectories in Graphs 109
Preface: WEPA 2018 109
High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs 108
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs 104
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems 96
Locality Filtering for Efficient Ride Sharing Platforms 91
Listing maximal H-free subgraphs 71
Disjoint Temporal Walks Under Waiting Time Constraints 52
Spanner Enumeration for Temporal Graphs 44
Making the interval membership width of temporal graphs connected and bidirectional 36
Output-sensitive enumeration of maximal cliques in temporal graphs 28
Matching and Edge Cover in Temporal Graphs 27
Totale 14.098
Salva come PNG Salva come JPEG
Categoria #
all - tutte 36.842
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 36.842
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022553 27 41 41 54 25 24 21 38 34 30 65 153
2022/20231.525 130 363 90 50 111 242 176 91 157 3 22 90
2023/2024509 10 45 78 21 70 81 16 74 11 49 42 12
2024/20254.367 115 317 185 452 1.469 1.005 58 372 136 58 94 106
2025/20264.992 352 547 412 722 456 228 432 243 415 293 158 734
2026/20277 7 0 0 0 0 0 0 0 0 0 0 0
Totale 14.098