IRIS - Institutional Research Information System

Italiano, Giuseppe Francesco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.275
EU - Europa 4.174
AS - Asia 1.104
SA - Sud America 257
AF - Africa 19
Continente sconosciuto - Info sul continente non disponibili 12
OC - Oceania 6
Totale 11.847
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.231
GB - Regno Unito 1.204
SG - Singapore 648
IT - Italia 614
UA - Ucraina 561
SE - Svezia 531
FR - Francia 351
BR - Brasile 235
DE - Germania 187
NL - Olanda 173
RU - Federazione Russa 145
CN - Cina 139
PL - Polonia 98
IE - Irlanda 97
VN - Vietnam 97
BE - Belgio 67
IN - India 54
IR - Iran 51
FI - Finlandia 40
CA - Canada 33
DK - Danimarca 22
CZ - Repubblica Ceca 19
TR - Turchia 14
EU - Europa 12
ID - Indonesia 12
HK - Hong Kong 11
AT - Austria 10
AR - Argentina 9
BD - Bangladesh 8
LT - Lituania 8
MA - Marocco 8
CH - Svizzera 7
IS - Islanda 7
PH - Filippine 7
BG - Bulgaria 6
IQ - Iraq 6
MX - Messico 6
PK - Pakistan 6
AZ - Azerbaigian 5
RO - Romania 5
VE - Venezuela 5
AL - Albania 4
KZ - Kazakistan 4
NZ - Nuova Zelanda 4
OM - Oman 4
PA - Panama 4
EC - Ecuador 3
ES - Italia 3
IL - Israele 3
KG - Kirghizistan 3
KR - Corea 3
LA - Repubblica Popolare Democratica del Laos 3
RS - Serbia 3
SC - Seychelles 3
UZ - Uzbekistan 3
AU - Australia 2
BO - Bolivia 2
DZ - Algeria 2
GE - Georgia 2
JO - Giordania 2
JP - Giappone 2
LU - Lussemburgo 2
MD - Moldavia 2
QA - Qatar 2
SK - Slovacchia (Repubblica Slovacca) 2
TH - Thailandia 2
TJ - Tagikistan 2
TW - Taiwan 2
ZA - Sudafrica 2
AE - Emirati Arabi Uniti 1
AM - Armenia 1
BH - Bahrain 1
BN - Brunei Darussalam 1
CL - Cile 1
CY - Cipro 1
EE - Estonia 1
GA - Gabon 1
GR - Grecia 1
GT - Guatemala 1
HR - Croazia 1
HU - Ungheria 1
KE - Kenya 1
KH - Cambogia 1
LV - Lettonia 1
MN - Mongolia 1
MY - Malesia 1
NG - Nigeria 1
NP - Nepal 1
PE - Perù 1
PT - Portogallo 1
PY - Paraguay 1
TN - Tunisia 1
Totale 11.847
Salva come PNG Salva come JPEG
Città #
Southend 1.032
Fairfield 907
Chandler 822
Ashburn 566
Woodbridge 482
Seattle 404
Wilmington 367
Houston 356
Singapore 346
Cambridge 297
Ann Arbor 221
Jacksonville 190
Princeton 106
Dublin 97
Warsaw 95
Dong Ket 94
Rome 85
Guido 82
Beijing 81
Milan 74
Brussels 67
London 66
San Diego 63
New York 61
The Dalles 52
Moscow 44
Council Bluffs 36
Dearborn 31
Helsinki 29
Naples 24
Frankfurt am Main 23
Los Angeles 22
Atlanta 21
Redwood City 21
Santa Clara 21
Copenhagen 20
Zanjan 20
Boardman 19
Norwalk 18
São Paulo 18
North Bergen 17
Florence 16
Leawood 16
Toronto 16
West Jordan 15
Munich 14
New Bedfont 14
Pescara 14
Philadelphia 13
Bologna 12
Easley 12
Nuremberg 12
Belo Horizonte 11
Jakarta 11
Redmond 11
Chicago 10
Andover 9
Kilburn 9
Rio de Janeiro 9
Brno 8
Edinburgh 8
Henderson 8
Islington 8
San Mateo 8
Stockholm 8
Ardabil 7
Istanbul 7
Keflavik 7
Turin 7
Dallas 6
Genoa 6
Monmouth Junction 6
Olomouc 6
Ottawa 6
Shanghai 6
Wandsworth 6
Amsterdam 5
Catania 5
Hong Kong 5
Lappeenranta 5
Mannheim 5
Montreal 5
Mumbai 5
New Orleans 5
Prescot 5
Shenzhen 5
Venice 5
Vienna 5
Winnipeg 5
Almaty 4
Assago 4
Augusta 4
Baghdad 4
Brasília 4
Campinas 4
Casablanca 4
Craco 4
Dhaka 4
Guangzhou 4
Jundiaí 4
Totale 7.848
Salva come PNG Salva come JPEG
Nome #
2-vertex connectivity in directed graphs 329
2-Edge Connectivity in Directed Graphs 324
Algoritmi e strutture dati (seconda edizione) 307
GSM and GPRS performance of IPSEC data communication 235
On-line computation of minimal and maximal length paths 232
Strong Articulation Points and Strong Bridges in Large Scale Graphs 231
Finding strong bridges and strong articulation points in linear time 229
2D Color Barcodes for Mobile Phones 217
Dynamically switching vertices in planar graphs 204
A Traffic-based Evolutionary Algorithm for Network Clustering 197
Computing critical nodes in directed graphs 195
Efficient splitting and merging algorithms for order decomposable problems 186
Deterministic fully dynamic data structures for vertex cover and matching 171
Progetto di algoritmi e strutture dati in Java 171
Dynamic algorithms via the primal-dual method 167
Fully dynamic algorithms for 2-edge connectivity 153
On Resilient Graph Spanners 153
Dynamic dominators and low-high orders in DAGs 153
Sparse certificates for 2-connectivity in directed graphs 151
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph 145
On Bubble Generators in Directed Graphs 142
Tropical paths in vertex-colored graphs 142
Dominating sets and connected dominating sets in dynamic graphs 137
Near real-time suffix tree construction via the fringe marked ancestor problem 136
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights 133
On-line algorithms for polynomially solvable satisfiability problems 130
Faster algorithms for all-pairs bounded min-cuts 128
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms 128
Reliability and data density in high capacity color barcodes 125
Optimal Resilient Dynamic Dictionaries 122
Strong connectivity in directed graphs under failures, with applications 120
Planar Reachability Under Single Vertex or Edge Failures 119
Algorithm Engineering 117
Amortized efficiency of a path retrieval data structure 116
Getting back to the past in the union-find problem 115
Experimental Study of Resilient Algorithms and Data Structures 110
On Suffix Extensions in Suffix Trees 109
Sparsification: A technique for speeding up dynamic graph algorithms 105
Separator based sparsification I: planarity testing and minimum spanning trees 104
Maintaining the 3-edge-connected components of a graph on-line 103
Dynamic algorithms for the massively parallel computation model 102
An empirical study of dynamic graph algorithms 100
Engineering and visualizing algorithms 100
Separator based sparsification II: edge and vertex connectivity 99
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier 99
Designing Reliable Algorithms in Unreliable Memories 98
Resilient Dictionaries 96
Worst-case analysis of the set union problem with extended backtracking 96
Engineering Color Barcode Algorithms for Mobile Applications 95
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming 95
Dynamic Graphs 94
Maintenance of a minimum spanning forest in a dynamic plane graph 94
The Price of Resiliency: A Case Study on Sorting with Memory Faults 93
Novel Local-Search-Based Approaches to University Examination Timetabling 92
The set union problem with unlimited backtracking 91
Algorithm Engineering 91
Incremental algorithms for minimal length paths 90
The set union problem with dynamic weighted backtracking 90
A Machine Learning-based approach to Digital Triage 89
Dynamic Trees 88
Sparse dynamic programming II : convex and concave cost functions 88
Finding paths and deleting edges in directed acyclic graphs 87
Compressed weighted de Bruijn graphs 87
Decremental 2- and 3-connectivity on planar graphs 87
Sorting and searching in faulty memories 86
A New System for Secure Handwritten Signing of Documents 85
A family of tree-based generators for bubbles in directed graphs 85
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study 85
Data structures and algorithms for disjoint set union problems 84
On a Facility Location Problem with Applications to Tele-Diagnostic 84
The value of location in keyword auctions 83
Portraying algorithms with Leonardo Web 83
Optimal Resilient Sorting and Searching in the presence of Dynamic Memory Faults 83
A note on set union with arbitrary deunions 83
Dynamic maintenance of directed hypergraphs 82
Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2) Barrier 82
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries 80
Computing vertex-edge cut-pairs and 2-edge cuts in practice 79
A new approach to dynamic all pairs shortest paths 79
Maintaining spanning trees of small diameter 78
Resilient Search Trees 78
CATAI: Cooperative Algorithm and Data Types Animation over the Internet 78
Predicting deadlock in store-and-forward networks 78
Sparse dynamic programming I: linear cost functions 76
Sorting and searching in the presence of memory faults (without redundancy) 76
Fully dynamic planarity testing with applications 75
Topic 12: Theory and Algorithms for Parallel Computation 75
Better transit routing by exploiting vehicle GPS data 74
An algorithm for finding a k-median in a directed tree 71
Exploiting GPS Data in Public Transport Journey Planners 71
Reducing edge connectivity to vertex connectivity 70
CHECKCOL: Improved local search for graph coloring 69
Improved Algorithms for Max Restricted Path Consistency 68
Design of trees in the hose model: The balanced case 68
Maintaining Dynamic Matrices for Fully Dynamic Transitive Closure 67
Optimal Resilient Sorting and Searching in the presence of Memory Faults 66
A Forensic-as-a-servicedelivery platform for law enforcement agencies 65
Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures 63
On Resilient Graph Spanners 61
Symmetric continuous subgraph matching with bidirectional dynamic programming 59
Totale 11.561
Salva come PNG Salva come JPEG
Categoria #
all - tutte 75.925
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 75.925
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020123 0 0 0 0 0 0 0 0 0 0 96 27
2020/20214.000 71 135 209 67 262 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.099 178 100 122 96 208 172 182 247 351 305 138 0
Totale 12.276