CINECA IRIS Institutional Research Information System

CONTE, ALESSIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1.835
EU - Europa 1.069
AS - Asia 460
AF - Africa 154
OC - Oceania 14
SA - Sud America 8
Continente sconosciuto - Info sul continente non disponibili 1
Totale 3.541
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.808
IT - Italia 506
SE - Svezia 207
CN - Cina 166
BG - Bulgaria 152
SG - Singapore 147
CI - Costa d'Avorio 68
GB - Regno Unito 54
SN - Senegal 52
FR - Francia 50
VN - Vietnam 50
NG - Nigeria 32
DE - Germania 27
HK - Hong Kong 27
CA - Canada 26
JP - Giappone 25
FI - Finlandia 17
AT - Austria 14
AU - Australia 13
TW - Taiwan 12
GR - Grecia 8
IN - India 7
BR - Brasile 6
CH - Svizzera 6
IR - Iran 6
NL - Olanda 6
PH - Filippine 6
TR - Turchia 5
KR - Corea 4
RO - Romania 4
RU - Federazione Russa 4
UA - Ucraina 4
BE - Belgio 3
IE - Irlanda 3
BD - Bangladesh 2
CL - Cile 2
EG - Egitto 2
IL - Israele 2
PL - Polonia 2
AE - Emirati Arabi Uniti 1
ES - Italia 1
EU - Europa 1
MX - Messico 1
NZ - Nuova Zelanda 1
SK - Slovacchia (Repubblica Slovacca) 1
Totale 3.541
Salva come PNG Salva come JPEG
Città #
Fairfield 271
Woodbridge 187
Milan 156
Ashburn 152
Sofia 152
Houston 149
Chandler 124
Seattle 101
Wilmington 100
Cambridge 90
New York 86
Beijing 70
Abidjan 68
Princeton 67
Serra 56
Florence 53
Lawrence 53
Dakar 52
Ann Arbor 41
Singapore 39
Marseille 38
Rome 36
Lagos 32
Des Moines 21
Dong Ket 21
Hong Kong 20
Torino 20
Medford 19
Pisa 17
Boulder 16
Ottawa 16
San Diego 16
Nanjing 15
Boardman 14
Hyde 14
Vienna 14
Ogden 13
Redwood City 13
Dearborn 12
Livorno 9
Tokyo 9
Bremen 8
Pingzhen District 8
Hebei 7
Hefei 7
Rho 7
Shenyang 7
Sydney 7
Helsinki 6
London 6
Changsha 5
Guangzhou 5
Lappeenranta 5
Wuhan 5
Düsseldorf 4
Los Angeles 4
Norwalk 4
Shanghai 4
Belém 3
Bern 3
Brussels 3
Canyon Country 3
Dicomano 3
Dublin 3
Faggiano 3
Glasgow 3
Ilford 3
Jiaxing 3
Kunming 3
Linlithgow 3
Mountain View 3
Sapporo 3
Tianjin 3
Vancouver 3
Washington 3
Amsterdam 2
Cascia 2
Cerro Maggiore 2
Chengdu 2
Dietwil 2
Elmont 2
Frosinone 2
Goiânia 2
Hull 2
Indiana 2
Istanbul 2
Izmir 2
Jinan 2
Karlsruhe 2
Lacchiarella 2
Leonberg 2
Lyon 2
Mandaluyong City 2
Nanchang 2
Padova 2
Pune 2
Quezon City 2
Ramat Gan 2
San Giuliano Terme 2
Santiago 2
Totale 2.652
Salva come PNG Salva come JPEG
Nome #
Enumerating Cyclic Orientations of a Graph 120
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 114
Directing road networks by listing strong orientations 112
Finding all maximal cliques in very large social networks 110
Clique covering of large real-world networks 96
Node Similarity with q-Grams for Real-World Labeled Networks 96
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph 93
Listing maximal subgraphs satisfying strongly accessible properties∗ 93
Large-scale clique cover of real-world networks 93
Online Algorithms on Antipowers and Antiperiods 91
Discovering K-Trusses in Large-Scale Networks 89
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 88
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs 85
Polynomial-Delay Enumeration of Maximal Common Subsequences 85
New polynomial delay bounds for maximal subgraph enumeration by proximity search 84
A fast algorithm for large common connected induced subgraphs 83
Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph 83
Fast enumeration of large k-Plexes 83
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 81
Efficient enumeration of subgraphs and induced subgraphs with bounded girth 78
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs 77
Hide and Mine in Strings: Hardness and Algorithms 77
A fast discovery algorithm for large common connected induced subgraphs 75
String sanitization: a combinatorial approach 74
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 70
null 70
Combinatorial Algorithms for String Sanitization 70
Listing maximal independent sets with minimal space and bounded delay 67
Efficient enumeration of graph orientations with sources 67
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 60
null 59
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails 59
Shared-nothing distributed enumeration of 2-plexes 58
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 56
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 55
Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks 47
Enumeration of Maximal Common Subsequences Between Two Strings 47
K-plex Cover Pooling for Graph Neural Networks 46
Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs 44
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 43
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 41
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms 40
K-plex cover pooling for graph neural networks 39
Truly scalable K-Truss and max-truss algorithms for community detection in graphs 37
Efficiently Clustering Very Large Attributed Graphs 36
Listing Subgraphs by Cartesian Decomposition 35
Zuckerli: A New Compressed Representation for Graphs 35
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs 32
Maximal strongly connected cliques in directed graphs: Algorithms and bounds 32
A meta-algorithm for finding large k-plexes 29
null 27
Listing subgraphs by cartesian decomposition 25
On Strings Having the Same Length- k Substrings 23
On maximal cliques with connectivity constraints in directed graphs 23
On Breaking Truss-Based Communities 22
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms 21
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering 20
Finding the Anticover of a String 19
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 14
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs 13
Listing acyclic orientations of graphs with single and multiple sources 11
Computing matching statistics on Wheeler DFAs 10
phyBWT2: phylogeny reconstruction via eBWT positional clustering 10
Generalizing Downsampling from Regular Data to Graphs 7
Hide and Mine in Strings: Hardness, Algorithms, and Experiments 7
CAGE: Cache-Aware Graphlet Enumeration 7
A Compact DAG for Storing and Searching Maximal Common Subsequences 6
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs 5
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration 4
Jaccard Median for Ego-network Segmentation 3
Totale 3.711
Salva come PNG Salva come JPEG
Categoria #
all - tutte 12.453
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 12.453
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020700 58 69 28 44 54 59 71 79 94 56 69 19
2020/2021491 25 21 20 11 6 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/2024809 58 77 128 60 138 131 50 11 13 19 45 79
2024/20254 4 0 0 0 0 0 0 0 0 0 0 0
Totale 3.711