IRIS - Institutional Research Information System

Italiano, Giuseppe Francesco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 15.538
EU - Europa 8.397
AS - Asia 3.473
SA - Sud America 743
Continente sconosciuto - Info sul continente non disponibili 494
AF - Africa 239
OC - Oceania 20
Totale 28.904
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 15.310
RU - Federazione Russa 2.397
IT - Italia 1.902
SG - Singapore 1.669
GB - Regno Unito 1.303
CN - Cina 726
UA - Ucraina 574
BR - Brasile 569
SE - Svezia 546
FR - Francia 544
NL - Olanda 270
VN - Vietnam 254
DE - Germania 251
IN - India 153
HK - Hong Kong 137
PL - Polonia 129
CA - Canada 124
MA - Marocco 112
IE - Irlanda 105
BD - Bangladesh 86
FI - Finlandia 82
BE - Belgio 69
AR - Argentina 64
ID - Indonesia 54
IR - Iran 51
MX - Messico 44
TR - Turchia 40
ZA - Sudafrica 34
DK - Danimarca 33
ES - Italia 32
MY - Malesia 32
CO - Colombia 29
IQ - Iraq 29
JP - Giappone 29
PH - Filippine 28
PK - Pakistan 28
TH - Thailandia 22
VE - Venezuela 22
CZ - Repubblica Ceca 21
AT - Austria 19
CH - Svizzera 18
LT - Lituania 18
JM - Giamaica 16
EC - Ecuador 15
GR - Grecia 15
SA - Arabia Saudita 15
CR - Costa Rica 13
TN - Tunisia 13
UZ - Uzbekistan 13
CL - Cile 12
EU - Europa 12
AE - Emirati Arabi Uniti 10
DZ - Algeria 10
AZ - Azerbaigian 9
BO - Bolivia 9
EG - Egitto 9
KE - Kenya 9
KR - Corea 9
PE - Perù 9
PY - Paraguay 9
RO - Romania 9
RS - Serbia 9
AU - Australia 8
NG - Nigeria 8
OM - Oman 8
SC - Seychelles 8
BG - Bulgaria 7
IL - Israele 7
IS - Islanda 7
NP - Nepal 7
AL - Albania 6
HU - Ungheria 6
JO - Giordania 6
KZ - Kazakistan 6
LA - Repubblica Popolare Democratica del Laos 6
PA - Panama 6
ET - Etiopia 5
GE - Georgia 5
MN - Mongolia 5
NZ - Nuova Zelanda 5
PR - Porto Rico 5
CI - Costa d'Avorio 4
GT - Guatemala 4
KG - Kirghizistan 4
MD - Moldavia 4
NI - Nicaragua 4
PT - Portogallo 4
AO - Angola 3
BA - Bosnia-Erzegovina 3
BH - Bahrain 3
KW - Kuwait 3
LY - Libia 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
Totale 28.365
Salva come PNG Salva come JPEG
Città #
Dallas 3.733
Ashburn 1.788
Council Bluffs 1.240
Singapore 1.063
Southend 1.032
San Jose 924
Fairfield 907
Chandler 822
Woodbridge 482
Seattle 412
Wilmington 374
Houston 370
Rome 316
Cambridge 299
Beijing 258
Ann Arbor 222
Milan 219
Jacksonville 193
Moscow 186
Los Angeles 137
Hong Kong 129
New York 127
Lauterbourg 123
The Dalles 119
Warsaw 118
Chicago 106
Princeton 106
Dublin 101
Casablanca 98
Dong Ket 94
London 83
Phoenix 83
Guido 82
Santa Clara 70
Brussels 67
São Paulo 67
San Diego 66
Palermo 61
Buffalo 60
Ho Chi Minh City 50
Naples 50
Columbus 49
Helsinki 48
Orem 44
Frankfurt am Main 43
Bologna 41
San Francisco 40
Atlanta 39
Hanoi 37
Dearborn 32
Florence 32
Toronto 32
Jakarta 31
Brooklyn 30
Denver 29
Turin 27
Montreal 26
Poplar 26
Salt Lake City 26
Boardman 25
Munich 25
Pescara 24
Amsterdam 23
Tokyo 23
Chennai 21
Copenhagen 21
Mumbai 21
Philadelphia 21
Redwood City 21
Stockholm 21
Belo Horizonte 20
Zanjan 20
North Bergen 19
Norwalk 19
Mexico City 18
Shanghai 18
Bangkok 17
Catania 17
Leawood 16
Rio de Janeiro 16
Turku 16
West Jordan 16
Genoa 15
Johannesburg 15
Lappeenranta 15
Vancouver 15
Bari 14
Elk Grove Village 14
New Bedfont 14
Nuremberg 14
Brasília 13
Kuala Lumpur 13
Miami 13
Baghdad 12
Easley 12
Istanbul 12
Kuala Selangor 12
Manila 12
Redmond 12
Springfield 12
Totale 18.166
Salva come PNG Salva come JPEG
Nome #
2-vertex connectivity in directed graphs 2.071
2-Edge Connectivity in Directed Graphs 2.047
Algoritmi e strutture dati: terza edizione 944
Algoritmi e strutture dati (seconda edizione) 652
2D Color Barcodes for Mobile Phones 566
A Traffic-based Evolutionary Algorithm for Network Clustering 324
On-line computation of minimal and maximal length paths 314
GSM and GPRS performance of IPSEC data communication 312
Dynamically switching vertices in planar graphs 303
Strong Articulation Points and Strong Bridges in Large Scale Graphs 302
Finding strong bridges and strong articulation points in linear time 287
Computing critical nodes in directed graphs 286
Progetto di algoritmi e strutture dati in Java 271
Efficient splitting and merging algorithms for order decomposable problems 266
Deterministic fully dynamic data structures for vertex cover and matching 259
Dynamic dominators and low-high orders in DAGs 254
Algorithm Engineering 249
Dominating sets and connected dominating sets in dynamic graphs 247
Amortized efficiency of a path retrieval data structure 242
Dynamic algorithms via the primal-dual method 233
On Bubble Generators in Directed Graphs 232
A New System for Secure Handwritten Signing of Documents 231
On Resilient Graph Spanners 229
Faster algorithms for all-pairs bounded min-cuts 229
Fully dynamic algorithms for 2-edge connectivity 228
Computing vertex-edge cut-pairs and 2-edge cuts in practice 228
On-line algorithms for polynomially solvable satisfiability problems 223
Algorithm Engineering 220
Compressed weighted de Bruijn graphs 219
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms 216
A family of tree-based generators for bubbles in directed graphs 214
A new approach to dynamic all pairs shortest paths 212
A Machine Learning-based approach to Digital Triage 211
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph 211
Tropical paths in vertex-colored graphs 211
Strong connectivity in directed graphs under failures, with applications 204
Sparse certificates for 2-connectivity in directed graphs 203
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights 202
Separator based sparsification I: planarity testing and minimum spanning trees 201
A note on set union with arbitrary deunions 199
Near real-time suffix tree construction via the fringe marked ancestor problem 198
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier 198
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming 197
Invited Paper: Security and Privacy in Large Language and Foundation Models: A Survey on GenAI Attacks 193
Separator based sparsification II: edge and vertex connectivity 193
Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2) Barrier 192
Reliability and data density in high capacity color barcodes 190
Black Hole Search in Dynamic Tori 189
Sparsification: A technique for speeding up dynamic graph algorithms 189
Maintaining the 3-edge-connected components of a graph on-line 188
Resilient Dictionaries 187
Incremental algorithms for minimal length paths 186
Getting back to the past in the union-find problem 184
CHECKCOL: Improved local search for graph coloring 184
Planar Reachability Under Single Vertex or Edge Failures 181
Experimental Study of Resilient Algorithms and Data Structures 180
Optimal Resilient Dynamic Dictionaries 180
Novel Local-Search-Based Approaches to University Examination Timetabling 179
Portraying algorithms with Leonardo Web 179
Data structures and algorithms for disjoint set union problems 179
Symmetric continuous subgraph matching with bidirectional dynamic programming 178
On a Facility Location Problem with Applications to Tele-Diagnostic 176
Sparse dynamic programming I: linear cost functions 175
Dynamic algorithms for the massively parallel computation model 175
Sorting and searching in faulty memories 174
The Price of Resiliency: A Case Study on Sorting with Memory Faults 173
Decremental 2- and 3-connectivity on planar graphs 173
An empirical study of dynamic graph algorithms 171
Designing Reliable Algorithms in Unreliable Memories 171
Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings 167
Maintenance of a minimum spanning forest in a dynamic plane graph 167
The set union problem with unlimited backtracking 165
Worst-case analysis of the set union problem with extended backtracking 164
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries 164
Finding paths and deleting edges in directed acyclic graphs 163
On Suffix Extensions in Suffix Trees 163
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study 163
The set union problem with dynamic weighted backtracking 161
Computing the 4-edge-connected components of a graph in linear time 161
An algorithm for finding a k-median in a directed tree 161
Predicting deadlock in store-and-forward networks 160
Dynamic Trees 158
A Forensic-as-a-servicedelivery platform for law enforcement agencies 158
Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem 158
Maintaining Dynamic Matrices for Fully Dynamic Transitive Closure 158
The value of location in keyword auctions 157
Dynamic Graphs 157
Sparse dynamic programming II : convex and concave cost functions 156
Engineering Color Barcode Algorithms for Mobile Applications 155
Maintaining spanning trees of small diameter 153
Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures 153
Reducing edge connectivity to vertex connectivity 153
Dynamic maintenance of directed hypergraphs 151
Sorting and searching in the presence of memory faults (without redundancy) 151
CATAI: Cooperative Algorithm and Data Types Animation over the Internet 150
Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking 149
Engineering and visualizing algorithms 149
Optimal Resilient Sorting and Searching in the presence of Dynamic Memory Faults 148
Faster Dynamic 2-Edge Connectivity in Directed Graphs 146
Better transit routing by exploiting vehicle GPS data 142
Totale 24.925
Salva come PNG Salva come JPEG
Categoria #
all - tutte 122.091
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 122.091
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20221.028 0 0 0 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/202613.946 415 1.057 3.448 990 877 499 1.356 1.838 1.424 689 841 512
2026/20272.069 699 446 401 523 0 0 0 0 0 0 0 0
Totale 28.904