CONTE, ALESSIO
 Distribuzione geografica
Continente #
NA - Nord America 3.203
AS - Asia 2.416
EU - Europa 1.661
SA - Sud America 561
AF - Africa 195
OC - Oceania 14
Continente sconosciuto - Info sul continente non disponibili 1
Totale 8.051
Nazione #
US - Stati Uniti d'America 3.125
SG - Singapore 750
IT - Italia 685
CN - Cina 653
HK - Hong Kong 479
BR - Brasile 467
VN - Vietnam 233
SE - Svezia 215
BG - Bulgaria 153
DE - Germania 141
GB - Regno Unito 108
FR - Francia 105
CI - Costa d'Avorio 69
RU - Federazione Russa 58
FI - Finlandia 56
SN - Senegal 54
JP - Giappone 51
TR - Turchia 44
CA - Canada 40
KR - Corea 40
AR - Argentina 39
AT - Austria 35
NG - Nigeria 32
BD - Bangladesh 28
IN - India 28
EC - Ecuador 20
MX - Messico 20
TW - Taiwan 19
NL - Olanda 17
PL - Polonia 17
IQ - Iraq 15
AU - Australia 13
ZA - Sudafrica 13
ID - Indonesia 12
UA - Ucraina 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
PK - Pakistan 5
BE - Belgio 4
DZ - Algeria 4
EE - Estonia 4
IE - Irlanda 4
IL - Israele 4
LT - Lituania 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
KG - Kirghizistan 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
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 8.049
Città #
Hong Kong 466
Singapore 429
Ashburn 383
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
Los Angeles 70
Abidjan 69
Princeton 67
Florence 65
Ho Chi Minh City 60
Serra 56
Dakar 54
Lawrence 53
Rome 52
Munich 48
Ann Arbor 41
São Paulo 39
Marseille 38
Seoul 37
Hanoi 35
Istanbul 33
Lagos 32
Tokyo 31
Buffalo 29
Redondo Beach 29
London 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
Warsaw 14
Ogden 13
Redwood City 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
San Jose 9
Amsterdam 8
Atlanta 8
Bremen 8
Curitiba 8
Paris 8
Pingzhen District 8
Quito 8
Stockholm 8
Changsha 7
Hebei 7
Lauterbourg 7
Poplar 7
Porto Alegre 7
Quanzhou 7
Rho 7
San Giuliano Terme 7
Shenyang 7
Sydney 7
Anápolis 6
Birmingham 6
Genoa 6
Haiphong 6
Taipei 6
The Dalles 6
Vancouver 6
Wuhan 6
Zhengzhou 6
Totale 5.535
Nome #
Online Algorithms on Antipowers and Antiperiods 181
Finding all maximal cliques in very large social networks 180
Large-scale clique cover of real-world networks 176
Enumerating Cyclic Orientations of a Graph 174
New polynomial delay bounds for maximal subgraph enumeration by proximity search 171
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 166
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 164
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 160
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph 156
Node Similarity with q-Grams for Real-World Labeled Networks 153
Polynomial-Delay Enumeration of Maximal Common Subsequences 151
Listing maximal subgraphs satisfying strongly accessible properties∗ 149
Enumeration of Maximal Common Subsequences Between Two Strings 149
Directing road networks by listing strong orientations 146
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs 140
Discovering K-Trusses in Large-Scale Networks 139
Hide and Mine in Strings: Hardness and Algorithms 135
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs 134
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs 132
Clique covering of large real-world networks 131
Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph 131
Combinatorial Algorithms for String Sanitization 129
Generalizing Downsampling from Regular Data to Graphs 127
String sanitization: a combinatorial approach 127
A fast algorithm for large common connected induced subgraphs 122
Efficient enumeration of graph orientations with sources 119
Fast enumeration of large k-Plexes 119
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails 119
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 118
Efficient enumeration of subgraphs and induced subgraphs with bounded girth 117
On Breaking Truss-based and Core-based Communities 113
Shared-nothing distributed enumeration of 2-plexes 113
A fast discovery algorithm for large common connected induced subgraphs 112
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 110
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 109
Zuckerli: A New Compressed Representation for Graphs 107
Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks 106
Listing maximal independent sets with minimal space and bounded delay 105
Hide and Mine in Strings: Hardness, Algorithms, and Experiments 104
Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs 103
Jaccard Median for Ego-network Segmentation 101
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 101
K-plex cover pooling for graph neural networks 99
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms 98
Computing matching statistics on Wheeler DFAs 95
Efficiently Clustering Very Large Attributed Graphs 95
K-plex Cover Pooling for Graph Neural Networks 95
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 92
Maximal strongly connected cliques in directed graphs: Algorithms and bounds 92
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 89
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs 89
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 85
Listing Subgraphs by Cartesian Decomposition 85
Truly scalable K-Truss and max-truss algorithms for community detection in graphs 82
phyBWT2: phylogeny reconstruction via eBWT positional clustering 81
A Compact DAG for Storing and Searching Maximal Common Subsequences 80
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs 79
On maximal cliques with connectivity constraints in directed graphs 79
On Strings Having the Same Length- k Substrings 78
Ego-Network Segmentation via (Weighted) Jaccard Median 78
On Breaking Truss-Based Communities 78
Utility-Oriented String Mining 77
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms 76
Listing subgraphs by cartesian decomposition 74
Finding the Anticover of a String 73
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering 70
CAGE: Cache-Aware Graphlet Enumeration 70
null 70
Are k-cores meaningful for temporal graph analysis? 69
A meta-algorithm for finding large k-plexes 69
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs 66
Listing acyclic orientations of graphs with single and multiple sources 63
null 59
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space 55
McDag: Indexing Maximal Common Subsequences in Practice 52
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration 36
Subsequence-Based Indices for Genome Sequence Analysis 31
Preface 21
From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday 2025 21
Totale 8.300
Categoria #
all - tutte 25.396
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 25.396


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021351 0 0 0 0 0 0 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/20262.020 173 423 390 481 306 241 6 0 0 0 0 0
Totale 8.300