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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021173 0 0 0 0 0 5 35 1 48 17 56 11
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/20261.467 106 249 229 362 332 189 0 0 0 0 0 0
Totale 5.450