CONTE, ALESSIO
 Distribuzione geografica
Continente #
NA - Nord America 1.792
EU - Europa 1.054
AS - Asia 397
AF - Africa 154
OC - Oceania 14
SA - Sud America 5
Continente sconosciuto - Info sul continente non disponibili 1
Totale 3.417
Nazione #
US - Stati Uniti d'America 1.765
IT - Italia 494
SE - Svezia 207
CN - Cina 162
BG - Bulgaria 152
SG - Singapore 91
CI - Costa d'Avorio 68
GB - Regno Unito 54
SN - Senegal 52
FR - Francia 50
VN - Vietnam 50
NG - Nigeria 32
HK - Hong Kong 27
CA - Canada 26
DE - Germania 26
JP - Giappone 24
FI - Finlandia 15
AT - Austria 14
AU - Australia 13
TW - Taiwan 12
GR - Grecia 8
IN - India 7
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
BR - Brasile 3
IE - Irlanda 3
BD - Bangladesh 2
CL - Cile 2
EG - Egitto 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.417
Città #
Fairfield 271
Woodbridge 187
Milan 155
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
Lawrence 53
Dakar 52
Florence 52
Ann Arbor 41
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
Hyde 14
Vienna 14
Redwood City 13
Dearborn 12
Tokyo 9
Bremen 8
Pingzhen District 8
Hebei 7
Hefei 7
Rho 7
Shenyang 7
Sydney 7
Helsinki 6
London 6
Ogden 6
Changsha 5
Guangzhou 5
Wuhan 5
Düsseldorf 4
Los Angeles 4
Norwalk 4
Shanghai 4
Bern 3
Brussels 3
Canyon Country 3
Dicomano 3
Dublin 3
Faggiano 3
Glasgow 3
Ilford 3
Jiaxing 3
Kunming 3
Lappeenranta 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
San Giuliano Terme 2
Santiago 2
Shatin 2
Toronto 2
Villeurbanne 2
Wadgassen 2
Warsaw 2
Totale 2.584
Nome #
Enumerating Cyclic Orientations of a Graph 119
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 113
Directing road networks by listing strong orientations 111
Finding all maximal cliques in very large social networks 104
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 92
Listing maximal subgraphs satisfying strongly accessible properties∗ 92
Large-scale clique cover of real-world networks 92
Online Algorithms on Antipowers and Antiperiods 90
Discovering K-Trusses in Large-Scale Networks 88
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 87
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs 84
Polynomial-Delay Enumeration of Maximal Common Subsequences 84
New polynomial delay bounds for maximal subgraph enumeration by proximity search 83
A fast algorithm for large common connected induced subgraphs 82
Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph 82
Fast enumeration of large k-Plexes 82
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search 80
Efficient enumeration of subgraphs and induced subgraphs with bounded girth 77
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs 76
A fast discovery algorithm for large common connected induced subgraphs 74
Hide and Mine in Strings: Hardness and Algorithms 74
String sanitization: a combinatorial approach 73
null 70
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques 68
Combinatorial Algorithms for String Sanitization 67
Listing maximal independent sets with minimal space and bounded delay 66
Efficient enumeration of graph orientations with sources 66
null 59
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts 59
Shared-nothing distributed enumeration of 2-plexes 57
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs 55
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick 54
Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks 46
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails 46
Enumeration of Maximal Common Subsequences Between Two Strings 44
Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs 43
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes 42
K-plex Cover Pooling for Graph Neural Networks 42
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs 40
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms 40
Efficiently Clustering Very Large Attributed Graphs 36
Truly scalable K-Truss and max-truss algorithms for community detection in graphs 36
Listing Subgraphs by Cartesian Decomposition 34
Zuckerli: A New Compressed Representation for Graphs 34
K-plex cover pooling for graph neural networks 34
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs 31
Maximal strongly connected cliques in directed graphs: Algorithms and bounds 31
A meta-algorithm for finding large k-plexes 28
null 27
Listing subgraphs by cartesian decomposition 24
On maximal cliques with connectivity constraints in directed graphs 22
On Breaking Truss-Based Communities 19
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms 19
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering 17
Finding the Anticover of a String 17
On Strings Having the Same Length- k Substrings 15
PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION 12
Listing acyclic orientations of graphs with single and multiple sources 10
Computing matching statistics on Wheeler DFAs 9
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs 6
phyBWT2: phylogeny reconstruction via eBWT positional clustering 6
Generalizing Downsampling from Regular Data to Graphs 5
CAGE: Cache-Aware Graphlet Enumeration 5
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration 4
Jaccard Median for Ego-network Segmentation 3
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs 2
Hide and Mine in Strings: Hardness, Algorithms, and Experiments 2
Totale 3.583
Categoria #
all - tutte 11.242
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 11.242


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019150 0 0 0 0 0 0 0 0 0 34 59 57
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/2024685 58 77 128 60 138 131 50 11 13 19 0 0
Totale 3.583