IRIS
GUALA', LUCIANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 18.416
AS - Asia 2.780
EU - Europa 1.515
SA - Sud America 332
AF - Africa 28
Continente sconosciuto - Info sul continente non disponibili 6
OC - Oceania 5
Totale 23.082
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 18.373
SG - Singapore 1.774
CN - Cina 349
BR - Brasile 290
RU - Federazione Russa 274
IT - Italia 249
UA - Ucraina 219
HK - Hong Kong 208
IE - Irlanda 168
DE - Germania 163
VN - Vietnam 163
FR - Francia 160
JP - Giappone 85
GB - Regno Unito 67
FI - Finlandia 65
SE - Svezia 55
KR - Corea 45
BD - Bangladesh 25
NL - Olanda 25
IN - India 24
PL - Polonia 23
IQ - Iraq 21
CA - Canada 19
CH - Svizzera 14
AR - Argentina 12
UZ - Uzbekistan 11
KE - Kenya 9
MX - Messico 9
TR - Turchia 9
ID - Indonesia 8
PH - Filippine 8
MY - Malesia 7
VE - Venezuela 7
CL - Cile 6
CO - Colombia 6
ES - Italia 6
NP - Nepal 6
SA - Arabia Saudita 6
ZA - Sudafrica 6
AE - Emirati Arabi Uniti 5
AT - Austria 5
PK - Pakistan 5
AU - Australia 4
EC - Ecuador 4
IL - Israele 4
JO - Giordania 4
RO - Romania 4
DO - Repubblica Dominicana 3
EG - Egitto 3
EU - Europa 3
HN - Honduras 3
LT - Lituania 3
TN - Tunisia 3
AL - Albania 2
BE - Belgio 2
BO - Bolivia 2
CR - Costa Rica 2
DZ - Algeria 2
NI - Nicaragua 2
PE - Perù 2
PS - Palestinian Territory 2
PY - Paraguay 2
TW - Taiwan 2
A1 - Anonimo 1
A2 - ???statistics.table.value.countryCode.A2??? 1
AM - Armenia 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BB - Barbados 1
BG - Bulgaria 1
BY - Bielorussia 1
CG - Congo 1
CZ - Repubblica Ceca 1
DK - Danimarca 1
GA - Gabon 1
GE - Georgia 1
GR - Grecia 1
HR - Croazia 1
HU - Ungheria 1
IR - Iran 1
JM - Giamaica 1
KH - Cambogia 1
LK - Sri Lanka 1
LY - Libia 1
MA - Marocco 1
MD - Moldavia 1
MN - Mongolia 1
NO - Norvegia 1
PR - Porto Rico 1
PT - Portogallo 1
PW - Palau 1
QA - Qatar 1
SN - Senegal 1
SV - El Salvador 1
TH - Thailandia 1
TT - Trinidad e Tobago 1
UY - Uruguay 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 23.082
Salva come PNG Salva come JPEG
Città #
Woodbridge 5.048
Wilmington 4.828
Houston 4.614
Fairfield 574
Singapore 463
Ann Arbor 403
Ashburn 357
Seattle 255
Chandler 231
Hong Kong 206
Cambridge 204
Jacksonville 194
San Jose 191
Dublin 167
Medford 141
Dearborn 129
Beijing 126
The Dalles 84
Tokyo 76
Rome 75
Lawrence 64
Santa Clara 63
New York 55
Los Angeles 54
Moscow 52
Ho Chi Minh City 51
Lauterbourg 51
Hanoi 50
San Diego 34
Buffalo 31
Menlo Park 24
São Paulo 24
Council Bluffs 22
Milan 22
Dallas 21
Mülheim 19
Kraków 17
London 17
Redondo Beach 16
Columbus 15
Helsinki 15
Mountain View 15
Nuremberg 14
Nanjing 11
Belo Horizonte 10
Naples 10
North Bergen 10
Rio de Janeiro 10
Amsterdam 9
Brasília 9
Da Nang 9
Kunming 9
Nairobi 9
Norwalk 9
Porto Alegre 9
Redwood City 9
Guangzhou 8
Hefei 8
Brooklyn 7
Chicago 7
Curitiba 7
San Francisco 7
Selvazzano Dentro 7
Tashkent 7
Turin 7
Atlanta 6
Indiana 6
Kuala Lumpur 6
Lappeenranta 6
Salvador 6
Toronto 6
University Park 6
Warsaw 6
Dhaka 5
Erbil 5
Haiphong 5
Hangzhou 5
Jeddah 5
Manaus 5
Nanchang 5
Orem 5
Salt Lake City 5
Baghdad 4
Boardman 4
Boston 4
Changsha 4
Fuzhou 4
Guayaquil 4
Karlsruhe 4
Novoli 4
Stockholm 4
Zhengzhou 4
Amman 3
Andover 3
Augusta 3
Bagé 3
Baotou 3
Brescia 3
Bắc Giang 3
Campinas 3
Totale 19.457
Salva come PNG Salva come JPEG
Nome #
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 625
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems 510
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 503
A faster computation of all the best swap edges of a tree spanner 495
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 481
Bounded-Distance Network Creation Games 471
Specializations and generalizations of the Stackelberg minimum spanning tree game 470
Dynamic mechanism design 463
Computational aspects of a 2-player Stackelberg shortest paths tree game 463
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem 454
Locating Facilities on a Network to Minimize Their Average Service Radius 454
Exact and approximate algorithms for movement problems on (special classes of) graphs 449
Reducing the diameter of a unit disk graph via node addition 447
The max-distance network creation game on general host graphs 446
Dynamic Mechanism Design 444
Network verification via routing table queries 444
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 438
Bejeweled, Candy Crush and other match-three games are (NP-)hard 437
Stability of Networks in Stretchable Graphs 436
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 432
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 431
The Max-Distance Network Creation Game on General Host Graphs 431
Locality-based network creation games 430
Network Verification via Routing Table Queries 428
On stackelberg pricing with computationally bounded customers 419
Polygon-Constrained Motion Planning Problems 416
Improved approximability and non-approximability results for graph diameter decreasing problems 410
Locality-based network creation games 407
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem 406
Bounded-Distance Network Creation Games 399
Network Creation Games with Traceroute-Based Strategies 397
Improved purely additive fault-tolerant spanners 397
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 396
Multiple-edge-fault-tolerant approximate shortest-path trees 396
An algorithm composition scheme preserving monotonicity 375
On Stackelberg Pricing with Computationally Bounded Consumers 374
Rational Fair Consensus in the Gossip Model 362
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals 361
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 356
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 349
Fault-Tolerant Approximate Shortest-Path Trees 348
Large peg-army maneuvers 346
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 342
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 337
An improved algorithm for computing all the best swap edges of a tree spanner 301
Coalition Resilient Outcomes in Max k-Cut Games 294
Brief announcement: On the parallel undecided-state dynamics with two colors 293
Compact and fast sensitivity oracles for single-source distances 272
Uniform-budget solo chess with only rooks or only knights is hard 266
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors 263
Effcient oracles and routing schemes for replacement paths 245
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 232
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 229
Fault-Tolerant Approximate Shortest-Path Trees 214
Hardness of an asymmetric 2-player Stackelberg Network Pricing Game 201
Consensus vs broadcast, with and without noise 198
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 190
On the complexity of two dots for narrow boards and few colors 176
Swapping mixed-up beers to keep them cool 175
Cutting bamboo down to size 175
Tracking routes in communication networks 110
Tracking routes in communication networks 79
Cutting bamboo down to size 79
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 78
Network creation games with traceroute-based strategies 74
Blackout-Tolerant Temporal Spanners 70
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 62
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 60
Resilient level ancestor, bottleneck, and lowest Common ancestor queries in dynamic trees 57
Graph spanners for group Steiner distances 50
New approximation algorithms for the heterogeneous weighted delivery problem 49
Blackout-tolerant temporal spanners 46
Finding Diameter-Reducing Shortcuts in Trees 42
Temporal queries for dynamic temporal forests 40
Sparse Temporal Spanners with Low Stretch 39
Maintaining k-MinHash signatures over fully-dynamic data streams with recovery 34
Almost Tight Oracles for Fastest-Path Queries on Temporal Trees 16
Uniform-budget solo chess with only rooks or only knights is hard 14
Finding diameter-reducing shortcuts in trees 14
null 3
null 3
Totale 23.418
Salva come PNG Salva come JPEG
Categoria #
all - tutte 51.402
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 51.402
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021142 0 0 0 0 0 0 0 0 0 0 116 26
2021/2022609 33 102 32 10 13 24 38 47 31 45 50 184
2022/2023647 83 62 17 85 32 171 54 25 45 2 52 19
2023/2024268 28 10 12 0 34 43 20 52 12 5 1 51
2024/20252.258 63 289 164 79 15 149 105 59 93 145 551 546
2025/20262.286 146 96 260 165 152 81 348 386 259 379 14 0
Totale 23.418