ITALIANO, GIUSEPPE FRANCESCO
 Distribuzione geografica
Continente #
NA - Nord America 32.423
AS - Asia 2.997
EU - Europa 2.163
SA - Sud America 479
AF - Africa 34
OC - Oceania 9
Continente sconosciuto - Info sul continente non disponibili 8
Totale 38.113
Nazione #
US - Stati Uniti d'America 32.340
SG - Singapore 1.708
CN - Cina 521
UA - Ucraina 403
BR - Brasile 399
RU - Federazione Russa 375
IE - Irlanda 305
DE - Germania 303
IT - Italia 228
HK - Hong Kong 213
VN - Vietnam 192
FR - Francia 151
JP - Giappone 112
FI - Finlandia 94
SE - Svezia 89
GB - Regno Unito 83
KR - Corea 74
PL - Polonia 46
IN - India 39
MX - Messico 33
AR - Argentina 31
BD - Bangladesh 27
CA - Canada 26
EC - Ecuador 25
TR - Turchia 19
ES - Italia 18
NL - Olanda 16
IQ - Iraq 14
ID - Indonesia 13
CH - Svizzera 9
PH - Filippine 9
PK - Pakistan 9
AU - Australia 8
CO - Colombia 8
ZA - Sudafrica 8
AT - Austria 7
BE - Belgio 7
CL - Cile 7
TN - Tunisia 7
GR - Grecia 6
IL - Israele 6
JM - Giamaica 6
MY - Malesia 6
BY - Bielorussia 5
A1 - Anonimo 4
AL - Albania 4
CI - Costa d'Avorio 4
EG - Egitto 4
MA - Marocco 4
SA - Arabia Saudita 4
TH - Thailandia 4
VE - Venezuela 4
AE - Emirati Arabi Uniti 3
CR - Costa Rica 3
HN - Honduras 3
HU - Ungheria 3
KE - Kenya 3
KZ - Kazakistan 3
LT - Lituania 3
PY - Paraguay 3
UZ - Uzbekistan 3
DO - Repubblica Dominicana 2
EU - Europa 2
KG - Kirghizistan 2
KH - Cambogia 2
LK - Sri Lanka 2
PA - Panama 2
TT - Trinidad e Tobago 2
TW - Taiwan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BB - Barbados 1
BG - Bulgaria 1
BN - Brunei Darussalam 1
BS - Bahamas 1
CG - Congo 1
CZ - Repubblica Ceca 1
DK - Danimarca 1
DM - Dominica 1
DZ - Algeria 1
ET - Etiopia 1
GE - Georgia 1
GT - Guatemala 1
IR - Iran 1
JO - Giordania 1
LB - Libano 1
MK - Macedonia 1
NI - Nicaragua 1
NP - Nepal 1
NZ - Nuova Zelanda 1
OM - Oman 1
PE - Perù 1
PS - Palestinian Territory 1
PT - Portogallo 1
QA - Qatar 1
RO - Romania 1
RS - Serbia 1
SN - Senegal 1
UY - Uruguay 1
Totale 38.111
Città #
Wilmington 8.817
Woodbridge 8.571
Houston 8.421
Fairfield 1.107
Singapore 822
Ann Arbor 616
Ashburn 535
Seattle 436
Chandler 369
Cambridge 367
Jacksonville 366
San Jose 317
Dublin 294
Dearborn 232
Hong Kong 209
Medford 204
Beijing 172
New York 137
Santa Clara 137
The Dalles 123
Lawrence 99
Tokyo 97
Rome 84
Lauterbourg 69
Moscow 69
Ho Chi Minh City 65
Los Angeles 65
Buffalo 57
Menlo Park 52
Mülheim 48
San Diego 44
Hanoi 43
Zhengzhou 41
São Paulo 40
Kraków 36
Milan 27
Des Moines 24
Helsinki 22
San Francisco 20
Dallas 19
Norwalk 19
Falls Church 18
Guangzhou 17
London 17
Chicago 16
Palo Alto 16
Rio de Janeiro 16
Hangzhou 15
Phoenix 15
Verona 15
Council Bluffs 14
Mexico City 13
Kunming 12
Orem 12
Belo Horizonte 11
Hefei 11
Nuremberg 11
Redondo Beach 11
University Park 11
Atlanta 10
Quito 10
Saint Petersburg 10
San Mateo 10
Shanghai 10
Da Nang 9
Haiphong 8
Nanjing 8
Redwood City 8
Boston 7
Brussels 7
Chennai 7
Columbus 7
Dhaka 7
Salvador 7
Toronto 7
Amsterdam 6
Brasília 6
Brooklyn 6
Denver 6
Heiwajima 6
Jinan 6
Kyoto 6
Munich 6
Nanchang 6
Stockholm 6
Warsaw 6
Florence 5
Frankfurt am Main 5
Fuzhou 5
Goiânia 5
Hải Dương 5
Kuala Lumpur 5
Manchester 5
Marabá 5
Minsk 5
Naples 5
Xian 5
Bangkok 4
Boardman 4
Campinas 4
Totale 33.808
Nome #
Novel local-search-based approaches to university examination timetabling 512
Finding strong bridges and strong articulation points in linear time 502
Design of trees in the hose model: The balanced case 486
2-Connectivity in directed graphs: an experimental study 482
Experimental study of resilient algorithms and data structures 478
The price of resiliency: a case study on sorting with memory faults 473
2-Vertex connectivity in directed graphs 472
An experimental study of dynamic dominators 471
Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the O(n(2)) barrier 466
Algorithmic techniques for maintaining shortest routes in dynamic networks 466
A traffic-based evolutionary algorithm for network clustering 460
Penalized second price: a new pricing algorithm for advertising in search engines 459
CHECKCOL: improved local search for graph coloring 457
Computing graph spanners in small memory: fault-tolerance and streaming 455
SAVED: Secure Android Value addED services 454
2D Color Barcodes for Mobile Phones 450
Designing reliable algorithms in unreliable memories 448
Optimal resilient sorting and searching in the presence of memory faults 445
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures 441
The value of location in keyword auctions 441
On a facility location problem with applications to tele-diagnostic 441
A Forensic-as-a-servicedelivery platform for law enforcement agencies 441
Sorting and searching in faulty memories 439
A new approach to dynamic all pairs shortest paths 434
Data structures resilient to memory faults: An experimental study of dictionaries 432
A stochastic location problem with applications to tele-diagnostic 429
Data structures resilient to memory faults: an experimental study of dictionaries 428
Exploiting GPS data in public transport journey planners 427
Better transit routing by exploiting vehicle GPS data 427
Design of dynamic algorithms via primal-dual method 424
High capacity colored two dimensional codes 423
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs 423
Handwritten signature verification with 2D color barcodes 419
Traffic-based network clustering 418
Computing graph spanners in small memory: fault-tolerance and streaming 418
Finding strong articulation points and strong bridges in linear time 415
AMachine Learning-based approach to Digital Triage 414
Reliability and data density in high capacity color barcodes 414
2-Edge connectivity in directed graphs 414
Traffic vs topology in network clustering: Does it matter? 413
Distributed simulation of Electronic Warfare command and control scenarios 410
Maintaining dynamic minimum spanning trees: an experimental study 408
On suffix extensions in suffix trees 408
Near real-time suffix tree construction via the fringe marked ancestor problem 407
The competitor busting strategy in keyword auctions: who’s worst hit? 404
Topic 12: Theory and Algorithms for Parallel Computation 402
Facial recognition with 2D color barcodes 402
Resilient dictionaries 401
On Suffix Extensions in Suffix Trees 401
A simulator of a mobile ad-hoc network in a hostile environment 400
An evolutionary algorithm for network clustering through traffic matrices 396
Small stretch spanners on dynamic graphs 392
Computing strong articulation points and strong bridges in large scale graphs 392
Engineering color barcode algorithms for mobile applications 392
Resilient algorithms and data structures 391
Fully dynamic all pairs shortest paths with real edge weights 390
Improved algorithms for min cut and max flow in undirected planar graphs 388
On Resilient Graph Spanners 387
Shared backup & restore: save, recover and share personal information into closed groups of smartphones 384
Near real-time suffix tree construction via the fringe marked ancestor problem 383
Facial biometrics for 2D barcodes 383
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs 383
Deterministic fully dynamic data structures for vertex cover and matching 383
Small stretch (alpha, beta)-spanners in the streaming model 382
A model for the dynamics of bidders in the simulation of keyword auctions 380
Mantaining dynamic matrices for fully dynamic transitive closure 379
Experimental analysis of dynamic all pairs shortest path algorithms 375
SecureMyDroid: enforcing security in the mobile devices lifecycle 372
New Algorithms for Examination Timetabling 369
Is timetabling routing always reliable for public transport? 365
The Quest for the shortest route 365
Sparse subgraphs for 2-connectivity in directed graphs 354
Frequency domain analysis of large-scale proxy logs for botnet traffic detection 344
Incremental strong connectivity and 2 connectivity in directed graphs 341
A data streaming approach to link mining in criminal networks 337
On resilient graph spanners 335
Graph spanners in the streaming model: an experimental study 335
Dynamic algorithms via the primal-dual method 332
Sparse certificates for 2-connectivity in directed graphs 324
Strong articulation points and strong bridges in large scale graphs 316
Tropical paths in vertex-colored graphs 314
Computing critical nodes in directed graphs 312
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs 304
Decremental single-source reachability and strongly connected components in Õ(m√n) total update time 303
Online handwritten signature verification for low-end devices 301
Fast mining of large-scale logs for Botnet detection: a field study 296
Strong connectivity in directed graphs under failures, with applications 285
All-pairs 2-reachability in O(nωlog n) time 282
Maximum colorful cycles in vertex-colored graphs 277
Computing 2-Connected components and maximal 2-Connected subgraphs in directed graphs: An experimental study 274
An operational framework for incident handling 273
2-vertex connectivity in directed graphs 266
Decremental data structures for connectivity and dominators in directed graphs 266
Contracting a planar graph efficiently 262
Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders 249
Preventing ransomware attacks through file system filter drivers 234
What's inside a bow-tie: Analyzing the core of the web and of social networks 222
On bubble generators in directed graphs 219
Decremental single-source reachability in planar digraphs 196
All-Pairs LCA in DAGs: breaking through the O(n2.5) barrier 67
Totale 38.105
Categoria #
all - tutte 79.346
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 79.346


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202152 0 0 0 0 0 0 0 0 0 0 0 52
2021/2022875 45 98 22 39 30 63 51 51 55 91 63 267
2022/20231.028 128 80 42 121 51 273 92 61 71 8 68 33
2023/2024374 28 19 14 13 22 135 13 0 9 13 8 100
2024/20252.436 76 618 261 114 22 78 168 155 198 227 241 278
2025/20262.798 202 125 363 160 217 69 452 396 407 277 98 32
Totale 38.295