IRIS
LEUCCI, STEFANO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1.589
EU - Europa 1.069
AS - Asia 872
SA - Sud America 147
AF - Africa 3
Continente sconosciuto - Info sul continente non disponibili 3
OC - Oceania 1
Totale 3.684
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.576
IE - Irlanda 401
SG - Singapore 385
IT - Italia 191
CN - Cina 190
RU - Federazione Russa 138
BR - Brasile 136
TR - Turchia 130
HK - Hong Kong 116
DE - Germania 74
SE - Svezia 73
UA - Ucraina 61
GB - Regno Unito 41
FI - Finlandia 40
FR - Francia 23
IN - India 15
CA - Canada 9
VN - Vietnam 8
BE - Belgio 7
AR - Argentina 5
BD - Bangladesh 5
EC - Ecuador 3
MD - Moldavia 3
MX - Messico 3
A2 - ???statistics.table.value.countryCode.A2??? 2
AE - Emirati Arabi Uniti 2
CH - Svizzera 2
CO - Colombia 2
DK - Danimarca 2
HU - Ungheria 2
IQ - Iraq 2
JO - Giordania 2
JP - Giappone 2
KG - Kirghizistan 2
NL - Olanda 2
NO - Norvegia 2
PK - Pakistan 2
RS - Serbia 2
AU - Australia 1
AZ - Azerbaigian 1
DZ - Algeria 1
ES - Italia 1
EU - Europa 1
GE - Georgia 1
GR - Grecia 1
IL - Israele 1
IR - Iran 1
KR - Corea 1
KZ - Kazakistan 1
LB - Libano 1
MA - Marocco 1
NI - Nicaragua 1
NP - Nepal 1
OM - Oman 1
PL - Polonia 1
PT - Portogallo 1
QA - Qatar 1
RO - Romania 1
UZ - Uzbekistan 1
VE - Venezuela 1
ZA - Sudafrica 1
Totale 3.684
Salva come PNG Salva come JPEG
Città #
Dublin 401
Chandler 301
Jacksonville 244
Singapore 229
Santa Clara 130
Hong Kong 116
Boardman 91
The Dalles 69
Izmir 66
New York 59
Lawrence 52
Princeton 52
Ashburn 50
Nanjing 50
Milan 49
Wilmington 48
Moscow 34
San Mateo 33
Rome 29
L'aquila 26
Helsinki 19
Los Angeles 19
Nanchang 19
Shenyang 16
Cedar Knolls 13
São Paulo 12
Council Bluffs 11
Tianjin 11
Falkenstein 10
Kunming 10
Des Moines 9
Mountain View 9
Seattle 9
Ann Arbor 8
Guangzhou 8
L’Aquila 8
Brussels 7
Dallas 7
Lissone 7
North Bergen 7
Centrale 6
Dong Ket 6
Falls Church 6
Munich 6
Shanghai 6
Verona 6
Washington 6
Brasília 5
Bresso 5
Changchun 5
Changsha 5
Jinan 5
Ottawa 5
Tappahannock 5
Belo Horizonte 4
Campinas 4
Guarulhos 4
Hebei 4
Pune 4
Venezia 4
Zhengzhou 4
Beijing 3
Curitiba 3
Edinburgh 3
London 3
Mumbai 3
Norwalk 3
Praia Grande 3
Stockholm 3
Woodbridge 3
Aquila 2
Assis 2
Atlanta 2
Belgrade 2
Belém 2
Berlin 2
Betim 2
Bishkek 2
Bologna 2
Bremen 2
Budapest 2
Cagliari 2
Cariacica 2
Chicago 2
Chisinau 2
Contagem 2
Copenhagen 2
Denver 2
Dhaka 2
Fremont 2
Houston 2
Istanbul 2
Jiaxing 2
Lanzhou 2
Lappeenranta 2
Lomas de Zamora 2
Miami 2
Mogi das Cruzes 2
Oslo 2
Ribeirão Preto 2
Totale 2.540
Salva come PNG Salva come JPEG
Nome #
Exact and approximate algorithms for movement problems on (special classes of) graphs 114
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 97
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 94
On the clustered shortest-path tree problem 93
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 88
The Max-Distance Network Creation Game on General Host Graphs 87
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 86
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 85
Network Creation Games with Traceroute-Based Strategies 84
Fault-Tolerant Approximate Shortest-Path Trees 83
Multiple-edge-fault-tolerant approximate shortest-path trees 83
An improved algorithm for computing all the best swap edges of a tree spanner 83
Fault-Tolerant Approximate Shortest-Path Trees 83
Compact and fast sensitivity oracles for single-source distances 81
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 81
A faster computation of all the best swap edges of a tree spanner 79
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 79
The max-distance network creation game on general host graphs 79
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 78
Dynamically Maintaining Shortest Path Trees under Batches of Updates 78
Locality-Based Network Creation Games 75
Dual-mode greedy algorithms can save energy 74
Approximate Minimum Selection with Unreliable Comparisons 74
Improved Purely Additive Fault-Tolerant Spanners 73
Effcient oracles and routing schemes for replacement paths 73
Locality-based Network Creation Games 72
Optimal sorting with persistent comparison errors 70
Path-Fault-Tolerant Approximate Shortest-Path Trees 69
Faster motif counting via succinct color coding and adaptive sampling 64
Cutting Bamboo Down to Size 63
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 59
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 56
Cutting bamboo down to size 56
Resilient dictionaries for randomly unreliable memory 55
Tracking Routes in Communication Networks 54
Network creation games with traceroute-based strategies 53
On the complexity of two dots for narrow boards and few colors 53
Tracking routes in communication networks 52
Optimal dislocation with persistent errors in subquadratic time 52
Tracks from hell — When finding a proof may be easier than checking it 51
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 50
Bejeweled, candy crush and other match-three games are (NP-)hard 49
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 49
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 48
Tracks from hell - When finding a proof may be easier than checking it 43
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling 42
No truthful mechanism can be better than n approximate for two natural problems 41
Trainyard is NP-hard 41
Optimal Dislocation with Persistent Errors in Subquadratic Time 40
Trainyard is NP-Hard 40
Blackout-Tolerant Temporal Spanners 38
Motif counting beyond five nodes 38
New approximation algorithms for the heterogeneous weighted delivery problem 38
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 37
Sparse Temporal Spanners with Low Stretch 36
Sorting with recurrent comparison errors 32
Blackout-tolerant temporal spanners 29
Finding Diameter-Reducing Shortcuts in Trees 22
Graph Spanners for Group Steiner Distances 20
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard 17
Swapping Mixed-Up Beers to Keep Them Cool 16
Temporal Queries for Dynamic Temporal Forests 15
null 13
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper) 7
Totale 3.764
Salva come PNG Salva come JPEG
Categoria #
all - tutte 19.135
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 19.135
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/202028 0 0 0 0 0 0 0 0 0 0 1 27
2020/2021291 9 34 6 35 34 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.322 83 43 93 75 188 116 189 175 264 93 3 0
Totale 3.764