GUALA', LUCIANO
 Distribuzione geografica
Continente #
NA - Nord America 17.976
AS - Asia 2.173
EU - Europa 1.194
SA - Sud America 297
AF - Africa 19
Continente sconosciuto - Info sul continente non disponibili 6
OC - Oceania 4
Totale 21.669
Nazione #
US - Stati Uniti d'America 17.949
SG - Singapore 1.531
BR - Brasile 270
CN - Cina 260
UA - Ucraina 218
IT - Italia 200
HK - Hong Kong 193
IE - Irlanda 167
DE - Germania 145
RU - Federazione Russa 117
FR - Francia 98
GB - Regno Unito 63
FI - Finlandia 58
SE - Svezia 54
VN - Vietnam 45
KR - Corea 44
PL - Polonia 23
JP - Giappone 19
NL - Olanda 18
BD - Bangladesh 15
IN - India 15
CH - Svizzera 13
CA - Canada 11
IQ - Iraq 11
KE - Kenya 8
AR - Argentina 7
MX - Messico 6
TR - Turchia 6
ZA - Sudafrica 6
AT - Austria 5
ID - Indonesia 5
VE - Venezuela 5
CO - Colombia 4
MY - Malesia 4
RO - Romania 4
UZ - Uzbekistan 4
AU - Australia 3
CL - Cile 3
EC - Ecuador 3
EG - Egitto 3
ES - Italia 3
EU - Europa 3
HN - Honduras 3
PK - Pakistan 3
AE - Emirati Arabi Uniti 2
BE - Belgio 2
BO - Bolivia 2
DO - Repubblica Dominicana 2
IL - Israele 2
JO - Giordania 2
NI - Nicaragua 2
PH - Filippine 2
PS - Palestinian Territory 2
PY - Paraguay 2
SA - Arabia Saudita 2
A1 - Anonimo 1
A2 - ???statistics.table.value.countryCode.A2??? 1
AL - Albania 1
AM - Armenia 1
AZ - Azerbaigian 1
BB - Barbados 1
CZ - Repubblica Ceca 1
DK - Danimarca 1
HR - Croazia 1
IR - Iran 1
JM - Giamaica 1
LK - Sri Lanka 1
LT - Lituania 1
LY - Libia 1
MA - Marocco 1
MD - Moldavia 1
MN - Mongolia 1
NP - Nepal 1
PW - Palau 1
SV - El Salvador 1
UY - Uruguay 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 21.669
Città #
Woodbridge 5.048
Wilmington 4.828
Houston 4.613
Fairfield 574
Ann Arbor 403
Singapore 328
Ashburn 295
Seattle 254
Chandler 231
Cambridge 204
Jacksonville 194
Hong Kong 192
Dublin 166
Medford 141
Dearborn 129
Beijing 123
Rome 68
Lawrence 64
Santa Clara 57
Los Angeles 51
New York 40
The Dalles 39
San Diego 34
Buffalo 30
Moscow 29
Menlo Park 24
São Paulo 22
Dallas 19
Milan 19
Mülheim 19
Ho Chi Minh City 17
Kraków 17
London 17
Redondo Beach 16
Columbus 15
Mountain View 15
Hanoi 13
Nuremberg 12
Nanjing 11
Tokyo 11
Belo Horizonte 9
Brasília 9
Council Bluffs 9
Helsinki 9
Kunming 9
Norwalk 9
Redwood City 9
Rio de Janeiro 9
Guangzhou 8
Hefei 8
Nairobi 8
Porto Alegre 8
San Francisco 7
Selvazzano Dentro 7
Amsterdam 6
Brooklyn 6
Curitiba 6
Indiana 6
Salvador 6
University Park 6
Warsaw 6
Hangzhou 5
Lappeenranta 5
Manaus 5
Nanchang 5
Turin 5
Boardman 4
Changsha 4
Dhaka 4
Fuzhou 4
Kuala Lumpur 4
Novoli 4
Stockholm 4
Toronto 4
Zhengzhou 4
Andover 3
Atlanta 3
Augusta 3
Baghdad 3
Bagé 3
Baotou 3
Boston 3
Campinas 3
Chicago 3
Da Nang 3
Doncaster 3
Falls Church 3
Florence 3
Guayaquil 3
Hamburg 3
Huskvarna 3
Jinan 3
Juiz de Fora 3
Kilburn 3
Munich 3
New Delhi 3
Orem 3
Ottaviano 3
Palermo 3
Piracicaba 3
Totale 18.678
Nome #
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 609
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems 473
A faster computation of all the best swap edges of a tree spanner 470
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 466
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 458
Specializations and generalizations of the Stackelberg minimum spanning tree game 450
Bounded-Distance Network Creation Games 445
Computational aspects of a 2-player Stackelberg shortest paths tree game 444
Locating Facilities on a Network to Minimize Their Average Service Radius 439
Dynamic mechanism design 438
Exact and approximate algorithms for movement problems on (special classes of) graphs 432
Dynamic Mechanism Design 430
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem 429
Network verification via routing table queries 426
The max-distance network creation game on general host graphs 426
Reducing the diameter of a unit disk graph via node addition 425
The Max-Distance Network Creation Game on General Host Graphs 424
Stability of Networks in Stretchable Graphs 423
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 422
Bejeweled, Candy Crush and other match-three games are (NP-)hard 421
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 419
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 419
Locality-based network creation games 411
On stackelberg pricing with computationally bounded customers 410
Polygon-Constrained Motion Planning Problems 408
Network Verification via Routing Table Queries 406
Locality-based network creation games 399
Improved approximability and non-approximability results for graph diameter decreasing problems 398
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem 395
Network Creation Games with Traceroute-Based Strategies 385
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 381
Bounded-Distance Network Creation Games 378
Multiple-edge-fault-tolerant approximate shortest-path trees 378
Improved purely additive fault-tolerant spanners 374
An algorithm composition scheme preserving monotonicity 362
On Stackelberg Pricing with Computationally Bounded Consumers 361
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals 346
Rational Fair Consensus in the Gossip Model 345
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 344
Fault-Tolerant Approximate Shortest-Path Trees 335
Large peg-army maneuvers 333
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 330
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 328
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 324
An improved algorithm for computing all the best swap edges of a tree spanner 280
Brief announcement: On the parallel undecided-state dynamics with two colors 273
Coalition Resilient Outcomes in Max k-Cut Games 272
Compact and fast sensitivity oracles for single-source distances 259
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors 237
Uniform-budget solo chess with only rooks or only knights is hard 234
Effcient oracles and routing schemes for replacement paths 229
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 217
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 205
Fault-Tolerant Approximate Shortest-Path Trees 202
Hardness of an asymmetric 2-player Stackelberg Network Pricing Game 185
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 174
Consensus vs broadcast, with and without noise 166
On the complexity of two dots for narrow boards and few colors 161
Cutting bamboo down to size 157
Swapping mixed-up beers to keep them cool 129
Tracking routes in communication networks 103
Tracking routes in communication networks 65
Network creation games with traceroute-based strategies 63
Cutting bamboo down to size 59
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 54
Blackout-Tolerant Temporal Spanners 51
Resilient level ancestor, bottleneck, and lowest Common ancestor queries in dynamic trees 43
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 43
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 41
New approximation algorithms for the heterogeneous weighted delivery problem 31
Sparse Temporal Spanners with Low Stretch 30
Blackout-tolerant temporal spanners 29
Finding Diameter-Reducing Shortcuts in Trees 27
Graph spanners for group Steiner distances 26
Temporal queries for dynamic temporal forests 23
Totale 21.987
Categoria #
all - tutte 48.345
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 48.345


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20211.306 0 0 0 0 0 381 370 288 61 64 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/2026855 146 96 260 165 152 36 0 0 0 0 0 0
Totale 21.987