MARINO, ANDREA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 7.065
EU - Europa 3.552
AS - Asia 2.790
SA - Sud America 687
Continente sconosciuto - Info sul continente non disponibili 127
AF - Africa 93
OC - Oceania 25
Totale 14.339
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.949
RU - Federazione Russa 1.124
IT - Italia 1.121
CN - Cina 591
SG - Singapore 588
HK - Hong Kong 586
BR - Brasile 558
IE - Irlanda 364
VN - Vietnam 356
SE - Svezia 259
KR - Corea 211
PL - Polonia 151
FR - Francia 103
CH - Svizzera 86
JO - Giordania 83
IN - India 75
BD - Bangladesh 74
GB - Regno Unito 71
JP - Giappone 67
AR - Argentina 64
CA - Canada 58
AT - Austria 57
DE - Germania 45
NL - Olanda 42
FI - Finlandia 41
ID - Indonesia 41
ES - Italia 27
AU - Australia 25
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
JM - Giamaica 8
PH - Filippine 7
UZ - Uzbekistan 7
CR - Costa Rica 6
GE - Georgia 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
PR - Porto Rico 3
AM - Armenia 2
AZ - Azerbaigian 2
BS - Bahamas 2
CZ - Repubblica Ceca 2
ET - Etiopia 2
GR - Grecia 2
GT - Guatemala 2
HN - Honduras 2
LK - Sri Lanka 2
LU - Lussemburgo 2
NI - Nicaragua 2
OM - Oman 2
SV - El Salvador 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
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
PT - Portogallo 1
Totale 14.210
Salva come PNG Salva come JPEG
Città #
Santa Clara 2.240
Ashburn 652
Fairfield 515
Hong Kong 470
Singapore 408
Dublin 352
San Jose 339
Chandler 254
Woodbridge 250
Milan 231
Seoul 209
Seattle 197
Houston 193
Cambridge 176
Beijing 167
Wilmington 162
Warsaw 148
Ann Arbor 133
Florence 127
Lawrence 122
Altamura 121
Ho Chi Minh City 108
The Dalles 101
Rome 100
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 45
Clifton 43
Mumbai 39
Dallas 34
Boston 33
Boardman 31
Council Bluffs 31
Kent 28
San Diego 28
Shanghai 25
Naaldwijk 23
Naples 23
Melbourne 22
Redondo Beach 22
Turin 22
Abidjan 20
Da Nang 19
Norwalk 19
Des Moines 18
Figino 18
Rio de Janeiro 18
Bologna 17
Barcelona 16
Jakarta 16
Dearborn 14
London 14
Palermo 14
Haiphong 13
Belo Horizonte 12
Brussels 12
Lappeenranta 12
New Delhi 12
Toronto 12
West Jordan 12
Bari 11
Brasília 11
Chicago 11
Falls Church 11
Genoa 11
Yubileyny 11
Guayaquil 10
Helsinki 10
Santiago 10
Atlanta 9
Brooklyn 9
Miano 9
Nuremberg 9
Orem 9
Salt Lake City 9
Santo André 9
Serra 9
Abuja 8
Amsterdam 8
Curitiba 8
Hillsboro 8
Izmir 8
Johannesburg 8
Monza 8
Padua 8
Pescara 8
Thái Bình 8
Alexandria 7
Biên Hòa 7
Cagliari 7
Totale 9.587
Salva come PNG Salva come JPEG
Nome #
Algorithms for Biological Graphs: Analysis and Enumeration 334
Data-driven analysis of Bitcoin properties: exploiting the users graph 266
Node Similarity with q-Grams for Real-World Labeled Networks 230
Optimal Listing of Cycles and st-Paths in Undirected Graphs 228
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 219
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 214
Computing top-k Closeness Centrality Faster in Unweighted Graphs 214
Listing maximal independent sets with minimal space and bounded delay 212
Efficient enumeration of graph orientations with sources 210
Blind image clustering based on the Normalized Cuts criterion for camera identification 204
Discovering K-Trusses in Large-Scale Networks 204
Directing road networks by listing strong orientations 203
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 201
Listing acyclic orientations of graphs with single and multiple sources 201
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 198
BUbiNG: Massive Crawling for the Masses 196
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 195
Leveraging the users graph and trustful transactions for the analysis of Bitcoin price 193
Smooth movement and Manhattan path based random waypoint mobility 191
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs 191
K-plex cover pooling for graph neural networks 191
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 190
Enumerating Cyclic Orientations of a Graph 187
ON COMPUTING THE DIAMETER OF REAL-WORLD DIRECTED (WEIGHTED) GRAPHS 185
Computing top-k closeness centrality faster in unweighted graphs 185
Listing maximal subgraphs satisfying strongly accessible properties∗ 185
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs 184
Clique covering of large real-world networks 184
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games 182
Listing Subgraphs by Cartesian Decomposition 182
On Computing Optimal Temporal Branchings 180
On computing the diameter of real-world undirected graphs 180
An analysis of the Bitcoin users graph: inferring unusual behaviours, 180
On computing the hyperbolicity of real-world graphs 179
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 178
Detecting artificial behaviours in the Bitcoin users graph 178
Algorithms for Biological Graphs: Analysis and Enumeration 175
On Computing Optimal Temporal Branchings and Spanning Subgraphs 171
Degrees of Separation and Diameter in Large Graphs 169
A fast discovery algorithm for large common connected induced subgraphs 168
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound 167
Entity-linking via graph-distanceminimization 167
Topical clustering of search results 167
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 167
On Computing Large Temporal (Unilateral) Connected Components 166
Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph 164
A fast algorithm for large common connected induced subgraphs 164
Using graph distances for named-entity linking 162
The bow tie structure of the Bitcoin users graph 161
Coloring temporal graphs 160
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. 155
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
Mobile mapping to support an integrated transport-territory modelling approach 150
On computing large temporal (unilateral) connected components 149
Synchronous context-free grammars and optimal linear parsing strategies 147
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 146
The graph structure of bitcoin 146
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs 146
Analysis and enumeration: algorithms for biological graphs 146
Structural and dynamical analysis of biological networks 145
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs 144
Large-scale clique cover of real-world networks 142
On Computing the Diameter of (Weighted) Link Streams 141
BUbiNG: Massive crawling for the masses 141
On the Solvability of the Six Degrees of Kevin Bacon Game 139
Edge-Disjoint Branchings in Temporal Graphs 138
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure 136
Eulerian Walks in Temporal Graphs 131
Telling Stories Fast 131
Efficient Bubble Enumeration in Directed Graphs 129
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional 127
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 127
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 119
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs 117
Edge-disjoint branchings in temporal digraphs 116
On computing the diameter of (weighted) link streams 116
High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs 114
Preface: WEPA 2018 112
Finding Structurally and Temporally Similar Trajectories in Graphs 109
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 97
Locality Filtering for Efficient Ride Sharing Platforms 93
Listing maximal H-free subgraphs 91
Disjoint Temporal Walks Under Waiting Time Constraints 58
Spanner Enumeration for Temporal Graphs 50
Making the interval membership width of temporal graphs connected and bidirectional 38
Output-sensitive enumeration of maximal cliques in temporal graphs 31
Matching and Edge Cover in Temporal Graphs 27
Totale 14.339
Salva come PNG Salva come JPEG
Categoria #
all - tutte 38.151
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 38.151
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022526 0 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/2027248 214 34 0 0 0 0 0 0 0 0 0 0
Totale 14.339