IRIS
GUALA', LUCIANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 18.638
AS - Asia 2.869
EU - Europa 1.579
SA - Sud America 334
AF - Africa 28
Continente sconosciuto - Info sul continente non disponibili 6
OC - Oceania 5
Totale 23.459
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 18.586
SG - Singapore 1.774
CN - Cina 359
IT - Italia 301
BR - Brasile 291
RU - Federazione Russa 274
UA - Ucraina 219
HK - Hong Kong 208
IE - Irlanda 168
DE - Germania 165
VN - Vietnam 164
FR - Francia 161
BD - Bangladesh 100
JP - Giappone 85
GB - Regno Unito 67
FI - Finlandia 65
SE - Svezia 55
KR - Corea 45
NL - Olanda 31
CA - Canada 27
IN - India 24
PL - Polonia 23
IQ - Iraq 21
CH - Svizzera 14
AR - Argentina 13
UZ - Uzbekistan 11
KE - Kenya 9
MX - Messico 9
TR - Turchia 9
ID - Indonesia 8
PH - Filippine 8
AE - Emirati Arabi Uniti 7
ES - Italia 7
MY - Malesia 7
VE - Venezuela 7
CL - Cile 6
CO - Colombia 6
NP - Nepal 6
SA - Arabia Saudita 6
ZA - Sudafrica 6
AT - Austria 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
HN - Honduras 3
LT - Lituania 3
TN - Tunisia 3
AL - Albania 2
BO - Bolivia 2
CR - Costa Rica 2
CZ - Repubblica Ceca 2
DZ - Algeria 2
NI - Nicaragua 2
PE - Perù 2
PS - Palestinian Territory 2
PY - Paraguay 2
TT - Trinidad e Tobago 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
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
MM - Myanmar 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
UY - Uruguay 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 23.459
Salva come PNG Salva come JPEG
Città #
Woodbridge 5.048
Wilmington 4.828
Houston 4.614
Fairfield 574
Singapore 463
Ann Arbor 403
Ashburn 372
San Jose 280
Seattle 255
Chandler 231
Hong Kong 206
Cambridge 204
Jacksonville 194
Dublin 167
Medford 141
Dearborn 129
Beijing 126
The Dalles 88
Rome 83
Tokyo 76
Santa Clara 68
Lawrence 65
New York 64
Los Angeles 59
Moscow 52
Hanoi 51
Ho Chi Minh City 51
Lauterbourg 51
Buffalo 35
Council Bluffs 35
San Diego 35
Menlo Park 24
Milan 24
São Paulo 24
Dallas 22
Mülheim 19
Kraków 17
London 17
Redondo Beach 16
Columbus 15
Helsinki 15
Mountain View 15
Naples 14
Nuremberg 14
Nanjing 11
Belo Horizonte 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
Toronto 9
Chicago 8
Guangzhou 8
Hefei 8
Turin 8
Brooklyn 7
Curitiba 7
Phoenix 7
San Francisco 7
Selvazzano Dentro 7
Tashkent 7
Atlanta 6
Florence 6
Indiana 6
Kuala Lumpur 6
Lappeenranta 6
Salvador 6
University Park 6
Warsaw 6
Boardman 5
Boston 5
Dhaka 5
Dubai 5
Erbil 5
Haiphong 5
Hangzhou 5
Jeddah 5
Manaus 5
Nanchang 5
Orem 5
Queens 5
Salt Lake City 5
Augusta 4
Baghdad 4
Changsha 4
Des Moines 4
Fuzhou 4
Guayaquil 4
Karlsruhe 4
Miami 4
Novoli 4
Stockholm 4
Zhengzhou 4
Amman 3
Totale 19.640
Salva come PNG Salva come JPEG
Nome #
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 626
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems 511
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 508
A faster computation of all the best swap edges of a tree spanner 500
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 484
Bounded-Distance Network Creation Games 480
Specializations and generalizations of the Stackelberg minimum spanning tree game 471
Dynamic mechanism design 468
Computational aspects of a 2-player Stackelberg shortest paths tree game 466
Locating Facilities on a Network to Minimize Their Average Service Radius 460
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem 458
The max-distance network creation game on general host graphs 454
Dynamic Mechanism Design 452
Exact and approximate algorithms for movement problems on (special classes of) graphs 450
Reducing the diameter of a unit disk graph via node addition 448
Network verification via routing table queries 445
Locality-based network creation games 444
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 441
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 441
Stability of Networks in Stretchable Graphs 439
Bejeweled, Candy Crush and other match-three games are (NP-)hard 438
The Max-Distance Network Creation Game on General Host Graphs 434
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 433
Improved approximability and non-approximability results for graph diameter decreasing problems 432
Network Verification via Routing Table Queries 431
On stackelberg pricing with computationally bounded customers 424
Polygon-Constrained Motion Planning Problems 417
Locality-based network creation games 412
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem 407
Multiple-edge-fault-tolerant approximate shortest-path trees 407
Bounded-Distance Network Creation Games 403
Improved purely additive fault-tolerant spanners 400
Network Creation Games with Traceroute-Based Strategies 399
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 397
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 385
On Stackelberg Pricing with Computationally Bounded Consumers 376
An algorithm composition scheme preserving monotonicity 376
Rational Fair Consensus in the Gossip Model 366
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals 363
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 353
Fault-Tolerant Approximate Shortest-Path Trees 350
Large peg-army maneuvers 348
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 346
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 341
An improved algorithm for computing all the best swap edges of a tree spanner 304
Brief announcement: On the parallel undecided-state dynamics with two colors 299
Coalition Resilient Outcomes in Max k-Cut Games 297
Compact and fast sensitivity oracles for single-source distances 273
Uniform-budget solo chess with only rooks or only knights is hard 269
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors 269
Effcient oracles and routing schemes for replacement paths 246
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 236
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 232
Fault-Tolerant Approximate Shortest-Path Trees 218
Consensus vs broadcast, with and without noise 207
Hardness of an asymmetric 2-player Stackelberg Network Pricing Game 205
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 191
Swapping mixed-up beers to keep them cool 188
On the complexity of two dots for narrow boards and few colors 178
Cutting bamboo down to size 178
Tracking routes in communication networks 112
Cutting bamboo down to size 99
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 82
Tracking routes in communication networks 81
Network creation games with traceroute-based strategies 79
Blackout-Tolerant Temporal Spanners 72
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 64
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 63
Resilient level ancestor, bottleneck, and lowest Common ancestor queries in dynamic trees 58
New approximation algorithms for the heterogeneous weighted delivery problem 55
Graph spanners for group Steiner distances 52
Maintaining k-MinHash signatures over fully-dynamic data streams with recovery 50
Blackout-tolerant temporal spanners 48
Finding Diameter-Reducing Shortcuts in Trees 43
Temporal queries for dynamic temporal forests 42
Sparse Temporal Spanners with Low Stretch 42
Finding diameter-reducing shortcuts in trees 33
Almost Tight Oracles for Fastest-Path Queries on Temporal Trees 20
Uniform-budget solo chess with only rooks or only knights is hard 20
null 3
null 3
Totale 23.795
Salva come PNG Salva come JPEG
Categoria #
all - tutte 53.772
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 53.772
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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.640 146 96 260 165 152 81 348 386 259 379 162 206
2026/202723 23 0 0 0 0 0 0 0 0 0 0 0
Totale 23.795