IRIS - Institutional Research Information System

Italiano, Giuseppe Francesco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.047
EU - Europa 3.776
AS - Asia 818
SA - Sud America 18
Continente sconosciuto - Info sul continente non disponibili 12
AF - Africa 8
OC - Oceania 4
Totale 10.683
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.012
GB - Regno Unito 1.197
UA - Ucraina 556
SE - Svezia 531
IT - Italia 479
SG - Singapore 415
FR - Francia 337
DE - Germania 149
CN - Cina 139
RU - Federazione Russa 137
VN - Vietnam 96
IE - Irlanda 95
PL - Polonia 95
BE - Belgio 65
IN - India 54
IR - Iran 51
FI - Finlandia 33
CA - Canada 31
DK - Danimarca 20
CZ - Repubblica Ceca 18
BR - Brasile 16
NL - Olanda 15
EU - Europa 12
ID - Indonesia 11
HK - Hong Kong 7
IS - Islanda 7
LT - Lituania 7
BG - Bulgaria 6
CH - Svizzera 6
TR - Turchia 6
RO - Romania 5
AT - Austria 4
PH - Filippine 4
AZ - Azerbaigian 3
ES - Italia 3
KZ - Kazakistan 3
LA - Repubblica Popolare Democratica del Laos 3
MA - Marocco 3
RS - Serbia 3
SC - Seychelles 3
AL - Albania 2
AU - Australia 2
IL - Israele 2
JP - Giappone 2
KR - Corea 2
MX - Messico 2
NZ - Nuova Zelanda 2
OM - Oman 2
PK - Pakistan 2
TH - Thailandia 2
TW - Taiwan 2
AE - Emirati Arabi Uniti 1
BD - Bangladesh 1
BO - Bolivia 1
CL - Cile 1
CY - Cipro 1
DZ - Algeria 1
GE - Georgia 1
GR - Grecia 1
GT - Guatemala 1
HR - Croazia 1
HU - Ungheria 1
IQ - Iraq 1
JO - Giordania 1
KG - Kirghizistan 1
KH - Cambogia 1
MD - Moldavia 1
MN - Mongolia 1
MY - Malesia 1
NG - Nigeria 1
NP - Nepal 1
PA - Panama 1
PT - Portogallo 1
QA - Qatar 1
SK - Slovacchia (Repubblica Slovacca) 1
Totale 10.683
Salva come PNG Salva come JPEG
Città #
Southend 1.032
Fairfield 907
Chandler 822
Ashburn 561
Woodbridge 482
Seattle 404
Wilmington 367
Houston 356
Singapore 324
Cambridge 297
Ann Arbor 221
Jacksonville 190
Princeton 106
Dublin 95
Dong Ket 94
Warsaw 94
Guido 82
Beijing 81
Rome 69
Brussels 65
London 64
San Diego 63
New York 61
Moscow 42
Dearborn 31
Helsinki 27
Naples 22
Milan 21
Redwood City 21
Santa Clara 21
Atlanta 20
Zanjan 20
Boardman 19
Copenhagen 19
Norwalk 18
Florence 16
Leawood 16
Toronto 16
New Bedfont 14
Philadelphia 13
Frankfurt am Main 12
Pescara 12
West Jordan 12
Jakarta 11
Los Angeles 11
Redmond 11
Andover 9
Chicago 9
Kilburn 9
Brno 8
Edinburgh 8
Henderson 8
Islington 8
Munich 8
San Mateo 8
Stockholm 8
Ardabil 7
Keflavik 7
Turin 7
Genoa 6
Istanbul 6
Monmouth Junction 6
Olomouc 6
Ottawa 6
Shanghai 6
Wandsworth 6
Mumbai 5
New Orleans 5
North Bergen 5
Prescot 5
Shenzhen 5
Winnipeg 5
Amsterdam 4
Augusta 4
Bologna 4
Craco 4
Dallas 4
Guangzhou 4
Lanciano 4
Las Vegas 4
Mountain View 4
Naaldwijk 4
Sofia 4
St Petersburg 4
Timisoara 4
Venice 4
Acton 3
Almaty 3
Belgrade 3
Chiswick 3
Kunming 3
Lappeenranta 3
Mestre 3
Modena 3
Montreal 3
Nuremberg 3
Omsk 3
Paris 3
Piscataway 3
Pittsburgh 3
Totale 7.536
Salva come PNG Salva come JPEG
Nome #
2-vertex connectivity in directed graphs 301
2-Edge Connectivity in Directed Graphs 300
Algoritmi e strutture dati (seconda edizione) 249
Strong Articulation Points and Strong Bridges in Large Scale Graphs 225
GSM and GPRS performance of IPSEC data communication 223
On-line computation of minimal and maximal length paths 222
Finding strong bridges and strong articulation points in linear time 218
Dynamically switching vertices in planar graphs 198
2D Color Barcodes for Mobile Phones 197
Computing critical nodes in directed graphs 185
A Traffic-based Evolutionary Algorithm for Network Clustering 179
Efficient splitting and merging algorithms for order decomposable problems 177
Progetto di algoritmi e strutture dati in Java 166
Deterministic fully dynamic data structures for vertex cover and matching 164
Dynamic algorithms via the primal-dual method 160
Sparse certificates for 2-connectivity in directed graphs 150
Fully dynamic algorithms for 2-edge connectivity 147
On Resilient Graph Spanners 146
Tropical paths in vertex-colored graphs 137
Near real-time suffix tree construction via the fringe marked ancestor problem 134
On Bubble Generators in Directed Graphs 131
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph 131
Dominating sets and connected dominating sets in dynamic graphs 131
Dynamic dominators and low-high orders in DAGs 130
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights 128
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms 125
On-line algorithms for polynomially solvable satisfiability problems 121
Faster algorithms for all-pairs bounded min-cuts 121
Optimal Resilient Dynamic Dictionaries 121
Reliability and data density in high capacity color barcodes 121
Planar Reachability Under Single Vertex or Edge Failures 117
Getting back to the past in the union-find problem 113
Experimental Study of Resilient Algorithms and Data Structures 107
On Suffix Extensions in Suffix Trees 104
Sparsification: A technique for speeding up dynamic graph algorithms 103
Algorithm Engineering 100
Amortized efficiency of a path retrieval data structure 97
Maintaining the 3-edge-connected components of a graph on-line 97
Strong connectivity in directed graphs under failures, with applications 96
Designing Reliable Algorithms in Unreliable Memories 94
Engineering and visualizing algorithms 93
Dynamic algorithms for the massively parallel computation model 93
Worst-case analysis of the set union problem with extended backtracking 91
Resilient Dictionaries 90
Engineering Color Barcode Algorithms for Mobile Applications 90
Dynamic Graphs 90
Separator based sparsification II: edge and vertex connectivity 89
The Price of Resiliency: A Case Study on Sorting with Memory Faults 89
Maintenance of a minimum spanning forest in a dynamic plane graph 88
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier 86
The set union problem with unlimited backtracking 85
Dynamic Trees 85
Incremental algorithms for minimal length paths 83
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming 83
An empirical study of dynamic graph algorithms 83
Sparse dynamic programming II : convex and concave cost functions 83
The set union problem with dynamic weighted backtracking 82
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study 82
Separator based sparsification I: planarity testing and minimum spanning trees 81
Optimal Resilient Sorting and Searching in the presence of Dynamic Memory Faults 80
Finding paths and deleting edges in directed acyclic graphs 80
The value of location in keyword auctions 79
A Machine Learning-based approach to Digital Triage 79
Algorithm Engineering 79
Sorting and searching in faulty memories 78
Data structures and algorithms for disjoint set union problems 78
On a Facility Location Problem with Applications to Tele-Diagnostic 77
Decremental 2- and 3-connectivity on planar graphs 76
A New System for Secure Handwritten Signing of Documents 75
Dynamic maintenance of directed hypergraphs 74
Resilient Search Trees 73
Sorting and searching in the presence of memory faults (without redundancy) 73
Predicting deadlock in store-and-forward networks 73
Portraying algorithms with Leonardo Web 72
Topic 12: Theory and Algorithms for Parallel Computation 72
A family of tree-based generators for bubbles in directed graphs 72
Better transit routing by exploiting vehicle GPS data 72
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries 72
Sparse dynamic programming I: linear cost functions 70
Compressed weighted de Bruijn graphs 70
Maintaining spanning trees of small diameter 69
A new approach to dynamic all pairs shortest paths 68
Reducing edge connectivity to vertex connectivity 68
Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2) Barrier 67
Exploiting GPS Data in Public Transport Journey Planners 67
A note on set union with arbitrary deunions 67
Fully dynamic planarity testing with applications 66
Improved Algorithms for Max Restricted Path Consistency 65
CHECKCOL: Improved local search for graph coloring 65
Maintaining Dynamic Matrices for Fully Dynamic Transitive Closure 64
Design of trees in the hose model: The balanced case 63
CATAI: Cooperative Algorithm and Data Types Animation over the Internet 63
Novel Local-Search-Based Approaches to University Examination Timetabling 62
Optimal Resilient Sorting and Searching in the presence of Memory Faults 62
Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures 60
An algorithm for finding a k-median in a directed tree 59
On Resilient Graph Spanners 56
Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem 55
A Forensic-as-a-servicedelivery platform for law enforcement agencies 53
Color Classifiers for 2D Color Barcodes 52
Totale 10.637
Salva come PNG Salva come JPEG
Categoria #
all - tutte 69.581
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 69.581
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020731 0 0 0 0 0 0 129 163 222 94 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/2025932 178 100 122 96 208 172 56 0 0 0 0 0
Totale 11.109