IRIS
LEUCCI, STEFANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.670
EU - Europa 1.949
AS - Asia 1.770
SA - Sud America 300
Continente sconosciuto - Info sul continente non disponibili 94
AF - Africa 37
OC - Oceania 3
Totale 7.823
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.574
SG - Singapore 855
IT - Italia 601
IE - Irlanda 403
RU - Federazione Russa 345
CN - Cina 302
BR - Brasile 248
VN - Vietnam 141
HK - Hong Kong 139
TR - Turchia 139
DE - Germania 132
GB - Regno Unito 89
SE - Svezia 85
UA - Ucraina 64
FI - Finlandia 62
FR - Francia 60
CA - Canada 59
BD - Bangladesh 46
IN - India 40
JP - Giappone 24
AR - Argentina 20
NL - Olanda 20
PL - Polonia 19
MX - Messico 15
ZA - Sudafrica 14
ES - Italia 12
IQ - Iraq 11
BE - Belgio 9
PH - Filippine 8
CL - Cile 7
ID - Indonesia 7
SA - Arabia Saudita 7
VE - Venezuela 7
AE - Emirati Arabi Uniti 6
CO - Colombia 6
LT - Lituania 6
EC - Ecuador 5
PK - Pakistan 5
CZ - Repubblica Ceca 4
EE - Estonia 4
HN - Honduras 4
JO - Giordania 4
KE - Kenya 4
KR - Corea 4
LB - Libano 4
MD - Moldavia 4
SC - Seychelles 4
UZ - Uzbekistan 4
AT - Austria 3
AZ - Azerbaigian 3
CH - Svizzera 3
CR - Costa Rica 3
DK - Danimarca 3
HU - Ungheria 3
MA - Marocco 3
NI - Nicaragua 3
NO - Norvegia 3
NP - Nepal 3
PE - Perù 3
PT - Portogallo 3
QA - Qatar 3
RS - Serbia 3
TN - Tunisia 3
A2 - ???statistics.table.value.countryCode.A2??? 2
AU - Australia 2
BB - Barbados 2
BH - Bahrain 2
BS - Bahamas 2
EG - Egitto 2
GE - Georgia 2
GT - Guatemala 2
JM - Giamaica 2
KG - Kirghizistan 2
KW - Kuwait 2
KZ - Kazakistan 2
PY - Paraguay 2
RO - Romania 2
SV - El Salvador 2
AL - Albania 1
AO - Angola 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
BO - Bolivia 1
BZ - Belize 1
CG - Congo 1
CI - Costa d'Avorio 1
CV - Capo Verde 1
DZ - Algeria 1
EU - Europa 1
GR - Grecia 1
GY - Guiana 1
IL - Israele 1
IR - Iran 1
IS - Islanda 1
LV - Lettonia 1
MW - Malawi 1
MY - Malesia 1
NE - Niger 1
OM - Oman 1
PR - Porto Rico 1
Totale 7.729
Salva come PNG Salva come JPEG
Città #
San Jose 492
Singapore 471
Dublin 403
Ashburn 368
Chandler 301
Dallas 282
Jacksonville 245
Council Bluffs 190
Santa Clara 165
Hong Kong 135
The Dalles 122
Milan 105
New York 95
Boardman 93
Staranzano 69
Izmir 67
Rome 67
Moscow 55
Lawrence 52
Princeton 52
Los Angeles 51
Ho Chi Minh City 50
Nanjing 50
Munich 49
Wilmington 48
Columbus 47
San Mateo 33
Beijing 29
Hanoi 29
Lauterbourg 27
L'aquila 26
Naples 25
São Paulo 25
Helsinki 22
Tokyo 22
Nanchang 19
Phoenix 17
Orem 16
Shenyang 16
Warsaw 16
Amsterdam 15
Stockholm 15
Turin 15
Atlanta 14
Des Moines 14
Cedar Knolls 13
Chicago 13
Denver 13
Miano 13
Montreal 13
Brooklyn 12
North Bergen 12
San Francisco 12
Turku 12
Johannesburg 11
Seattle 11
Tianjin 11
Charlotte 10
Kunming 10
Manchester 10
Poplar 10
Bologna 9
Brasília 9
Chennai 9
Falkenstein 9
Lappeenranta 9
London 9
Mountain View 9
Shanghai 9
Verona 9
Ann Arbor 8
Brussels 8
Guangzhou 8
Hefei 8
L’Aquila 8
Springfield 8
Altoona 7
Bresso 7
Da Nang 7
Frankfurt am Main 7
Lissone 7
Pittsburgh 7
Toronto 7
Washington 7
Ankara 6
Catania 6
Centrale 6
Changsha 6
Curitiba 6
Dhaka 6
Dong Ket 6
Falls Church 6
Florence 6
Garland 6
Houston 6
Hải Dương 6
Los Lunas 6
Mumbai 6
Ottawa 6
Prineville 6
Totale 4.986
Salva come PNG Salva come JPEG
Nome #
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 167
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 166
Exact and approximate algorithms for movement problems on (special classes of) graphs 166
On the clustered shortest-path tree problem 159
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 154
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 145
Effcient oracles and routing schemes for replacement paths 144
Network creation games with traceroute-based strategies 144
Fault-Tolerant Approximate Shortest-Path Trees 143
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 142
Dual-mode greedy algorithms can save energy 141
Faster motif counting via succinct color coding and adaptive sampling 138
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 138
Approximate Minimum Selection with Unreliable Comparisons 137
A faster computation of all the best swap edges of a tree spanner 135
Optimal Dislocation with Persistent Errors in Subquadratic Time 134
Optimal sorting with persistent comparison errors 134
Compact and fast sensitivity oracles for single-source distances 133
Fault-Tolerant Approximate Shortest-Path Trees 132
Multiple-edge-fault-tolerant approximate shortest-path trees 132
The Max-Distance Network Creation Game on General Host Graphs 130
Cutting bamboo down to size 130
Cutting Bamboo Down to Size 127
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 126
An improved algorithm for computing all the best swap edges of a tree spanner 126
Network Creation Games with Traceroute-Based Strategies 126
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 126
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 123
Improved Purely Additive Fault-Tolerant Spanners 123
Path-Fault-Tolerant Approximate Shortest-Path Trees 123
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 121
Tracking Routes in Communication Networks 118
Locality-based Network Creation Games 118
Finding diameter-reducing shortcuts in trees 117
Locality-Based Network Creation Games 116
The max-distance network creation game on general host graphs 115
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 114
Dynamically Maintaining Shortest Path Trees under Batches of Updates 113
Graph Spanners for Group Steiner Distances 107
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 106
Bejeweled, candy crush and other match-three games are (NP-)hard 106
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 105
Blackout-Tolerant Temporal Spanners 101
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 101
Tracking routes in communication networks 101
Optimal dislocation with persistent errors in subquadratic time 101
Resilient dictionaries for randomly unreliable memory 100
Sparse Temporal Spanners with Low Stretch 99
Tracks from hell — When finding a proof may be easier than checking it 99
On the complexity of two dots for narrow boards and few colors 99
Motif counting beyond five nodes 99
On the Approximability of Graph Visibility Problems 96
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling 96
New approximation algorithms for the heterogeneous weighted delivery problem 93
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper) 92
Trainyard is NP-hard 89
No truthful mechanism can be better than n approximate for two natural problems 87
Blackout-tolerant temporal spanners 86
Tracks from hell - When finding a proof may be easier than checking it 86
Swapping Mixed-Up Beers to Keep Them Cool 82
Trainyard is NP-Hard 82
Temporal Queries for Dynamic Temporal Forests 80
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard 78
Finding Diameter-Reducing Shortcuts in Trees 74
Sorting with recurrent comparison errors 69
Almost Tight Oracles for Fastest-Path Queries on Temporal Trees 48
On the (In)Approximability of the Monitoring Edge Geodetic Set Problem 47
The limits of popularity-based recommendations, and the role of social ties 41
Counting Graphlets: Space vs Time 38
Uniform-budget solo chess with only rooks or only knights is hard 36
On the approximability of graph visibility problems 23
Totale 7.823
Salva come PNG Salva come JPEG
Categoria #
all - tutte 32.174
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 32.174
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022191 0 0 0 12 16 5 12 19 17 10 14 86
2022/20231.036 59 52 16 94 64 100 1 80 495 6 49 20
2023/2024244 35 15 20 23 27 93 3 2 0 16 4 6
2024/20251.541 83 43 93 75 188 116 187 172 263 92 99 130
2025/20262.832 106 249 229 362 332 222 356 95 226 455 142 58
2026/20271.008 109 111 291 497 0 0 0 0 0 0 0 0
Totale 7.823