IRIS
GUALA', LUCIANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 18.761
AS - Asia 2.878
EU - Europa 1.600
Continente sconosciuto - Info sul continente non disponibili 342
SA - Sud America 335
AF - Africa 30
OC - Oceania 5
Totale 23.951
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 18.701
SG - Singapore 1.776
CN - Cina 360
IT - Italia 320
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 106
JP - Giappone 85
GB - Regno Unito 67
FI - Finlandia 65
SE - Svezia 55
KR - Corea 45
NL - Olanda 31
CA - Canada 30
IN - India 24
PL - Polonia 23
IQ - Iraq 21
AR - Argentina 14
CH - Svizzera 14
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
CR - Costa Rica 3
DO - Repubblica Dominicana 3
EG - Egitto 3
EU - Europa 3
HN - Honduras 3
LT - Lituania 3
TN - Tunisia 3
AL - Albania 2
BB - Barbados 2
BO - Bolivia 2
CZ - Repubblica Ceca 2
DZ - Algeria 2
IS - Islanda 2
JM - Giamaica 2
NI - Nicaragua 2
PE - Perù 2
PS - Palestinian Territory 2
PY - Paraguay 2
SC - Seychelles 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
BG - Bulgaria 1
BS - Bahamas 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
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
NO - Norvegia 1
PR - Porto Rico 1
PT - Portogallo 1
PW - Palau 1
QA - Qatar 1
SN - Senegal 1
SV - El Salvador 1
Totale 23.612
Salva come PNG Salva come JPEG
Città #
Woodbridge 5.048
Wilmington 4.828
Houston 4.614
Fairfield 574
Singapore 464
Ann Arbor 403
Ashburn 389
San Jose 288
Seattle 255
Chandler 231
Hong Kong 206
Cambridge 204
Jacksonville 194
Dublin 167
Medford 141
Dearborn 129
Beijing 127
The Dalles 90
Rome 89
Tokyo 76
Santa Clara 71
Lawrence 65
New York 64
Los Angeles 60
Moscow 52
Hanoi 51
Ho Chi Minh City 51
Lauterbourg 51
Council Bluffs 49
Buffalo 35
San Diego 35
Milan 26
Dallas 24
Menlo Park 24
São Paulo 24
Mülheim 19
Naples 19
London 18
Kraków 17
Redondo Beach 16
Columbus 15
Helsinki 15
Mountain View 15
Nuremberg 14
Nanjing 11
Belo Horizonte 10
Chicago 10
North Bergen 10
Rio de Janeiro 10
Toronto 10
Amsterdam 9
Brasília 9
Da Nang 9
Kunming 9
Nairobi 9
Norwalk 9
Phoenix 9
Porto Alegre 9
Redwood City 9
Turin 9
Guangzhou 8
Hefei 8
Brooklyn 7
Curitiba 7
San Francisco 7
Selvazzano Dentro 7
Tashkent 7
Atlanta 6
Florence 6
Indiana 6
Kuala Lumpur 6
Lappeenranta 6
Queens 6
Salvador 6
University Park 6
Warsaw 6
Boardman 5
Boston 5
Dhaka 5
Dubai 5
Erbil 5
Haiphong 5
Hangzhou 5
Jeddah 5
Las Vegas 5
Manaus 5
Nanchang 5
Orem 5
Philadelphia 5
Salt Lake City 5
Augusta 4
Baghdad 4
Changsha 4
Denver 4
Des Moines 4
Fuzhou 4
Glendale 4
Guayaquil 4
Karlsruhe 4
Miami 4
Totale 19.713
Salva come PNG Salva come JPEG
Nome #
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 627
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems 512
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 511
A faster computation of all the best swap edges of a tree spanner 501
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 485
Bounded-Distance Network Creation Games 482
Specializations and generalizations of the Stackelberg minimum spanning tree game 472
Dynamic mechanism design 468
Computational aspects of a 2-player Stackelberg shortest paths tree game 467
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem 460
Locating Facilities on a Network to Minimize Their Average Service Radius 460
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 452
Reducing the diameter of a unit disk graph via node addition 448
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 445
Network verification via routing table queries 445
Locality-based network creation games 444
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 442
Bejeweled, Candy Crush and other match-three games are (NP-)hard 440
Stability of Networks in Stretchable Graphs 439
Improved approximability and non-approximability results for graph diameter decreasing problems 437
Network Verification via Routing Table Queries 435
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 435
The Max-Distance Network Creation Game on General Host Graphs 434
On stackelberg pricing with computationally bounded customers 424
Polygon-Constrained Motion Planning Problems 417
Locality-based network creation games 412
Multiple-edge-fault-tolerant approximate shortest-path trees 409
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem 408
Bounded-Distance Network Creation Games 404
Network Creation Games with Traceroute-Based Strategies 402
Improved purely additive fault-tolerant spanners 401
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 398
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 386
An algorithm composition scheme preserving monotonicity 380
On Stackelberg Pricing with Computationally Bounded Consumers 378
Rational Fair Consensus in the Gossip Model 367
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals 366
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 355
Large peg-army maneuvers 350
Fault-Tolerant Approximate Shortest-Path Trees 350
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 349
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 300
Coalition Resilient Outcomes in Max k-Cut Games 299
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors 278
Compact and fast sensitivity oracles for single-source distances 274
Uniform-budget solo chess with only rooks or only knights is hard 271
Effcient oracles and routing schemes for replacement paths 249
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 237
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 232
Fault-Tolerant Approximate Shortest-Path Trees 221
Consensus vs broadcast, with and without noise 211
Hardness of an asymmetric 2-player Stackelberg Network Pricing Game 207
Swapping mixed-up beers to keep them cool 195
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 193
On the complexity of two dots for narrow boards and few colors 180
Cutting bamboo down to size 178
Tracking routes in communication networks 113
Cutting bamboo down to size 104
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 84
Tracking routes in communication networks 83
Network creation games with traceroute-based strategies 82
Blackout-Tolerant Temporal Spanners 73
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 67
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 63
Maintaining k-MinHash signatures over fully-dynamic data streams with recovery 61
Resilient level ancestor, bottleneck, and lowest Common ancestor queries in dynamic trees 61
New approximation algorithms for the heterogeneous weighted delivery problem 58
Graph spanners for group Steiner distances 55
Blackout-tolerant temporal spanners 51
Temporal queries for dynamic temporal forests 44
Finding Diameter-Reducing Shortcuts in Trees 43
Sparse Temporal Spanners with Low Stretch 42
Finding diameter-reducing shortcuts in trees 40
Almost Tight Oracles for Fastest-Path Queries on Temporal Trees 28
Uniform-budget solo chess with only rooks or only knights is hard 20
null 3
null 3
Totale 23.951
Salva come PNG Salva come JPEG
Categoria #
all - tutte 55.304
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 55.304
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022576 0 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/2027179 118 61 0 0 0 0 0 0 0 0 0 0
Totale 23.951