CONTE, ALESSIO
 Distribuzione geografica
Continente #
NA - Nord America 3.191
AS - Asia 2.286
EU - Europa 1.650
SA - Sud America 558
AF - Africa 194
OC - Oceania 14
Continente sconosciuto - Info sul continente non disponibili 1
Totale 7.894
Nazione #
US - Stati Uniti d'America 3.113
IT - Italia 680
CN - Cina 649
SG - Singapore 637
HK - Hong Kong 479
BR - Brasile 465
VN - Vietnam 228
SE - Svezia 215
BG - Bulgaria 153
DE - Germania 140
GB - Regno Unito 108
FR - Francia 101
CI - Costa d'Avorio 69
RU - Federazione Russa 58
FI - Finlandia 56
SN - Senegal 54
JP - Giappone 47
TR - Turchia 44
CA - Canada 40
KR - Corea 40
AR - Argentina 39
AT - Austria 35
NG - Nigeria 32
BD - Bangladesh 28
IN - India 27
MX - Messico 20
EC - Ecuador 19
TW - Taiwan 18
NL - Olanda 17
PL - Polonia 16
IQ - Iraq 15
AU - Australia 13
ID - Indonesia 12
UA - Ucraina 12
ZA - Sudafrica 12
CO - Colombia 9
ES - Italia 9
EG - Egitto 8
GR - Grecia 8
MA - Marocco 8
PH - Filippine 8
PY - Paraguay 8
CH - Svizzera 6
CL - Cile 6
IR - Iran 6
RO - Romania 6
SA - Arabia Saudita 6
UZ - Uzbekistan 6
AZ - Azerbaigian 5
BO - Bolivia 5
BE - Belgio 4
DZ - Algeria 4
EE - Estonia 4
IE - Irlanda 4
IL - Israele 4
LT - Lituania 4
PK - Pakistan 4
VE - Venezuela 4
AE - Emirati Arabi Uniti 3
DK - Danimarca 3
HN - Honduras 3
MY - Malesia 3
BB - Barbados 2
BH - Bahrain 2
CR - Costa Rica 2
CZ - Repubblica Ceca 2
GT - Guatemala 2
JM - Giamaica 2
JO - Giordania 2
KE - Kenya 2
LB - Libano 2
MD - Moldavia 2
NP - Nepal 2
PA - Panama 2
SK - Slovacchia (Repubblica Slovacca) 2
TN - Tunisia 2
UY - Uruguay 2
AL - Albania 1
AM - Armenia 1
BA - Bosnia-Erzegovina 1
BJ - Benin 1
BN - Brunei Darussalam 1
CD - Congo 1
DO - Repubblica Dominicana 1
ET - Etiopia 1
EU - Europa 1
GD - Grenada 1
HU - Ungheria 1
KG - Kirghizistan 1
KZ - Kazakistan 1
LK - Sri Lanka 1
LV - Lettonia 1
NO - Norvegia 1
NZ - Nuova Zelanda 1
OM - Oman 1
PE - Perù 1
PR - Porto Rico 1
QA - Qatar 1
SY - Repubblica araba siriana 1
TH - Thailandia 1
Totale 7.892
Città #
Hong Kong 466
Singapore 415
Ashburn 381
Santa Clara 372
Fairfield 271
Dallas 247
Woodbridge 188
Beijing 173
Milan 167
Shanghai 153
Houston 152
Sofia 152
Chandler 124
Seattle 102
New York 100
Wilmington 100
Pisa 91
Cambridge 90
Boardman 88
Hefei 74
Abidjan 69
Los Angeles 69
Princeton 67
Florence 65
Ho Chi Minh City 58
Serra 56
Dakar 54
Lawrence 53
Rome 52
Munich 48
Ann Arbor 41
São Paulo 39
Marseille 38
Seoul 37
Hanoi 34
Istanbul 33
Lagos 32
Buffalo 29
Redondo Beach 29
London 27
Tokyo 27
Turku 25
Vienna 22
Des Moines 21
Dong Ket 21
Düsseldorf 21
Frankfurt am Main 21
Torino 20
Medford 19
Nuremberg 18
Boulder 16
Helsinki 16
Ottawa 16
San Diego 16
Nanjing 15
Hyde 14
Ogden 13
Redwood City 13
Warsaw 13
Dearborn 12
Rio de Janeiro 12
Livorno 11
Belo Horizonte 10
Belém 10
Brasília 10
Guayaquil 10
Marigliano 10
Brooklyn 9
Da Nang 9
Fuzhou 9
Guangzhou 9
Lappeenranta 9
Amsterdam 8
Atlanta 8
Bremen 8
Curitiba 8
Pingzhen District 8
Stockholm 8
Changsha 7
Hebei 7
Lauterbourg 7
Poplar 7
Porto Alegre 7
Quanzhou 7
Quito 7
Rho 7
San Giuliano Terme 7
Shenyang 7
Sydney 7
Anápolis 6
Birmingham 6
Genoa 6
Vancouver 6
Wuhan 6
Zhengzhou 6
Baghdad 5
Baku 5
Biên Hòa 5
Bắc Giang 5
Chicago 5
Totale 5.499
Nome #
Finding all maximal cliques in very large social networks 178
Online Algorithms on Antipowers and Antiperiods 178
Large-scale clique cover of real-world networks 175
Enumerating Cyclic Orientations of a Graph 172
New polynomial delay bounds for maximal subgraph enumeration by proximity search 169
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 163
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 160
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 158
Node Similarity with q-Grams for Real-World Labeled Networks 151
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph 151
Enumeration of Maximal Common Subsequences Between Two Strings 148
Polynomial-Delay Enumeration of Maximal Common Subsequences 147
Listing maximal subgraphs satisfying strongly accessible properties∗ 147
Directing road networks by listing strong orientations 145
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs 138
Discovering K-Trusses in Large-Scale Networks 137
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs 132
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs 130
Clique covering of large real-world networks 130
Hide and Mine in Strings: Hardness and Algorithms 130
Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph 129
Combinatorial Algorithms for String Sanitization 127
String sanitization: a combinatorial approach 127
Generalizing Downsampling from Regular Data to Graphs 126
A fast algorithm for large common connected induced subgraphs 121
Efficient enumeration of graph orientations with sources 117
Fast enumeration of large k-Plexes 117
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 116
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails 116
Efficient enumeration of subgraphs and induced subgraphs with bounded girth 115
On Breaking Truss-based and Core-based Communities 111
A fast discovery algorithm for large common connected induced subgraphs 111
Shared-nothing distributed enumeration of 2-plexes 110
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 109
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 108
Zuckerli: A New Compressed Representation for Graphs 105
Listing maximal independent sets with minimal space and bounded delay 104
Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks 104
Hide and Mine in Strings: Hardness, Algorithms, and Experiments 102
Jaccard Median for Ego-network Segmentation 100
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 99
Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs 99
K-plex cover pooling for graph neural networks 98
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms 95
Computing matching statistics on Wheeler DFAs 94
Efficiently Clustering Very Large Attributed Graphs 93
K-plex Cover Pooling for Graph Neural Networks 92
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 91
Maximal strongly connected cliques in directed graphs: Algorithms and bounds 90
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 88
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs 88
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 84
Listing Subgraphs by Cartesian Decomposition 84
Truly scalable K-Truss and max-truss algorithms for community detection in graphs 81
phyBWT2: phylogeny reconstruction via eBWT positional clustering 80
A Compact DAG for Storing and Searching Maximal Common Subsequences 79
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs 77
On maximal cliques with connectivity constraints in directed graphs 77
Ego-Network Segmentation via (Weighted) Jaccard Median 76
On Breaking Truss-Based Communities 76
Utility-Oriented String Mining 76
On Strings Having the Same Length- k Substrings 75
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms 73
Listing subgraphs by cartesian decomposition 73
null 70
Finding the Anticover of a String 70
CAGE: Cache-Aware Graphlet Enumeration 69
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering 68
A meta-algorithm for finding large k-plexes 67
Are k-cores meaningful for temporal graph analysis? 66
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs 62
Listing acyclic orientations of graphs with single and multiple sources 61
null 59
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space 54
McDag: Indexing Maximal Common Subsequences in Practice 49
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration 36
Subsequence-Based Indices for Genome Sequence Analysis 28
Preface 18
From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday 2025 14
Totale 8.143
Categoria #
all - tutte 24.967
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 24.967


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021408 0 0 0 0 0 57 48 39 100 33 65 66
2021/2022614 23 34 33 37 142 97 11 30 29 25 31 122
2022/2023697 77 67 61 22 72 69 3 34 228 1 52 11
2023/2024804 58 77 128 60 138 131 50 11 13 17 42 79
2024/20252.578 26 75 155 81 241 252 245 163 180 326 307 527
2025/20261.863 173 423 390 481 306 90 0 0 0 0 0 0
Totale 8.143