IRIS
LEUCCI, STEFANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.210
AS - Asia 1.763
EU - Europa 1.602
SA - Sud America 289
Continente sconosciuto - Info sul continente non disponibili 94
AF - Africa 36
OC - Oceania 3
Totale 6.997
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.136
SG - Singapore 850
IE - Irlanda 403
RU - Federazione Russa 345
CN - Cina 301
IT - Italia 269
BR - Brasile 240
VN - Vietnam 141
HK - Hong Kong 139
TR - Turchia 138
DE - Germania 132
SE - Svezia 85
GB - Regno Unito 82
UA - Ucraina 63
FI - Finlandia 62
FR - Francia 58
CA - Canada 47
BD - Bangladesh 46
IN - India 40
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
VE - Venezuela 7
AE - Emirati Arabi Uniti 6
LT - Lituania 6
EC - Ecuador 5
PK - Pakistan 5
CO - Colombia 4
CZ - Repubblica Ceca 4
JO - Giordania 4
KE - Kenya 4
KR - Corea 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
MA - Marocco 3
NO - Norvegia 3
NP - Nepal 3
PE - Perù 3
PT - Portogallo 3
QA - Qatar 3
RS - Serbia 3
SC - Seychelles 3
TN - Tunisia 3
A2 - ???statistics.table.value.countryCode.A2??? 2
AU - Australia 2
BH - Bahrain 2
CR - Costa Rica 2
DK - Danimarca 2
EG - Egitto 2
GE - Georgia 2
KG - Kirghizistan 2
KW - Kuwait 2
KZ - Kazakistan 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
BZ - Belize 1
CG - Congo 1
CI - Costa d'Avorio 1
CV - Capo Verde 1
DZ - Algeria 1
EU - Europa 1
GR - Grecia 1
GT - Guatemala 1
GY - Guiana 1
IL - Israele 1
IR - Iran 1
IS - Islanda 1
JM - Giamaica 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
Totale 6.905
Salva come PNG Salva come JPEG
Città #
Singapore 471
San Jose 413
Dublin 403
Chandler 301
Dallas 281
Ashburn 267
Jacksonville 245
Santa Clara 155
Hong Kong 135
The Dalles 121
Council Bluffs 100
New York 94
Boardman 93
Izmir 67
Milan 62
Moscow 55
Lawrence 52
Princeton 52
Ho Chi Minh City 50
Nanjing 50
Los Angeles 49
Munich 49
Wilmington 48
Columbus 44
Rome 42
San Mateo 33
Hanoi 29
Beijing 28
Lauterbourg 27
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
Atlanta 13
Cedar Knolls 13
Turku 12
Brooklyn 11
Johannesburg 11
Montreal 11
Phoenix 11
Seattle 11
Tianjin 11
Chicago 10
Denver 10
Kunming 10
Poplar 10
Chennai 9
Falkenstein 9
Lappeenranta 9
London 9
Manchester 9
Mountain View 9
Shanghai 9
Ann Arbor 8
Brasília 8
Brussels 8
Charlotte 8
Guangzhou 8
Hefei 8
L’Aquila 8
Altoona 7
Bresso 7
Da Nang 7
Frankfurt am Main 7
Lissone 7
North Bergen 7
Pittsburgh 7
San Francisco 7
Springfield 7
Turin 7
Verona 7
Washington 7
Ankara 6
Centrale 6
Changsha 6
Curitiba 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
Prineville 6
Santiago 6
Toronto 6
Belo Horizonte 5
Campinas 5
Changchun 5
Jeddah 5
Jinan 5
Totale 4.486
Salva come PNG Salva come JPEG
Nome #
Exact and approximate algorithms for movement problems on (special classes of) graphs 155
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 151
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 150
On the clustered shortest-path tree problem 143
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 135
Network creation games with traceroute-based strategies 134
Fault-Tolerant Approximate Shortest-Path Trees 132
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 131
Effcient oracles and routing schemes for replacement paths 130
Dual-mode greedy algorithms can save energy 130
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 129
Approximate Minimum Selection with Unreliable Comparisons 128
Compact and fast sensitivity oracles for single-source distances 125
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 125
Optimal Dislocation with Persistent Errors in Subquadratic Time 125
Fault-Tolerant Approximate Shortest-Path Trees 124
A faster computation of all the best swap edges of a tree spanner 124
Faster motif counting via succinct color coding and adaptive sampling 123
The Max-Distance Network Creation Game on General Host Graphs 120
Multiple-edge-fault-tolerant approximate shortest-path trees 120
Cutting bamboo down to size 118
Cutting Bamboo Down to Size 117
Optimal sorting with persistent comparison errors 117
Network Creation Games with Traceroute-Based Strategies 117
An improved algorithm for computing all the best swap edges of a tree spanner 115
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 114
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 114
Improved Purely Additive Fault-Tolerant Spanners 113
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 109
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 109
Tracking Routes in Communication Networks 108
Locality-based Network Creation Games 108
Path-Fault-Tolerant Approximate Shortest-Path Trees 107
The max-distance network creation game on general host graphs 107
Dynamically Maintaining Shortest Path Trees under Batches of Updates 105
Finding diameter-reducing shortcuts in trees 105
Locality-Based Network Creation Games 104
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 104
Graph Spanners for Group Steiner Distances 98
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 97
Optimal dislocation with persistent errors in subquadratic time 92
Tracking routes in communication networks 91
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 90
Resilient dictionaries for randomly unreliable memory 89
On the complexity of two dots for narrow boards and few colors 89
Bejeweled, candy crush and other match-three games are (NP-)hard 89
Blackout-Tolerant Temporal Spanners 88
Motif counting beyond five nodes 88
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 86
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling 86
Tracks from hell — When finding a proof may be easier than checking it 86
New approximation algorithms for the heterogeneous weighted delivery problem 84
On the Approximability of Graph Visibility Problems 82
Sparse Temporal Spanners with Low Stretch 80
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper) 77
Tracks from hell - When finding a proof may be easier than checking it 77
Blackout-tolerant temporal spanners 76
Trainyard is NP-hard 75
Trainyard is NP-Hard 74
No truthful mechanism can be better than n approximate for two natural problems 73
Swapping Mixed-Up Beers to Keep Them Cool 70
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard 70
Temporal Queries for Dynamic Temporal Forests 67
Finding Diameter-Reducing Shortcuts in Trees 65
Sorting with recurrent comparison errors 59
Almost Tight Oracles for Fastest-Path Queries on Temporal Trees 37
On the (In)Approximability of the Monitoring Edge Geodetic Set Problem 36
Counting Graphlets: Space vs Time 30
The limits of popularity-based recommendations, and the role of social ties 30
Uniform-budget solo chess with only rooks or only knights is hard 30
On the approximability of graph visibility problems 11
Totale 6.997
Salva come PNG Salva come JPEG
Categoria #
all - tutte 30.003
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 30.003
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022226 0 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/2027182 109 73 0 0 0 0 0 0 0 0 0 0
Totale 6.997