IRIS - Institutional Research Information System

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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/202613.946 415 1.057 3.448 990 877 499 1.356 1.838 1.424 689 841 512
2026/2027463 463 0 0 0 0 0 0 0 0 0 0 0
Totale 27.298