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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022231 5 12 23 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/20272 2 0 0 0 0 0 0 0 0 0 0 0
Totale 6.817