Italiano, Giuseppe Francesco
 Distribuzione geografica
Continente #
NA - Nord America 247
EU - Europa 194
AS - Asia 79
SA - Sud America 4
AF - Africa 2
Totale 526
Nazione #
US - Stati Uniti d'America 245
IT - Italia 120
CN - Cina 49
GB - Regno Unito 17
FR - Francia 16
VN - Vietnam 15
IE - Irlanda 9
PL - Polonia 7
DE - Germania 6
RU - Federazione Russa 6
FI - Finlandia 5
KR - Corea 4
GR - Grecia 3
IN - India 3
BO - Bolivia 2
BR - Brasile 2
CA - Canada 2
ID - Indonesia 2
KH - Cambogia 2
SE - Svezia 2
SG - Singapore 2
UA - Ucraina 2
HK - Hong Kong 1
NL - Olanda 1
SC - Seychelles 1
TW - Taiwan 1
ZA - Sudafrica 1
Totale 526
Città #
Guido 52
Rome 31
Ashburn 27
Santa Cruz 24
Naples 22
Fairfield 19
Dong Ket 15
Houston 15
Seattle 13
Southend 12
Woodbridge 12
Columbus 11
Dublin 9
Guangzhou 8
Boardman 7
Warsaw 7
Shenyang 6
Cambridge 5
Ann Arbor 4
Council Bluffs 4
Helsinki 4
Shanghai 4
Buffalo 3
Cedar Knolls 3
Changsha 3
Chengdu 3
Chicago 3
San Diego 3
Wilmington 3
Xian 3
Ambridge 2
Baotou 2
Chennai 2
Chongqing 2
Harbin 2
Jinan 2
La Paz 2
Lake Forest 2
Las Vegas 2
Moscow 2
Pohang 2
San Jose 2
Amsterdam 1
Athens 1
Beijing 1
Bengaluru 1
Crugers 1
Hangzhou 1
Kitchener 1
Linköping 1
Los Angeles 1
Miami 1
Montreal 1
Mountain View 1
Muizenberg 1
New Kensington 1
New York 1
Nuremberg 1
Pasadena 1
Rangkasbitung 1
San Maurizio Canavese 1
Scottsdale 1
Seoul 1
St Petersburg 1
Sunnyvale 1
Tampa 1
Urbania 1
Wenzhou 1
Westwood 1
Wexford 1
Totale 387
Nome #
Planar Reachability Under Single Vertex or Edge Failures, file e163de42-9b55-19c7-e053-6605fe0a8397 132
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier, file e163de42-99b2-19c7-e053-6605fe0a8397 84
Dominating sets and connected dominating sets in dynamic graphs, file e163de42-4ffb-19c7-e053-6605fe0a8397 72
A family of tree-based generators for bubbles in directed graphs, file e163de42-d951-19c7-e053-6605fe0a8397 46
Symmetric continuous subgraph matching with bidirectional dynamic programming, file e163de42-edb0-19c7-e053-6605fe0a8397 40
Faster algorithms for all-pairs bounded min-cuts, file e163de42-4ff7-19c7-e053-6605fe0a8397 29
Dynamic dominators and low-high orders in DAGs, file e163de42-55ed-19c7-e053-6605fe0a8397 28
Compressed weighted de Bruijn graphs, file e163de42-d94b-19c7-e053-6605fe0a8397 13
Computing the 4-edge-connected components of a graph in linear time, file e163de42-edae-19c7-e053-6605fe0a8397 13
Computing vertex-edge cut-pairs and 2-edge cuts in practice, file e163de42-f1e5-19c7-e053-6605fe0a8397 10
Deterministic fully dynamic data structures for vertex cover and matching, file e163de42-184f-19c7-e053-6605fe0a8397 7
Dynamic algorithms via the primal-dual method, file e163de42-18d0-19c7-e053-6605fe0a8397 6
Tropical paths in vertex-colored graphs, file e163de42-605a-19c7-e053-6605fe0a8397 5
Scalable graph isomorphism: Combining pairwise color refinement and backtracking via compressed candidate space, file 7729fd32-6b3a-4d00-8ff2-53ec876e4068 4
Computing critical nodes in directed graphs, file e163de42-1857-19c7-e053-6605fe0a8397 4
2-vertex connectivity in directed graphs, file e163de42-18d3-19c7-e053-6605fe0a8397 4
On Bubble Generators in Directed Graphs, file e163de42-5ada-19c7-e053-6605fe0a8397 4
Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions, file 7b95fbc9-be68-4886-84f2-c60c4740a72e 3
Structural Parameterization of Cluster Deletion, file a34a5710-5434-4e85-a09e-c0b43408598f 3
Inferring Tie Strength in Temporal Networks, file c5c315f7-1f02-4c28-95cd-d3f73c060535 3
Seeking critical nodes in digraphs, file d8b235c1-96bc-4c4f-a1ec-24bb21a0bf2c 3
2-Edge Connectivity in Directed Graphs, file e163de42-1669-19c7-e053-6605fe0a8397 3
Strong Articulation Points and Strong Bridges in Large Scale Graphs, file e163de42-18db-19c7-e053-6605fe0a8397 3
Strong connectivity in directed graphs under failures, with applications, file e163de42-928e-19c7-e053-6605fe0a8397 3
GSM and GPRS performance of IPSEC data communication, file e163de41-3853-19c7-e053-6605fe0a8397 2
Sparse certificates for 2-connectivity in directed graphs, file e163de42-1851-19c7-e053-6605fe0a8397 2
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph, file e163de42-6986-19c7-e053-6605fe0a8397 2
A new approach to dynamic all pairs shortest paths, file e163de42-0ecd-19c7-e053-6605fe0a8397 1
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms, file e163de42-12ac-19c7-e053-6605fe0a8397 1
On Resilient Graph Spanners, file e163de42-1a0e-19c7-e053-6605fe0a8397 1
Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2) Barrier, file e163de42-38ec-19c7-e053-6605fe0a8397 1
Totale 532
Categoria #
all - tutte 2.363
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 2.363


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/202019 0 0 0 0 0 0 2 4 3 10 0 0
2020/2021163 0 0 1 0 0 13 66 27 10 15 4 27
2021/2022115 1 6 2 0 15 9 25 4 4 10 31 8
2022/2023110 3 1 26 28 1 6 5 1 1 1 12 25
2023/2024108 27 0 13 4 10 7 9 1 5 11 21 0
Totale 532