IRIS - Institutional Research Information System

Italiano, Giuseppe Francesco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 11.234
EU - Europa 4.831
AS - Asia 2.473
SA - Sud America 543
AF - Africa 173
OC - Oceania 17
Continente sconosciuto - Info sul continente non disponibili 13
Totale 19.284
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 11.124
SG - Singapore 1.394
GB - Regno Unito 1.269
IT - Italia 961
UA - Ucraina 567
SE - Svezia 543
CN - Cina 526
BR - Brasile 466
FR - Francia 386
NL - Olanda 231
DE - Germania 215
VN - Vietnam 165
RU - Federazione Russa 152
PL - Polonia 122
MA - Marocco 108
IE - Irlanda 98
IN - India 81
HK - Hong Kong 78
CA - Canada 69
BE - Belgio 68
FI - Finlandia 57
IR - Iran 51
AR - Argentina 31
MX - Messico 29
DK - Danimarca 23
ES - Italia 23
BD - Bangladesh 20
CZ - Repubblica Ceca 20
ZA - Sudafrica 20
TR - Turchia 19
AT - Austria 18
ID - Indonesia 17
JP - Giappone 17
LT - Lituania 16
IQ - Iraq 13
EU - Europa 12
VE - Venezuela 11
PK - Pakistan 10
CH - Svizzera 9
PH - Filippine 9
AZ - Azerbaigian 8
CL - Cile 8
SC - Seychelles 8
EC - Ecuador 7
GR - Grecia 7
IS - Islanda 7
BG - Bulgaria 6
CO - Colombia 6
EG - Egitto 6
PY - Paraguay 6
AE - Emirati Arabi Uniti 5
AL - Albania 5
AU - Australia 5
KE - Kenya 5
LA - Repubblica Popolare Democratica del Laos 5
NZ - Nuova Zelanda 5
OM - Oman 5
PA - Panama 5
RO - Romania 5
RS - Serbia 5
UZ - Uzbekistan 5
IL - Israele 4
KR - Corea 4
KZ - Kazakistan 4
TH - Thailandia 4
TN - Tunisia 4
BO - Bolivia 3
CI - Costa d'Avorio 3
DZ - Algeria 3
HU - Ungheria 3
KG - Kirghizistan 3
MN - Mongolia 3
MY - Malesia 3
PT - Portogallo 3
GE - Georgia 2
HR - Croazia 2
JM - Giamaica 2
JO - Giordania 2
LU - Lussemburgo 2
LV - Lettonia 2
MD - Moldavia 2
NG - Nigeria 2
PE - Perù 2
PW - Palau 2
QA - Qatar 2
SA - Arabia Saudita 2
SK - Slovacchia (Repubblica Slovacca) 2
SN - Senegal 2
TJ - Tagikistan 2
TV - Tuvalu 2
TW - Taiwan 2
UY - Uruguay 2
AM - Armenia 1
AO - Angola 1
BB - Barbados 1
BF - Burkina Faso 1
BH - Bahrain 1
BN - Brunei Darussalam 1
CD - Congo 1
CG - Congo 1
Totale 19.260
Salva come PNG Salva come JPEG
Città #
Dallas 3.723
Southend 1.032
Singapore 916
Fairfield 907
Ashburn 839
Chandler 822
Woodbridge 482
Seattle 409
Wilmington 372
Houston 365
Cambridge 297
Ann Arbor 221
Beijing 220
Jacksonville 191
Rome 152
Milan 116
Warsaw 115
Los Angeles 114
Princeton 106
New York 101
Dublin 98
Casablanca 97
Dong Ket 94
Chicago 86
Guido 82
London 78
Hong Kong 72
Brussels 67
San Diego 63
Buffalo 57
The Dalles 53
São Paulo 52
Moscow 44
Columbus 42
Council Bluffs 38
Naples 38
Santa Clara 36
Palermo 33
Atlanta 31
Dearborn 31
Helsinki 31
Frankfurt am Main 30
Ho Chi Minh City 28
Munich 25
Salt Lake City 25
Toronto 25
Denver 24
Florence 23
Poplar 23
Boardman 21
Brooklyn 21
Copenhagen 21
Redwood City 21
Pescara 20
Zanjan 20
Montreal 19
North Bergen 18
Norwalk 18
Stockholm 18
Belo Horizonte 17
Leawood 16
Turku 16
West Jordan 16
Philadelphia 15
Rio de Janeiro 15
Tokyo 15
Bologna 14
Hanoi 14
New Bedfont 14
Orem 14
Phoenix 14
Shanghai 14
Amsterdam 13
Nuremberg 13
San Francisco 13
Easley 12
Elk Grove Village 12
Jakarta 12
Mexico City 12
Genoa 11
Redmond 11
Turin 11
Brasília 10
Catania 10
Chennai 10
Guangzhou 10
Johannesburg 10
Tampa 10
Andover 9
Kilburn 9
Mumbai 9
Brno 8
Des Moines 8
Edinburgh 8
Henderson 8
Islington 8
Manchester 8
Miami 8
San Mateo 8
Vienna 8
Totale 13.596
Salva come PNG Salva come JPEG
Nome #
2-Edge Connectivity in Directed Graphs 1.971
2-vertex connectivity in directed graphs 1.967
Algoritmi e strutture dati (seconda edizione) 442
Algoritmi e strutture dati: terza edizione 414
2D Color Barcodes for Mobile Phones 269
GSM and GPRS performance of IPSEC data communication 260
On-line computation of minimal and maximal length paths 260
Strong Articulation Points and Strong Bridges in Large Scale Graphs 251
Finding strong bridges and strong articulation points in linear time 245
A Traffic-based Evolutionary Algorithm for Network Clustering 244
Dynamically switching vertices in planar graphs 233
Computing critical nodes in directed graphs 222
Efficient splitting and merging algorithms for order decomposable problems 213
Progetto di algoritmi e strutture dati in Java 199
Deterministic fully dynamic data structures for vertex cover and matching 191
Dynamic dominators and low-high orders in DAGs 187
Dynamic algorithms via the primal-dual method 185
On Resilient Graph Spanners 174
Algorithm Engineering 174
Fully dynamic algorithms for 2-edge connectivity 173
Sparse certificates for 2-connectivity in directed graphs 173
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph 171
On Bubble Generators in Directed Graphs 168
Amortized efficiency of a path retrieval data structure 164
Tropical paths in vertex-colored graphs 164
Dominating sets and connected dominating sets in dynamic graphs 163
On-line algorithms for polynomially solvable satisfiability problems 161
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights 159
Near real-time suffix tree construction via the fringe marked ancestor problem 157
Faster algorithms for all-pairs bounded min-cuts 154
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms 154
Computing vertex-edge cut-pairs and 2-edge cuts in practice 153
Algorithm Engineering 151
Strong connectivity in directed graphs under failures, with applications 150
A Machine Learning-based approach to Digital Triage 147
Optimal Resilient Dynamic Dictionaries 145
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier 145
Compressed weighted de Bruijn graphs 144
A family of tree-based generators for bubbles in directed graphs 143
Reliability and data density in high capacity color barcodes 143
A note on set union with arbitrary deunions 140
Planar Reachability Under Single Vertex or Edge Failures 137
A New System for Secure Handwritten Signing of Documents 137
Experimental Study of Resilient Algorithms and Data Structures 137
Getting back to the past in the union-find problem 134
Sparsification: A technique for speeding up dynamic graph algorithms 133
A new approach to dynamic all pairs shortest paths 131
CHECKCOL: Improved local search for graph coloring 131
Separator based sparsification I: planarity testing and minimum spanning trees 130
Separator based sparsification II: edge and vertex connectivity 129
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming 127
On Suffix Extensions in Suffix Trees 127
Dynamic algorithms for the massively parallel computation model 126
Maintaining the 3-edge-connected components of a graph on-line 123
An empirical study of dynamic graph algorithms 123
An algorithm for finding a k-median in a directed tree 123
Resilient Dictionaries 121
Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2) Barrier 120
Engineering and visualizing algorithms 117
Portraying algorithms with Leonardo Web 116
Designing Reliable Algorithms in Unreliable Memories 116
Dynamic Graphs 115
Worst-case analysis of the set union problem with extended backtracking 115
The set union problem with unlimited backtracking 114
The Price of Resiliency: A Case Study on Sorting with Memory Faults 114
Data structures and algorithms for disjoint set union problems 114
Maintenance of a minimum spanning forest in a dynamic plane graph 114
Invited Paper: Security and Privacy in Large Language and Foundation Models: A Survey on GenAI Attacks 113
Novel Local-Search-Based Approaches to University Examination Timetabling 113
On a Facility Location Problem with Applications to Tele-Diagnostic 113
Engineering Color Barcode Algorithms for Mobile Applications 112
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries 111
Sorting and searching in faulty memories 110
Decremental 2- and 3-connectivity on planar graphs 110
Incremental algorithms for minimal length paths 109
The set union problem with dynamic weighted backtracking 108
Dynamic Trees 108
Sparse dynamic programming II : convex and concave cost functions 108
Finding paths and deleting edges in directed acyclic graphs 107
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study 107
Optimal Resilient Sorting and Searching in the presence of Dynamic Memory Faults 106
The value of location in keyword auctions 105
A Forensic-as-a-servicedelivery platform for law enforcement agencies 105
Sparse dynamic programming I: linear cost functions 104
Predicting deadlock in store-and-forward networks 104
CATAI: Cooperative Algorithm and Data Types Animation over the Internet 103
Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings 102
Reducing edge connectivity to vertex connectivity 102
Dynamic maintenance of directed hypergraphs 101
Maintaining spanning trees of small diameter 100
Better transit routing by exploiting vehicle GPS data 98
Sorting and searching in the presence of memory faults (without redundancy) 98
Computing the 4-edge-connected components of a graph in linear time 97
Maintaining Dynamic Matrices for Fully Dynamic Transitive Closure 96
Topic 12: Theory and Algorithms for Parallel Computation 95
Resilient Search Trees 93
Fully dynamic planarity testing with applications 90
Improved Algorithms for Max Restricted Path Consistency 90
Optimal Resilient Sorting and Searching in the presence of Memory Faults 90
Exploiting GPS Data in Public Transport Journey Planners 90
Totale 18.145
Salva come PNG Salva come JPEG
Categoria #
all - tutte 96.557
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 96.557
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20213.256 0 0 0 0 0 143 1.341 315 270 340 571 276
2021/20221.405 126 205 46 133 60 138 127 118 47 71 155 179
2022/20232.425 338 213 302 409 188 269 58 202 238 29 94 85
2023/2024930 91 24 156 39 127 132 75 87 24 54 14 107
2024/20252.712 178 100 122 96 208 172 182 247 351 305 308 443
2025/20266.839 415 1.057 3.448 990 877 52 0 0 0 0 0 0
Totale 19.728