IRIS - Institutional Research Information System

Italiano, Giuseppe Francesco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 13.016
EU - Europa 7.601
AS - Asia 3.252
SA - Sud America 726
AF - Africa 238
OC - Oceania 18
Continente sconosciuto - Info sul continente non disponibili 14
Totale 24.865
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 12.873
RU - Federazione Russa 2.395
SG - Singapore 1.612
GB - Regno Unito 1.287
IT - Italia 1.196
CN - Cina 642
UA - Ucraina 573
BR - Brasile 559
SE - Svezia 546
FR - Francia 536
VN - Vietnam 253
NL - Olanda 252
DE - Germania 247
IN - India 147
PL - Polonia 127
HK - Hong Kong 116
MA - Marocco 112
IE - Irlanda 101
FI - Finlandia 80
CA - Canada 79
BE - Belgio 69
AR - Argentina 61
BD - Bangladesh 56
ID - Indonesia 52
IR - Iran 51
MX - Messico 39
TR - Turchia 38
ZA - Sudafrica 34
ES - Italia 30
CO - Colombia 28
IQ - Iraq 28
JP - Giappone 28
PH - Filippine 28
PK - Pakistan 28
MY - Malesia 25
DK - Danimarca 23
TH - Thailandia 21
VE - Venezuela 21
CZ - Repubblica Ceca 20
AT - Austria 19
LT - Lituania 18
SA - Arabia Saudita 15
EC - Ecuador 14
TN - Tunisia 13
UZ - Uzbekistan 13
CL - Cile 12
EU - Europa 12
GR - Grecia 11
CH - Svizzera 10
AZ - Azerbaigian 9
DZ - Algeria 9
EG - Egitto 9
KE - Kenya 9
PE - Perù 9
PY - Paraguay 9
AE - Emirati Arabi Uniti 8
BO - Bolivia 8
NG - Nigeria 8
OM - Oman 8
RO - Romania 8
SC - Seychelles 8
IS - Islanda 7
KR - Corea 7
RS - Serbia 7
AL - Albania 6
AU - Australia 6
BG - Bulgaria 6
IL - Israele 6
JO - Giordania 6
KZ - Kazakistan 6
LA - Repubblica Popolare Democratica del Laos 6
PA - Panama 6
ET - Etiopia 5
GE - Georgia 5
HU - Ungheria 5
NP - Nepal 5
NZ - Nuova Zelanda 5
CI - Costa d'Avorio 4
CR - Costa Rica 4
JM - Giamaica 4
KG - Kirghizistan 4
MD - Moldavia 4
MN - Mongolia 4
PT - Portogallo 4
AO - Angola 3
BA - Bosnia-Erzegovina 3
BH - Bahrain 3
KW - Kuwait 3
LY - Libia 3
NI - Nicaragua 3
PR - Porto Rico 3
QA - Qatar 3
SN - Senegal 3
TJ - Tagikistan 3
TW - Taiwan 3
UY - Uruguay 3
BF - Burkina Faso 2
CM - Camerun 2
CY - Cipro 2
GT - Guatemala 2
Totale 24.818
Salva come PNG Salva come JPEG
Città #
Dallas 3.726
Ashburn 1.557
Singapore 1.040
Southend 1.032
Fairfield 907
Chandler 822
San Jose 646
Woodbridge 482
Seattle 411
Wilmington 373
Houston 369
Cambridge 298
Beijing 233
Ann Arbor 222
Rome 195
Jacksonville 192
Moscow 186
Milan 141
Lauterbourg 123
Los Angeles 122
The Dalles 117
Warsaw 117
New York 114
Hong Kong 109
Princeton 106
Dublin 101
Casablanca 98
Dong Ket 94
Chicago 93
London 83
Guido 82
Brussels 67
San Diego 63
São Paulo 60
Buffalo 58
Council Bluffs 52
Ho Chi Minh City 50
Columbus 46
Helsinki 46
Santa Clara 46
Frankfurt am Main 43
Orem 42
Palermo 41
Naples 39
Atlanta 37
Hanoi 37
Dearborn 31
Jakarta 31
Florence 27
Bologna 26
Denver 26
Poplar 26
Toronto 26
Brooklyn 25
Munich 25
Salt Lake City 25
Amsterdam 23
Montreal 23
Tokyo 23
Boardman 21
Chennai 21
Copenhagen 21
Pescara 21
Redwood City 21
Stockholm 21
Belo Horizonte 20
Zanjan 20
Mumbai 19
North Bergen 19
Norwalk 18
Bangkok 17
Philadelphia 17
Leawood 16
Rio de Janeiro 16
San Francisco 16
Turin 16
Turku 16
West Jordan 16
Johannesburg 15
Lappeenranta 15
Mexico City 15
Phoenix 15
New Bedfont 14
Nuremberg 14
Shanghai 14
Brasília 13
Elk Grove Village 13
Baghdad 12
Easley 12
Kuala Selangor 12
Manila 12
Catania 11
Genoa 11
Redmond 11
Stiring-Wendel 11
Tampa 11
Tashkent 11
Des Moines 10
Guangzhou 10
Istanbul 10
Totale 15.879
Salva come PNG Salva come JPEG
Nome #
2-vertex connectivity in directed graphs 2.047
2-Edge Connectivity in Directed Graphs 2.024
Algoritmi e strutture dati: terza edizione 627
Algoritmi e strutture dati (seconda edizione) 541
2D Color Barcodes for Mobile Phones 456
On-line computation of minimal and maximal length paths 296
GSM and GPRS performance of IPSEC data communication 295
A Traffic-based Evolutionary Algorithm for Network Clustering 293
Strong Articulation Points and Strong Bridges in Large Scale Graphs 283
Dynamically switching vertices in planar graphs 276
Finding strong bridges and strong articulation points in linear time 266
Computing critical nodes in directed graphs 262
Efficient splitting and merging algorithms for order decomposable problems 246
Progetto di algoritmi e strutture dati in Java 245
Deterministic fully dynamic data structures for vertex cover and matching 238
Dynamic dominators and low-high orders in DAGs 235
Algorithm Engineering 234
Dominating sets and connected dominating sets in dynamic graphs 213
Amortized efficiency of a path retrieval data structure 211
Dynamic algorithms via the primal-dual method 211
On Resilient Graph Spanners 208
Fully dynamic algorithms for 2-edge connectivity 203
Faster algorithms for all-pairs bounded min-cuts 203
On Bubble Generators in Directed Graphs 202
On-line algorithms for polynomially solvable satisfiability problems 200
Computing vertex-edge cut-pairs and 2-edge cuts in practice 200
A New System for Secure Handwritten Signing of Documents 199
Algorithm Engineering 199
A family of tree-based generators for bubbles in directed graphs 197
Compressed weighted de Bruijn graphs 197
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph 197
Tropical paths in vertex-colored graphs 194
A Machine Learning-based approach to Digital Triage 192
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms 190
Sparse certificates for 2-connectivity in directed graphs 190
Strong connectivity in directed graphs under failures, with applications 190
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights 189
A new approach to dynamic all pairs shortest paths 186
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier 185
A note on set union with arbitrary deunions 182
Near real-time suffix tree construction via the fringe marked ancestor problem 181
Separator based sparsification I: planarity testing and minimum spanning trees 177
Separator based sparsification II: edge and vertex connectivity 173
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming 171
Reliability and data density in high capacity color barcodes 170
Planar Reachability Under Single Vertex or Edge Failures 169
Experimental Study of Resilient Algorithms and Data Structures 169
Optimal Resilient Dynamic Dictionaries 169
Maintaining the 3-edge-connected components of a graph on-line 168
Resilient Dictionaries 167
Getting back to the past in the union-find problem 166
Sparsification: A technique for speeding up dynamic graph algorithms 164
Invited Paper: Security and Privacy in Large Language and Foundation Models: A Survey on GenAI Attacks 162
CHECKCOL: Improved local search for graph coloring 162
Portraying algorithms with Leonardo Web 160
Black Hole Search in Dynamic Tori 159
Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2) Barrier 159
Dynamic algorithms for the massively parallel computation model 157
Sparse dynamic programming I: linear cost functions 154
Sorting and searching in faulty memories 153
Novel Local-Search-Based Approaches to University Examination Timetabling 152
Data structures and algorithms for disjoint set union problems 152
On a Facility Location Problem with Applications to Tele-Diagnostic 152
Decremental 2- and 3-connectivity on planar graphs 152
Incremental algorithms for minimal length paths 151
An empirical study of dynamic graph algorithms 151
The set union problem with unlimited backtracking 150
Designing Reliable Algorithms in Unreliable Memories 149
Maintenance of a minimum spanning forest in a dynamic plane graph 148
An algorithm for finding a k-median in a directed tree 148
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries 148
The Price of Resiliency: A Case Study on Sorting with Memory Faults 147
Worst-case analysis of the set union problem with extended backtracking 147
On Suffix Extensions in Suffix Trees 146
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study 145
The set union problem with dynamic weighted backtracking 144
Dynamic Graphs 143
Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings 143
Computing the 4-edge-connected components of a graph in linear time 143
Dynamic Trees 142
A Forensic-as-a-servicedelivery platform for law enforcement agencies 142
Symmetric continuous subgraph matching with bidirectional dynamic programming 141
The value of location in keyword auctions 140
Engineering and visualizing algorithms 140
Finding paths and deleting edges in directed acyclic graphs 140
Predicting deadlock in store-and-forward networks 139
Sparse dynamic programming II : convex and concave cost functions 138
Maintaining Dynamic Matrices for Fully Dynamic Transitive Closure 137
Engineering Color Barcode Algorithms for Mobile Applications 136
Optimal Resilient Sorting and Searching in the presence of Dynamic Memory Faults 135
Maintaining spanning trees of small diameter 133
Dynamic maintenance of directed hypergraphs 133
Reducing edge connectivity to vertex connectivity 133
Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem 133
CATAI: Cooperative Algorithm and Data Types Animation over the Internet 132
Sorting and searching in the presence of memory faults (without redundancy) 130
Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures 127
Alenex workshop preface 126
Better transit routing by exploiting vehicle GPS data 126
Resilient Search Trees 120
Totale 22.346
Salva come PNG Salva come JPEG
Categoria #
all - tutte 105.556
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 105.556
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20211.187 0 0 0 0 0 0 0 0 0 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/202612.441 415 1.057 3.448 990 877 499 1.356 1.838 1.424 537 0 0
Totale 25.330