GROSSI, ROBERTO
 Distribuzione geografica
Continente #
NA - Nord America 859
EU - Europa 337
AS - Asia 106
Totale 1.302
Nazione #
US - Stati Uniti d'America 856
IE - Irlanda 110
SE - Svezia 86
IT - Italia 58
HK - Hong Kong 41
CN - Cina 32
CH - Svizzera 27
AT - Austria 22
JO - Giordania 22
ES - Italia 9
GB - Regno Unito 7
BE - Belgio 4
UA - Ucraina 4
CA - Canada 3
FR - Francia 3
GE - Georgia 3
RO - Romania 3
TJ - Tagikistan 3
UZ - Uzbekistan 3
KR - Corea 2
NL - Olanda 2
DE - Germania 1
GR - Grecia 1
Totale 1.302
Città #
Fairfield 148
Dublin 110
Chandler 104
Ann Arbor 72
Woodbridge 71
Ashburn 68
Wilmington 51
Houston 48
Seattle 46
Cambridge 45
Altamura 30
Lawrence 30
Bern 27
Beijing 25
Hong Kong 24
Medford 23
Vienna 22
Princeton 19
Dearborn 14
West Jordan 10
Barcelona 8
Kent 7
Thiene 6
Norwalk 5
Brussels 4
Falls Church 3
Redmond 3
Serra 3
Shanghai 3
Florence 2
Hillsboro 2
Kunming 2
London 2
Naaldwijk 2
Napoli 2
Seoul 2
Toronto 2
Atlanta 1
Augusta 1
Cedar Knolls 1
Cerro Maggiore 1
Costa Mesa 1
Hamilton 1
Ioannina 1
Islington 1
Jinan 1
Los Angeles 1
Milan 1
Montevarchi 1
Nanjing 1
Nuremberg 1
Parabiago 1
Redwood City 1
San Diego 1
San Jose 1
Terrassa 1
Trumbull 1
Verona 1
Totale 1.066
Nome #
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 98
Optimal Listing of Cycles and st-Paths in Undirected Graphs 95
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 83
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 83
Listing maximal independent sets with minimal space and bounded delay 81
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 77
Directing road networks by listing strong orientations 74
Node Similarity with q-Grams for Real-World Labeled Networks 73
Listing acyclic orientations of graphs with single and multiple sources 73
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 69
Clique covering of large real-world networks 69
Efficient enumeration of graph orientations with sources 68
Discovering K-Trusses in Large-Scale Networks 67
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs 67
Enumerating Cyclic Orientations of a Graph 67
A fast algorithm for large common connected induced subgraphs 66
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 43
Listing Subgraphs by Cartesian Decomposition 41
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 34
Totale 1.328
Categoria #
all - tutte 4.091
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 4.091


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/201999 0 0 0 0 0 0 0 0 0 0 48 51
2019/2020327 24 9 10 26 35 37 57 35 36 18 29 11
2020/2021118 6 13 6 14 1 5 7 18 18 8 11 11
2021/2022112 5 9 8 4 3 9 4 9 4 9 8 40
2022/2023480 37 107 39 18 40 81 54 26 39 2 10 27
2023/2024120 2 15 19 2 5 27 1 25 2 12 10 0
Totale 1.328