VERSARI, LUCA
 Distribuzione geografica
Continente #
NA - Nord America 634
EU - Europa 220
AS - Asia 133
AF - Africa 70
OC - Oceania 1
Totale 1.058
Nazione #
US - Stati Uniti d'America 625
IT - Italia 89
CN - Cina 55
SE - Svezia 55
BG - Bulgaria 47
CI - Costa d'Avorio 33
SG - Singapore 27
SN - Senegal 19
NG - Nigeria 18
HK - Hong Kong 17
VN - Vietnam 17
FR - Francia 15
CA - Canada 9
JP - Giappone 7
DE - Germania 5
GB - Regno Unito 4
IR - Iran 3
BD - Bangladesh 2
IN - India 2
RO - Romania 2
TR - Turchia 2
AT - Austria 1
AU - Australia 1
FI - Finlandia 1
TW - Taiwan 1
UA - Ucraina 1
Totale 1.058
Città #
Fairfield 89
Woodbridge 77
Ashburn 64
Houston 54
Chandler 51
Sofia 47
Cambridge 41
Seattle 41
Beijing 36
Wilmington 35
Abidjan 33
Princeton 23
Dakar 19
Milan 19
New York 19
Lagos 18
Lawrence 18
Serra 17
Florence 16
Marseille 15
Hong Kong 14
Ann Arbor 12
Dong Ket 12
Des Moines 11
Ottawa 8
Medford 7
Rome 5
Hebei 4
Nanjing 4
Pisa 4
Tokyo 4
Danville 3
Redwood City 3
San Diego 3
Torino 3
Bremen 2
Buffalo 2
Dearborn 2
Izano 2
Jiaxing 2
Lacchiarella 2
Los Angeles 2
Netrakona 2
Augusta 1
Canberra 1
Caserta 1
Casoria 1
Changsha 1
Chengdu 1
Hefei 1
Helsinki 1
Izmir 1
Karlsruhe 1
Leawood 1
Livorno 1
London 1
Minatomirai 1
Monmouth Junction 1
Nanchang 1
Norwalk 1
Phoenix 1
Pune 1
San Francisco 1
Shanghai 1
Shenyang 1
Shenzhen 1
Süleyman 1
Taipei 1
Taizhou 1
Tianjin 1
Vienna 1
Totale 873
Nome #
Measuring the clustering effect of BWT via RLE 129
Listing maximal subgraphs satisfying strongly accessible properties∗ 92
Discovering K-Trusses in Large-Scale Networks 88
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 87
A fast algorithm for large common connected induced subgraphs 82
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 80
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs 77
Listing maximal independent sets with minimal space and bounded delay 66
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
Round_Hashing: Implementation of Round Hashing and benchmark 47
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 42
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 40
Truly scalable K-Truss and max-truss algorithms for community detection in graphs 36
Listing Subgraphs by Cartesian Decomposition 34
Zuckerli: A New Compressed Representation for Graphs 34
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables 30
Listing subgraphs by cartesian decomposition 24
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 12
Totale 1.114
Categoria #
all - tutte 3.808
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 3.808


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/201987 0 0 0 0 0 0 0 0 0 0 46 41
2019/2020222 28 7 5 23 17 18 20 20 23 21 33 7
2020/2021134 5 6 0 10 0 20 9 4 33 6 15 26
2021/2022161 3 8 15 3 34 30 1 9 8 4 2 44
2022/2023260 22 24 30 7 27 24 1 7 90 2 19 7
2023/2024145 6 10 36 7 39 34 9 2 1 1 0 0
Totale 1.114