CINECA IRIS Institutional Research Information System

CONTE, ALESSIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.880
AS - Asia 2.940
EU - Europa 1.954
SA - Sud America 618
AF - Africa 234
OC - Oceania 17
Continente sconosciuto - Info sul continente non disponibili 1
Totale 9.644
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.777
SG - Singapore 897
IT - Italia 869
CN - Cina 775
BR - Brasile 500
HK - Hong Kong 495
VN - Vietnam 327
SE - Svezia 215
FR - Francia 167
BG - Bulgaria 153
DE - Germania 152
GB - Regno Unito 118
JP - Giappone 88
CI - Costa d'Avorio 70
RU - Federazione Russa 60
FI - Finlandia 58
CA - Canada 55
SN - Senegal 55
TR - Turchia 49
IN - India 46
AR - Argentina 45
BD - Bangladesh 42
KR - Corea 42
AT - Austria 35
NG - Nigeria 33
IQ - Iraq 29
NL - Olanda 25
MX - Messico 24
ZA - Sudafrica 24
EC - Ecuador 22
TW - Taiwan 19
ID - Indonesia 18
PL - Polonia 18
CO - Colombia 16
AU - Australia 15
PH - Filippine 15
UA - Ucraina 15
SA - Arabia Saudita 13
ES - Italia 12
MA - Marocco 12
PK - Pakistan 12
EG - Egitto 11
GR - Grecia 10
UZ - Uzbekistan 10
CL - Cile 9
PY - Paraguay 9
TN - Tunisia 9
AZ - Azerbaigian 7
DZ - Algeria 7
VE - Venezuela 7
BO - Bolivia 6
CH - Svizzera 6
IR - Iran 6
MY - Malesia 6
RO - Romania 6
BE - Belgio 5
IE - Irlanda 5
KE - Kenya 5
AE - Emirati Arabi Uniti 4
EE - Estonia 4
ET - Etiopia 4
HN - Honduras 4
IL - Israele 4
JO - Giordania 4
LB - Libano 4
LT - Lituania 4
NP - Nepal 4
PA - Panama 4
BH - Bahrain 3
CR - Costa Rica 3
DK - Danimarca 3
JM - Giamaica 3
KZ - Kazakistan 3
LK - Sri Lanka 3
OM - Oman 3
PS - Palestinian Territory 3
BB - Barbados 2
CZ - Repubblica Ceca 2
DO - Repubblica Dominicana 2
GT - Guatemala 2
HU - Ungheria 2
KG - Kirghizistan 2
MD - Moldavia 2
PE - Perù 2
PT - Portogallo 2
SK - Slovacchia (Repubblica Slovacca) 2
TH - Thailandia 2
UY - Uruguay 2
AL - Albania 1
AM - Armenia 1
AO - Angola 1
BA - Bosnia-Erzegovina 1
BJ - Benin 1
BN - Brunei Darussalam 1
CD - Congo 1
EU - Europa 1
GD - Grenada 1
GE - Georgia 1
LV - Lettonia 1
ML - Mali 1
Totale 9.636
Salva come PNG Salva come JPEG
Città #
Singapore 517
Hong Kong 479
Ashburn 422
Santa Clara 383
San Jose 274
Fairfield 271
Dallas 254
Milan 211
Woodbridge 191
Beijing 177
Houston 154
Shanghai 153
Sofia 152
Chandler 124
New York 108
Seattle 103
Wilmington 100
Pisa 98
Ho Chi Minh City 93
Cambridge 90
Boardman 88
Los Angeles 78
Hefei 74
Abidjan 70
Rome 69
Florence 67
Princeton 67
Tokyo 65
Hanoi 58
Serra 56
Dakar 55
Lauterbourg 54
Lawrence 53
Munich 48
Ann Arbor 41
São Paulo 41
Marseille 38
Seoul 38
Istanbul 33
Lagos 32
Buffalo 29
Redondo Beach 29
London 28
Frankfurt am Main 25
Turku 25
Des Moines 23
Las Vegas 23
Vienna 22
Dong Ket 21
Düsseldorf 21
Torino 20
Medford 19
Memphis 19
Helsinki 18
Nuremberg 18
Council Bluffs 17
Ottawa 17
San Diego 17
Boulder 16
The Dalles 16
Nanjing 15
Da Nang 14
Hyde 14
Livorno 14
Warsaw 14
Atlanta 13
Ogden 13
Redwood City 13
Rio de Janeiro 13
Belo Horizonte 12
Dearborn 12
Amsterdam 11
Chicago 11
Guayaquil 11
Turin 11
Belém 10
Brasília 10
Hải Dương 10
Marigliano 10
Orem 10
Paris 10
San Giuliano Terme 10
Baghdad 9
Brooklyn 9
Curitiba 9
Fuzhou 9
Guangzhou 9
Haiphong 9
Lappeenranta 9
Quito 9
Bremen 8
Changsha 8
Genoa 8
Jeddah 8
Pingzhen District 8
Stockholm 8
Tashkent 8
Baltimore 7
Birmingham 7
Cape Town 7
Totale 6.312
Salva come PNG Salva come JPEG
Nome #
Finding all maximal cliques in very large social networks 200
Online Algorithms on Antipowers and Antiperiods 200
Large-scale clique cover of real-world networks 200
New polynomial delay bounds for maximal subgraph enumeration by proximity search 198
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 194
Hide and Mine in Strings: Hardness and Algorithms 184
Enumerating Cyclic Orientations of a Graph 180
Enumeration of Maximal Common Subsequences Between Two Strings 180
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 178
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs 176
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 175
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph 170
Polynomial-Delay Enumeration of Maximal Common Subsequences 168
Listing maximal subgraphs satisfying strongly accessible properties∗ 167
Node Similarity with q-Grams for Real-World Labeled Networks 165
On Breaking Truss-based and Core-based Communities 161
Directing road networks by listing strong orientations 157
Generalizing Downsampling from Regular Data to Graphs 151
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs 151
Discovering K-Trusses in Large-Scale Networks 150
Combinatorial Algorithms for String Sanitization 147
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs 146
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails 143
Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph 142
String sanitization: a combinatorial approach 142
Jaccard Median for Ego-network Segmentation 139
Clique covering of large real-world networks 139
A fast algorithm for large common connected induced subgraphs 137
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 137
Efficient enumeration of subgraphs and induced subgraphs with bounded girth 132
Efficient enumeration of graph orientations with sources 131
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 128
Hide and Mine in Strings: Hardness, Algorithms, and Experiments 127
Fast enumeration of large k-Plexes 126
Computing matching statistics on Wheeler DFAs 125
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 124
Shared-nothing distributed enumeration of 2-plexes 124
Zuckerli: A New Compressed Representation for Graphs 123
Listing maximal independent sets with minimal space and bounded delay 122
Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks 122
A fast discovery algorithm for large common connected induced subgraphs 121
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms 118
K-plex cover pooling for graph neural networks 117
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 113
Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs 111
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 109
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 109
A Compact DAG for Storing and Searching Maximal Common Subsequences 108
Utility-Oriented String Mining 108
K-plex Cover Pooling for Graph Neural Networks 107
Maximal strongly connected cliques in directed graphs: Algorithms and bounds 104
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs 103
phyBWT2: phylogeny reconstruction via eBWT positional clustering 103
Efficiently Clustering Very Large Attributed Graphs 103
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 102
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms 102
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering 101
Listing Subgraphs by Cartesian Decomposition 100
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs 100
Truly scalable K-Truss and max-truss algorithms for community detection in graphs 100
Ego-Network Segmentation via (Weighted) Jaccard Median 99
CAGE: Cache-Aware Graphlet Enumeration 99
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs 97
Subsequence-Based Indices for Genome Sequence Analysis 97
On Strings Having the Same Length- k Substrings 94
On maximal cliques with connectivity constraints in directed graphs 92
On Breaking Truss-Based Communities 90
McDag: Indexing Maximal Common Subsequences in Practice 89
Are k-cores meaningful for temporal graph analysis? 88
Finding the Anticover of a String 86
Listing subgraphs by cartesian decomposition 85
A meta-algorithm for finding large k-plexes 83
Listing acyclic orientations of graphs with single and multiple sources 76
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space 73
null 70
null 59
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration 51
From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday 2025 49
Preface 43
$$\textsc {McDag}$$: indexing maximal common subsequences for k strings 41
Fast Assessment of Eulerian Trails in Graphs with Applications 19
The Complexity of Maximal Common Subsequence Enumeration 19
Totale 9.899
Salva come PNG Salva come JPEG
Categoria #
all - tutte 29.179
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 29.179
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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/20263.602 173 423 390 481 306 241 385 177 250 401 158 217
2026/202717 17 0 0 0 0 0 0 0 0 0 0 0
Totale 9.899