CINECA IRIS Institutional Research Information System

CONTE, ALESSIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.702
AS - Asia 2.917
EU - Europa 1.808
SA - Sud America 617
AF - Africa 234
OC - Oceania 17
Continente sconosciuto - Info sul continente non disponibili 1
Totale 9.296
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.611
SG - Singapore 888
CN - Cina 767
IT - Italia 729
BR - Brasile 499
HK - Hong Kong 494
VN - Vietnam 326
SE - Svezia 215
FR - Francia 166
BG - Bulgaria 153
DE - Germania 152
GB - Regno Unito 117
JP - Giappone 88
CI - Costa d'Avorio 70
RU - Federazione Russa 60
FI - Finlandia 58
SN - Senegal 55
TR - Turchia 49
CA - Canada 46
IN - India 46
AR - Argentina 45
BD - Bangladesh 41
KR - Corea 41
AT - Austria 35
NG - Nigeria 33
IQ - Iraq 29
ZA - Sudafrica 24
EC - Ecuador 22
MX - Messico 22
NL - Olanda 22
TW - Taiwan 19
ID - Indonesia 18
PL - Polonia 17
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
RO - Romania 6
BE - Belgio 5
IE - Irlanda 5
KE - Kenya 5
MY - Malesia 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
BH - Bahrain 3
CR - Costa Rica 3
DK - Danimarca 3
JM - Giamaica 3
LK - Sri Lanka 3
OM - Oman 3
PA - Panama 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
KZ - Kazakistan 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.288
Salva come PNG Salva come JPEG
Città #
Singapore 513
Hong Kong 478
Ashburn 405
Santa Clara 375
Fairfield 271
San Jose 256
Dallas 250
Woodbridge 190
Beijing 175
Milan 167
Houston 154
Shanghai 153
Sofia 152
Chandler 124
New York 106
Seattle 102
Wilmington 100
Pisa 95
Ho Chi Minh City 92
Cambridge 90
Boardman 88
Hefei 74
Los Angeles 74
Abidjan 70
Princeton 67
Florence 66
Tokyo 65
Hanoi 58
Rome 56
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 27
Frankfurt am Main 25
Turku 25
Las Vegas 23
Des Moines 22
Vienna 22
Dong Ket 21
Düsseldorf 21
Torino 20
Medford 19
Helsinki 18
Nuremberg 18
San Diego 17
Boulder 16
Ottawa 16
The Dalles 16
Nanjing 15
Council Bluffs 14
Da Nang 14
Hyde 14
Warsaw 14
Atlanta 13
Ogden 13
Redwood City 13
Rio de Janeiro 13
Belo Horizonte 12
Dearborn 12
Livorno 12
Amsterdam 11
Guayaquil 11
Belém 10
Brasília 10
Hải Dương 10
Marigliano 10
Paris 10
San Giuliano Terme 10
Baghdad 9
Brooklyn 9
Curitiba 9
Fuzhou 9
Guangzhou 9
Haiphong 9
Lappeenranta 9
Orem 9
Quito 9
Bremen 8
Changsha 8
Jeddah 8
Pingzhen District 8
Stockholm 8
Tashkent 8
Baltimore 7
Cape Town 7
Chicago 7
Hebei 7
Johannesburg 7
Poplar 7
Porto Alegre 7
Totale 6.158
Salva come PNG Salva come JPEG
Nome #
Finding all maximal cliques in very large social networks 199
Online Algorithms on Antipowers and Antiperiods 197
Large-scale clique cover of real-world networks 197
New polynomial delay bounds for maximal subgraph enumeration by proximity search 193
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 188
Enumerating Cyclic Orientations of a Graph 180
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 178
Hide and Mine in Strings: Hardness and Algorithms 178
Enumeration of Maximal Common Subsequences Between Two Strings 172
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 170
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph 170
Polynomial-Delay Enumeration of Maximal Common Subsequences 166
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs 165
Node Similarity with q-Grams for Real-World Labeled Networks 165
Listing maximal subgraphs satisfying strongly accessible properties∗ 164
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 150
On Breaking Truss-based and Core-based Communities 149
Discovering K-Trusses in Large-Scale Networks 148
Combinatorial Algorithms for String Sanitization 147
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs 146
Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph 141
String sanitization: a combinatorial approach 141
Jaccard Median for Ego-network Segmentation 136
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails 136
Clique covering of large real-world networks 135
A fast algorithm for large common connected induced subgraphs 135
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 133
Efficient enumeration of subgraphs and induced subgraphs with bounded girth 131
Efficient enumeration of graph orientations with sources 131
Fast enumeration of large k-Plexes 125
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 125
Hide and Mine in Strings: Hardness, Algorithms, and Experiments 124
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 121
A fast discovery algorithm for large common connected induced subgraphs 121
Shared-nothing distributed enumeration of 2-plexes 120
Zuckerli: A New Compressed Representation for Graphs 120
Computing matching statistics on Wheeler DFAs 118
Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks 118
Listing maximal independent sets with minimal space and bounded delay 117
K-plex cover pooling for graph neural networks 115
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms 114
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 111
Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs 110
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 107
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 106
K-plex Cover Pooling for Graph Neural Networks 105
Maximal strongly connected cliques in directed graphs: Algorithms and bounds 104
Efficiently Clustering Very Large Attributed Graphs 103
phyBWT2: phylogeny reconstruction via eBWT positional clustering 102
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms 101
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 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
Utility-Oriented String Mining 98
Listing Subgraphs by Cartesian Decomposition 97
A Compact DAG for Storing and Searching Maximal Common Subsequences 95
Ego-Network Segmentation via (Weighted) Jaccard Median 95
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs 94
On maximal cliques with connectivity constraints in directed graphs 92
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering 90
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs 90
On Breaking Truss-Based Communities 87
Are k-cores meaningful for temporal graph analysis? 86
On Strings Having the Same Length- k Substrings 85
Finding the Anticover of a String 85
CAGE: Cache-Aware Graphlet Enumeration 81
Listing subgraphs by cartesian decomposition 81
A meta-algorithm for finding large k-plexes 81
McDag: Indexing Maximal Common Subsequences in Practice 75
Listing acyclic orientations of graphs with single and multiple sources 75
null 70
Subsequence-Based Indices for Genome Sequence Analysis 69
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space 66
null 59
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration 49
From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday 2025 36
Preface 33
$$\textsc {McDag}$$: indexing maximal common subsequences for k strings 27
The Complexity of Maximal Common Subsequence Enumeration 18
Totale 9.550
Salva come PNG Salva come JPEG
Categoria #
all - tutte 27.551
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 27.551
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021131 0 0 0 0 0 0 0 0 0 0 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/20263.270 173 423 390 481 306 241 385 177 250 401 43 0
Totale 9.550