IRIS
GUALA', LUCIANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 17.593
EU - Europa 936
AS - Asia 539
Continente sconosciuto - Info sul continente non disponibili 5
SA - Sud America 5
OC - Oceania 1
Totale 19.079
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 17.590
SG - Singapore 295
UA - Ucraina 216
CN - Cina 181
IE - Irlanda 166
DE - Germania 135
IT - Italia 98
FR - Francia 97
SE - Svezia 51
GB - Regno Unito 50
FI - Finlandia 48
KR - Corea 42
RU - Federazione Russa 41
PL - Polonia 17
JP - Giappone 9
NL - Olanda 6
BR - Brasile 4
RO - Romania 4
AT - Austria 3
CA - Canada 3
EU - Europa 3
IN - India 3
VN - Vietnam 2
A1 - Anonimo 1
A2 - ???statistics.table.value.countryCode.A2??? 1
AM - Armenia 1
AU - Australia 1
BE - Belgio 1
CH - Svizzera 1
CL - Cile 1
DK - Danimarca 1
HK - Hong Kong 1
IL - Israele 1
IQ - Iraq 1
IR - Iran 1
MD - Moldavia 1
MY - Malesia 1
PH - Filippine 1
Totale 19.079
Salva come PNG Salva come JPEG
Città #
Woodbridge 5.048
Wilmington 4.828
Houston 4.611
Fairfield 574
Ann Arbor 403
Singapore 265
Seattle 253
Ashburn 252
Chandler 231
Cambridge 203
Jacksonville 194
Dublin 166
Medford 141
Dearborn 129
Beijing 93
Lawrence 64
Santa Clara 56
Rome 43
San Diego 34
New York 32
Moscow 29
Menlo Park 24
Mülheim 19
Kraków 17
Milan 16
Mountain View 15
Nanjing 11
London 10
Kunming 9
Norwalk 9
Redwood City 9
Hefei 8
Indiana 6
Nuremberg 6
University Park 6
Guangzhou 5
Nanchang 5
Boardman 4
Changsha 4
Fuzhou 4
Hangzhou 4
San Francisco 4
Andover 3
Baotou 3
Doncaster 3
Falls Church 3
Florence 3
Helsinki 3
Huskvarna 3
Kilburn 3
Munich 3
Saint Petersburg 3
Seoul 3
Verona 3
Yellow Springs 3
Zhengzhou 3
Amsterdam 2
Augusta 2
Bucharest 2
Chiswick 2
Clifton 2
Commerce 2
Dallas 2
Fremont 2
Hanoi 2
Islington 2
Jinan 2
Kyiv 2
Manchester 2
New Bedfont 2
Nishiikebukuro 2
Paris 2
Quzhou 2
Shenyang 2
São Paulo 2
Toronto 2
Velletri 2
Achim 1
Aquila 1
Basra 1
Brussels 1
Calamba 1
Central 1
Chengdu 1
Chisinau 1
Chiyoda-ku 1
Fort Myers 1
Groningen 1
Halle 1
Hamm 1
Hanover 1
Hebei 1
Hittisau 1
Hounslow 1
Jiaxing 1
Karis 1
Kennesaw 1
Kuala Lumpur 1
Kyoto 1
Lanzhou 1
Totale 17.951
Salva come PNG Salva come JPEG
Nome #
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 449
A faster computation of all the best swap edges of a tree spanner 446
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 433
Bounded-Distance Network Creation Games 425
Locating Facilities on a Network to Minimize Their Average Service Radius 421
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems 420
Specializations and generalizations of the Stackelberg minimum spanning tree game 417
Dynamic mechanism design 416
Exact and approximate algorithms for movement problems on (special classes of) graphs 416
Dynamic Mechanism Design 413
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 411
Reducing the diameter of a unit disk graph via node addition 411
Computational aspects of a 2-player Stackelberg shortest paths tree game 408
Stability of Networks in Stretchable Graphs 408
Network verification via routing table queries 406
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 403
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 397
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 394
On stackelberg pricing with computationally bounded customers 394
The max-distance network creation game on general host graphs 391
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem 390
The Max-Distance Network Creation Game on General Host Graphs 390
Polygon-Constrained Motion Planning Problems 389
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem 387
Locality-based network creation games 386
Network Verification via Routing Table Queries 383
Improved approximability and non-approximability results for graph diameter decreasing problems 378
Bejeweled, Candy Crush and other match-three games are (NP-)hard 372
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 369
Locality-based network creation games 369
Multiple-edge-fault-tolerant approximate shortest-path trees 358
Bounded-Distance Network Creation Games 354
Improved purely additive fault-tolerant spanners 352
Network Creation Games with Traceroute-Based Strategies 348
An algorithm composition scheme preserving monotonicity 342
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 329
On Stackelberg Pricing with Computationally Bounded Consumers 327
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals 322
Fault-Tolerant Approximate Shortest-Path Trees 321
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 315
Large peg-army maneuvers 314
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 309
Rational Fair Consensus in the Gossip Model 301
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 301
An improved algorithm for computing all the best swap edges of a tree spanner 258
Brief announcement: On the parallel undecided-state dynamics with two colors 244
Compact and fast sensitivity oracles for single-source distances 240
Coalition Resilient Outcomes in Max k-Cut Games 224
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors 208
Effcient oracles and routing schemes for replacement paths 205
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 194
Fault-Tolerant Approximate Shortest-Path Trees 184
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 166
On the complexity of two dots for narrow boards and few colors 147
Cutting bamboo down to size 140
Consensus vs broadcast, with and without noise 134
Tracking routes in communication networks 86
Cutting bamboo down to size 38
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 30
Tracking routes in communication networks 28
Resilient level ancestor, bottleneck, and lowest Common ancestor queries in dynamic trees 26
Blackout-Tolerant Temporal Spanners 19
Network creation games with traceroute-based strategies 19
New approximation algorithms for the heterogeneous weighted delivery problem 18
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 18
Hardness of an asymmetric 2-player Stackelberg Network Pricing Game 17
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 14
Sparse Temporal Spanners with Low Stretch 14
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 13
Finding Diameter-Reducing Shortcuts in Trees 10
Totale 19.379
Salva come PNG Salva come JPEG
Categoria #
all - tutte 36.416
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 36.416
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20204.594 0 0 410 563 462 597 483 490 488 402 330 369
2020/20213.102 353 373 341 397 332 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/2025505 63 289 153 0 0 0 0 0 0 0 0 0
Totale 19.379