IRIS
GUALA', LUCIANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 19.410
AS - Asia 2.887
EU - Europa 1.708
SA - Sud America 343
Continente sconosciuto - Info sul continente non disponibili 343
AF - Africa 32
OC - Oceania 5
Totale 24.728
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 19.334
SG - Singapore 1.776
IT - Italia 418
CN - Cina 361
BR - Brasile 294
RU - Federazione Russa 274
UA - Ucraina 219
HK - Hong Kong 209
IE - Irlanda 168
DE - Germania 165
VN - Vietnam 164
FR - Francia 161
BD - Bangladesh 108
JP - Giappone 85
GB - Regno Unito 70
FI - Finlandia 65
SE - Svezia 57
KR - Corea 45
CA - Canada 35
NL - Olanda 34
IN - India 24
PL - Polonia 23
IQ - Iraq 21
AR - Argentina 15
CH - Svizzera 14
UZ - Uzbekistan 11
CO - Colombia 10
KE - Kenya 10
TR - Turchia 10
MX - Messico 9
AE - Emirati Arabi Uniti 8
ES - Italia 8
ID - Indonesia 8
PH - Filippine 8
CR - Costa Rica 7
MY - Malesia 7
NP - Nepal 7
VE - Venezuela 7
CL - Cile 6
SA - Arabia Saudita 6
ZA - Sudafrica 6
AT - Austria 5
HN - Honduras 5
JM - Giamaica 5
PK - Pakistan 5
AU - Australia 4
EC - Ecuador 4
IL - Israele 4
JO - Giordania 4
RO - Romania 4
BE - Belgio 3
DO - Repubblica Dominicana 3
EG - Egitto 3
EU - Europa 3
LT - Lituania 3
TN - Tunisia 3
TT - Trinidad e Tobago 3
AL - Albania 2
BB - Barbados 2
BO - Bolivia 2
CZ - Repubblica Ceca 2
DK - Danimarca 2
DZ - Algeria 2
IS - Islanda 2
NI - Nicaragua 2
PE - Perù 2
PS - Palestinian Territory 2
PY - Paraguay 2
SC - Seychelles 2
TH - Thailandia 2
TW - Taiwan 2
XK - ???statistics.table.value.countryCode.XK??? 2
A1 - Anonimo 1
A2 - ???statistics.table.value.countryCode.A2??? 1
AM - Armenia 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
BS - Bahamas 1
BY - Bielorussia 1
CG - Congo 1
GA - Gabon 1
GD - Grenada 1
GE - Georgia 1
GR - Grecia 1
HR - Croazia 1
HU - Ungheria 1
IR - Iran 1
KH - Cambogia 1
KN - Saint Kitts e Nevis 1
LK - Sri Lanka 1
LY - Libia 1
MA - Marocco 1
MD - Moldavia 1
MM - Myanmar 1
MN - Mongolia 1
NG - Nigeria 1
NO - Norvegia 1
OM - Oman 1
PR - Porto Rico 1
Totale 24.386
Salva come PNG Salva come JPEG
Città #
Woodbridge 5.048
Wilmington 4.828
Houston 4.615
Fairfield 574
Ashburn 499
Singapore 464
Ann Arbor 403
San Jose 334
Seattle 256
Chandler 231
Hong Kong 206
Cambridge 204
Jacksonville 195
Dublin 167
Medford 141
Dearborn 129
Beijing 127
Rome 93
Council Bluffs 92
The Dalles 91
Staranzano 79
Tokyo 76
Santa Clara 73
New York 66
Lawrence 65
Los Angeles 62
Moscow 52
Hanoi 51
Ho Chi Minh City 51
Lauterbourg 51
Buffalo 35
San Diego 35
Dallas 26
Milan 26
Denver 25
Menlo Park 24
São Paulo 24
Mülheim 19
Naples 19
London 18
Kraków 17
Columbus 16
Redondo Beach 16
Helsinki 15
Mountain View 15
Atlanta 14
Nuremberg 14
Toronto 13
Brooklyn 11
Nanjing 11
Belo Horizonte 10
Chicago 10
Nairobi 10
North Bergen 10
Rio de Janeiro 10
Amsterdam 9
Brasília 9
Da Nang 9
Kunming 9
Norwalk 9
Phoenix 9
Porto Alegre 9
Redwood City 9
Turin 9
Curitiba 8
Guangzhou 8
Hefei 8
Philadelphia 7
Queens 7
San Francisco 7
Selvazzano Dentro 7
Tashkent 7
Dhaka 6
Dubai 6
Florence 6
Hangzhou 6
Indiana 6
Kuala Lumpur 6
Lappeenranta 6
Salvador 6
San José 6
Stockholm 6
University Park 6
Warsaw 6
Boardman 5
Boston 5
Erbil 5
Haiphong 5
Jeddah 5
Las Vegas 5
Manaus 5
Nanchang 5
Orem 5
Pescara 5
Salt Lake City 5
Augusta 4
Baghdad 4
Bridgeport 4
Changsha 4
Cleveland 4
Totale 20.053
Salva come PNG Salva come JPEG
Nome #
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 638
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems 526
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 519
A faster computation of all the best swap edges of a tree spanner 513
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 494
Bounded-Distance Network Creation Games 491
Dynamic mechanism design 481
Locating Facilities on a Network to Minimize Their Average Service Radius 476
Specializations and generalizations of the Stackelberg minimum spanning tree game 476
Computational aspects of a 2-player Stackelberg shortest paths tree game 475
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem 469
The max-distance network creation game on general host graphs 464
Exact and approximate algorithms for movement problems on (special classes of) graphs 462
Reducing the diameter of a unit disk graph via node addition 459
Dynamic Mechanism Design 458
Bejeweled, Candy Crush and other match-three games are (NP-)hard 453
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 452
Locality-based network creation games 452
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 450
Improved approximability and non-approximability results for graph diameter decreasing problems 449
Network verification via routing table queries 449
Network Verification via Routing Table Queries 447
Stability of Networks in Stretchable Graphs 446
The Max-Distance Network Creation Game on General Host Graphs 445
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 443
On stackelberg pricing with computationally bounded customers 433
Polygon-Constrained Motion Planning Problems 428
Locality-based network creation games 420
Multiple-edge-fault-tolerant approximate shortest-path trees 419
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem 415
Bounded-Distance Network Creation Games 414
Improved purely additive fault-tolerant spanners 414
Network Creation Games with Traceroute-Based Strategies 411
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 407
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 397
An algorithm composition scheme preserving monotonicity 387
On Stackelberg Pricing with Computationally Bounded Consumers 383
Rational Fair Consensus in the Gossip Model 380
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals 376
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 362
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 361
Fault-Tolerant Approximate Shortest-Path Trees 358
Large peg-army maneuvers 357
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 350
An improved algorithm for computing all the best swap edges of a tree spanner 319
Brief announcement: On the parallel undecided-state dynamics with two colors 311
Coalition Resilient Outcomes in Max k-Cut Games 305
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors 287
Uniform-budget solo chess with only rooks or only knights is hard 281
Compact and fast sensitivity oracles for single-source distances 281
Effcient oracles and routing schemes for replacement paths 254
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 245
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 237
Fault-Tolerant Approximate Shortest-Path Trees 234
Consensus vs broadcast, with and without noise 226
Hardness of an asymmetric 2-player Stackelberg Network Pricing Game 217
Swapping mixed-up beers to keep them cool 208
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 200
Cutting bamboo down to size 192
On the complexity of two dots for narrow boards and few colors 188
Tracking routes in communication networks 118
Cutting bamboo down to size 116
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 99
Network creation games with traceroute-based strategies 96
Tracking routes in communication networks 92
Blackout-Tolerant Temporal Spanners 87
Maintaining k-MinHash signatures over fully-dynamic data streams with recovery 80
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 76
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 72
Resilient level ancestor, bottleneck, and lowest Common ancestor queries in dynamic trees 69
New approximation algorithms for the heterogeneous weighted delivery problem 68
Graph spanners for group Steiner distances 63
Temporal queries for dynamic temporal forests 58
Blackout-tolerant temporal spanners 57
Sparse Temporal Spanners with Low Stretch 57
Finding Diameter-Reducing Shortcuts in Trees 53
Finding diameter-reducing shortcuts in trees 49
Almost Tight Oracles for Fastest-Path Queries on Temporal Trees 37
Uniform-budget solo chess with only rooks or only knights is hard 31
null 3
null 3
Totale 24.728
Salva come PNG Salva come JPEG
Categoria #
all - tutte 57.527
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 57.527
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022442 0 0 0 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.640 146 96 260 165 152 81 348 386 259 379 162 206
2026/2027956 118 131 559 148 0 0 0 0 0 0 0 0
Totale 24.728