IRIS - Institutional Research Information System

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.165 0 38 83 222 55 36 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/2025192 178 14 0 0 0 0 0 0 0 0 0 0
Totale 10.369