MARINO, ANDREA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.080
EU - Europa 2.728
AS - Asia 2.241
SA - Sud America 646
AF - Africa 76
OC - Oceania 25
Continente sconosciuto - Info sul continente non disponibili 1
Totale 11.797
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.034
RU - Federazione Russa 1.123
HK - Hong Kong 576
BR - Brasile 534
SG - Singapore 489
CN - Cina 460
IT - Italia 427
IE - Irlanda 361
SE - Svezia 259
KR - Corea 211
VN - Vietnam 203
PL - Polonia 150
CH - Svizzera 85
JO - Giordania 80
IN - India 69
AR - Argentina 61
GB - Regno Unito 61
AT - Austria 56
DE - Germania 39
ID - Indonesia 39
NL - Olanda 34
FI - Finlandia 33
AU - Australia 25
ES - Italia 23
CI - Costa d'Avorio 20
EC - Ecuador 20
BE - Belgio 19
MX - Messico 19
BD - Bangladesh 17
FR - Francia 17
TR - Turchia 17
ZA - Sudafrica 17
UA - Ucraina 16
CA - Canada 15
MA - Marocco 14
IQ - Iraq 13
JP - Giappone 13
PY - Paraguay 10
CO - Colombia 8
PK - Pakistan 8
SA - Arabia Saudita 6
UZ - Uzbekistan 6
BJ - Benin 5
GE - Georgia 5
RO - Romania 5
AL - Albania 4
CL - Cile 4
CR - Costa Rica 4
KE - Kenya 4
NP - Nepal 4
TJ - Tagikistan 4
BW - Botswana 3
DO - Repubblica Dominicana 3
EG - Egitto 3
IR - Iran 3
PA - Panama 3
PE - Perù 3
TN - Tunisia 3
VE - Venezuela 3
AE - Emirati Arabi Uniti 2
AM - Armenia 2
AZ - Azerbaigian 2
CZ - Repubblica Ceca 2
DZ - Algeria 2
GR - Grecia 2
LB - Libano 2
LK - Sri Lanka 2
LU - Lussemburgo 2
NG - Nigeria 2
PH - Filippine 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
HN - Honduras 1
HR - Croazia 1
HU - Ungheria 1
IL - Israele 1
IM - Isola di Man 1
KH - Cambogia 1
KZ - Kazakistan 1
LI - Liechtenstein 1
LT - Lituania 1
LV - Lettonia 1
MY - Malesia 1
PT - Portogallo 1
SK - Slovacchia (Repubblica Slovacca) 1
SN - Senegal 1
TT - Trinidad e Tobago 1
Totale 11.797
Salva come PNG Salva come JPEG
Città #
Santa Clara 2.222
Fairfield 515
Hong Kong 464
Ashburn 382
Dublin 352
Singapore 316
Chandler 254
Woodbridge 250
Seoul 209
Seattle 197
Houston 188
Cambridge 174
Beijing 164
Wilmington 162
Warsaw 148
Ann Arbor 133
Lawrence 122
Altamura 120
Florence 114
Hefei 88
Bern 80
Princeton 76
Moscow 68
San Jose 68
Ho Chi Minh City 63
Medford 58
Buffalo 55
The Dalles 53
Vienna 53
Los Angeles 45
Clifton 43
São Paulo 42
Hanoi 39
Mumbai 37
New York 34
Boston 33
Dallas 28
Kent 28
Boardman 26
San Diego 25
Naaldwijk 23
Melbourne 22
Redondo Beach 22
Shanghai 22
Abidjan 20
Norwalk 19
Rio de Janeiro 18
Barcelona 16
Jakarta 16
Dearborn 14
Des Moines 14
London 13
Belo Horizonte 12
Brussels 12
West Jordan 12
Brasília 11
Falls Church 11
Milan 11
New Delhi 11
Rome 11
Yubileyny 11
Guayaquil 10
Tokyo 10
Santo André 9
Serra 9
Curitiba 8
Haiphong 8
Helsinki 8
Hillsboro 8
Izmir 8
Orem 8
Salt Lake City 8
Atlanta 7
Brooklyn 7
Campinas 7
Chicago 7
Fortaleza 7
Johannesburg 7
Lappeenranta 7
Nuremberg 7
Sorocaba 7
Thái Bình 7
Alexandria 6
Andover 6
Augusta 6
Buenos Aires 6
Chennai 6
Da Nang 6
Dong Ket 6
Elk Grove Village 6
Eschweiler 6
Heverlee 6
Hortolândia 6
Manaus 6
Mexico City 6
Pisa 6
Porto Alegre 6
Stockholm 6
Thiene 6
Thái Nguyên 6
Totale 8.121
Salva come PNG Salva come JPEG
Nome #
Algorithms for Biological Graphs: Analysis and Enumeration 294
Data-driven analysis of Bitcoin properties: exploiting the users graph 221
Optimal Listing of Cycles and st-Paths in Undirected Graphs 202
Node Similarity with q-Grams for Real-World Labeled Networks 189
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 188
Computing top-k Closeness Centrality Faster in Unweighted Graphs 186
Listing maximal independent sets with minimal space and bounded delay 185
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 179
Discovering K-Trusses in Large-Scale Networks 179
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 174
Listing acyclic orientations of graphs with single and multiple sources 174
Blind image clustering based on the Normalized Cuts criterion for camera identification 172
Leveraging the users graph and trustful transactions for the analysis of Bitcoin price 171
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 171
K-plex cover pooling for graph neural networks 170
Efficient enumeration of graph orientations with sources 169
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs 169
Smooth movement and Manhattan path based random waypoint mobility 166
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 166
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 166
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs 166
ON COMPUTING THE DIAMETER OF REAL-WORLD DIRECTED (WEIGHTED) GRAPHS 165
BUbiNG: Massive Crawling for the Masses 162
Enumerating Cyclic Orientations of a Graph 161
Clique covering of large real-world networks 161
Directing road networks by listing strong orientations 160
Listing maximal subgraphs satisfying strongly accessible properties∗ 159
On Computing Optimal Temporal Branchings 157
On computing the diameter of real-world undirected graphs 157
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games 157
Detecting artificial behaviours in the Bitcoin users graph 156
Computing top-k closeness centrality faster in unweighted graphs 152
An analysis of the Bitcoin users graph: inferring unusual behaviours, 152
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 152
On computing the hyperbolicity of real-world graphs 152
Algorithms for Biological Graphs: Analysis and Enumeration 150
A fast algorithm for large common connected induced subgraphs 150
Degrees of Separation and Diameter in Large Graphs 148
On Computing Large Temporal (Unilateral) Connected Components 146
Listing Subgraphs by Cartesian Decomposition 145
The bow tie structure of the Bitcoin users graph 144
A fast discovery algorithm for large common connected induced subgraphs 142
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 142
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets 141
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. 139
Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph 139
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound 138
Coloring temporal graphs 137
Using graph distances for named-entity linking 136
Topical clustering of search results 134
Synchronous context-free grammars and optimal linear parsing strategies 130
Entity-linking via graph-distanceminimization 130
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs 129
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs 126
On Computing Optimal Temporal Branchings and Spanning Subgraphs 125
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 124
Efficient Bubble Enumeration in Directed Graphs 122
The graph structure of bitcoin 121
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure 121
Analysis and enumeration: algorithms for biological graphs 121
Mobile mapping to support an integrated transport-territory modelling approach 121
On Computing the Diameter of (Weighted) Link Streams 120
Structural and dynamical analysis of biological networks 118
BUbiNG: Massive crawling for the masses 118
Large-scale clique cover of real-world networks 115
On the Solvability of the Six Degrees of Kevin Bacon Game 113
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs 111
On computing large temporal (unilateral) connected components 110
Edge-Disjoint Branchings in Temporal Graphs 110
Eulerian Walks in Temporal Graphs 109
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 107
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional 104
Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs 103
Truly scalable K-Truss and max-truss algorithms for community detection in graphs 99
Telling Stories Fast 98
Edge-disjoint branchings in temporal digraphs 98
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs 95
Finding Structurally and Temporally Similar Trajectories in Graphs 93
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs 92
On computing the diameter of (weighted) link streams 87
High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs 85
Preface: WEPA 2018 85
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems 81
Locality Filtering for Efficient Ride Sharing Platforms 77
Disjoint Temporal Walks Under Waiting Time Constraints 9
Making the interval membership width of temporal graphs connected and bidirectional 8
Spanner Enumeration for Temporal Graphs 7
Matching and Edge Cover in Temporal Graphs 5
Output-sensitive enumeration of maximal cliques in temporal graphs 2
Listing maximal H-free subgraphs 2
Totale 11.922
Salva come PNG Salva come JPEG
Categoria #
all - tutte 32.253
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 32.253
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021314 0 0 0 0 0 0 28 43 101 59 51 32
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/20262.823 352 547 412 722 456 228 106 0 0 0 0 0
Totale 11.922