IRIS
BILÒ, Davide
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.039
AS - Asia 1.918
SA - Sud America 1.328
EU - Europa 1.154
AF - Africa 71
Continente sconosciuto - Info sul continente non disponibili 9
OC - Oceania 8
Totale 7.527
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.960
BR - Brasile 1.203
SG - Singapore 782
CN - Cina 683
UA - Ucraina 468
DE - Germania 172
HK - Hong Kong 170
SE - Svezia 156
IT - Italia 110
FI - Finlandia 65
VN - Vietnam 56
GB - Regno Unito 44
AR - Argentina 40
IN - India 34
TR - Turchia 33
RU - Federazione Russa 31
CA - Canada 30
MX - Messico 25
IQ - Iraq 23
EC - Ecuador 22
FR - Francia 21
ZA - Sudafrica 21
UZ - Uzbekistan 20
BD - Bangladesh 19
CO - Colombia 18
MA - Marocco 17
PL - Polonia 16
BE - Belgio 15
VE - Venezuela 15
PK - Pakistan 14
KE - Kenya 11
JO - Giordania 10
ES - Italia 9
ID - Indonesia 9
NL - Olanda 9
PE - Perù 9
AU - Australia 8
AZ - Azerbaigian 8
EU - Europa 8
PY - Paraguay 8
JP - Giappone 7
KZ - Kazakistan 7
AL - Albania 6
DZ - Algeria 6
UY - Uruguay 6
BO - Bolivia 5
NP - Nepal 5
PA - Panama 5
AE - Emirati Arabi Uniti 4
AT - Austria 4
EG - Egitto 4
GE - Georgia 4
LB - Libano 4
SV - El Salvador 4
BG - Bulgaria 3
CR - Costa Rica 3
DO - Repubblica Dominicana 3
GR - Grecia 3
GT - Guatemala 3
HN - Honduras 3
IL - Israele 3
OM - Oman 3
RO - Romania 3
TN - Tunisia 3
AM - Armenia 2
AO - Angola 2
BA - Bosnia-Erzegovina 2
BW - Botswana 2
BY - Bielorussia 2
CH - Svizzera 2
CL - Cile 2
CZ - Repubblica Ceca 2
JM - Giamaica 2
KG - Kirghizistan 2
KW - Kuwait 2
LT - Lituania 2
MN - Mongolia 2
MY - Malesia 2
PH - Filippine 2
RS - Serbia 2
SA - Arabia Saudita 2
SY - Repubblica araba siriana 2
BJ - Benin 1
BN - Brunei Darussalam 1
CI - Costa d'Avorio 1
GA - Gabon 1
HR - Croazia 1
HU - Ungheria 1
IE - Irlanda 1
IS - Islanda 1
KR - Corea 1
LU - Lussemburgo 1
MD - Moldavia 1
MT - Malta 1
MU - Mauritius 1
PS - Palestinian Territory 1
QA - Qatar 1
SN - Senegal 1
TT - Trinidad e Tobago 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 7.527
Salva come PNG Salva come JPEG
Città #
Dallas 883
Singapore 423
Chandler 420
Jacksonville 270
Hong Kong 170
Princeton 160
Beijing 126
Nanjing 111
Ashburn 91
São Paulo 90
Wilmington 79
Ann Arbor 62
Columbus 54
Dearborn 50
Shanghai 50
Boardman 43
The Dalles 43
Council Bluffs 42
Rio de Janeiro 42
Belo Horizonte 40
Nanchang 38
Santa Clara 37
Changsha 30
Los Angeles 30
Ningbo 29
Brasília 28
San Jose 28
Tianjin 28
Shenyang 26
Woodbridge 26
Hebei 25
Sassari 24
New York 22
Guangzhou 20
Andover 19
Jiaxing 17
San Francisco 17
Tashkent 17
Ho Chi Minh City 16
Jinan 16
Norwalk 16
Brussels 15
Curitiba 15
Porto Alegre 15
Ribeirão Preto 15
Taizhou 15
Warsaw 15
Contagem 13
Hanoi 13
Milan 13
Salvador 13
Campinas 12
Kunming 12
Sorocaba 12
Zhengzhou 12
Baghdad 11
Campo Grande 11
Guarulhos 11
Manaus 11
Nairobi 11
Santo André 11
Toronto 11
Ahmedabad 10
Amman 10
Fairfield 10
Guayaquil 10
Johannesburg 10
Juiz de Fora 10
Hangzhou 9
Montreal 9
Orem 9
Amsterdam 8
Baku 8
Brooklyn 8
Haikou 8
Helsinki 8
London 8
Osasco 8
Americana 7
Ankara 7
Bogotá 7
Buffalo 7
Fortaleza 7
Houston 7
Joinville 7
Lima 7
Maceió 7
Recife 7
Stockholm 7
São José do Rio Preto 7
Tokyo 7
Asunción 6
Atlanta 6
Caxias do Sul 6
Lahore 6
Lanzhou 6
São Bernardo do Campo 6
Tappahannock 6
Uberlândia 6
Várzea Grande 6
Totale 4.313
Salva come PNG Salva come JPEG
Nome #
Efficient oracles and routing schemes for replacement paths 142
Bounded-distance network creation games 138
A novel algorithm for the all-best-swap-edge problem on tree spanners 134
Approximate mechanisms for the graphical TSP and other graph-traversal problems 132
A faster computation of all the best swap edges of a shortest paths tree 131
Finding the best swap edges minimizing the routing cost of a spanning tree 131
A faster computation of all the best swap edges of a shortest paths tree 130
A 13/10-approximation Algorithm for Minimum-size 2-Vertex-connectivity of Hamiltonian Graphs 126
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 126
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game 125
An improved algorithm for computing all the best swap edges of a tree spanner 125
Almost optimal algorithms for diameter-optimally augmenting trees 125
Bounded-distance network creation game 125
Fault-tolerant approximate shortest-path trees 124
New algorithms for Steiner tree reoptimization 120
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 118
Augmenting the Edge-Connectivity of a Spider Tree 118
Network Verification via Routing Table Queries 117
Cutting bamboo down to size 114
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path 114
Dynamic mechanism design 112
A Faster Computation of All the Best Swap Edges of a Tree Spanner 110
New advances in reoptimizing the minimum Steiner tree problem 110
New bounds for the balloon popping problem 108
An algorithm composition scheme preserving monotonicity 108
Approximating the Metric TSP in Linear Time 107
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 106
Approximating the Metric TSP in Linear Time 104
Compact and Fast Sensitivity Oracles for Single-Source Distances 101
Locality-Based Network Creation Games 101
Range Augmentation Problems in Static Ad-Hoc Wireless Networks 100
On the complexity of two dots for narrow boards and few colors 99
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 98
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 97
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 94
Specializations and generalizations of the Stackelberg minimum spanning tree game 92
On the tree conjecture for the network creation game 92
Multiple-edge-fault-tolerant approximate shortest-path trees 92
Reconstructing visibility graphs with simple robots 91
The max-distance network creation game on general host graphs 90
Discovery of Network Properties with All-Shortest-Paths Queries 88
Near-optimal deterministic single-source distance sensitivity oracles 88
Reoptimization of the Shortest Common Superstring Problem 86
Locating Facilities on a Network to Minimize Their Average Service Radius 86
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 86
Fault-Tolerant Approximate Shortest-Path Trees 86
Reoptimization of the Shortest Common Superstring Problem 86
Locality-based network creation game 86
The max-distance network creation game on general host graphs 85
Discovery of network properties with all-shortest-paths queries 85
Polygon-constrained motion planning problems 85
Space-Efficient Fault-Tolerant Diameter Oracles 84
New reoptimization techniques applied to Steiner tree problem 83
Reoptimization of Weighted Graph and Covering Problems 83
Reconstructing Visibility Graphs with Simple Robots 83
Improved Purely Additive Fault-Tolerant Spanners 83
Improved approximability and non-approximability results for graph diameter decreasing problems 83
Topological influence and locality in swap schelling games 83
New bounds for the balloon popping problem 81
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game 81
Network creation games with traceroute-based strategies 78
On the complexity of minimizing interference in ad-hoc and sensor networks 77
Exact and approximate algorithms for movement problems on (special classes of) graphs 77
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 76
Improved approximability and non-approximability results for graph diameter decreasing problems 75
Geometric network creation games 74
Exact and approximate algorithms for movement problems on (special classes of) graphs 72
Fair tree connection games with topology-dependent edge cost 70
Network creation games with traceroute-based strategies 67
Dynamic Mechanism Design 66
Tracking routes in communication networks 66
Finding best swap edges minimizing the routing cost of a spanning tree 65
Reoptimization of Steiner Trees 65
Tracking routes in communication networks 63
Stability of Networks in Stretchable Graphs 60
Network verification via routing table queries 58
Hardness of an asymmetric 2-player stackelberg network pricing game 57
On the Tree Conjecture for the Network Creation Game 55
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 54
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 48
Selfish Creation of Social Networks 36
Totale 7.577
Salva come PNG Salva come JPEG
Categoria #
all - tutte 32.789
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.789
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021328 0 0 0 0 0 32 77 2 98 92 15 12
2021/2022430 61 5 1 4 4 5 29 26 31 52 43 169
2022/2023824 84 23 25 156 81 149 0 93 144 8 32 29
2023/2024119 36 16 4 5 16 3 1 2 0 2 11 23
2024/20252.490 8 51 146 35 73 85 207 577 834 255 145 74
2025/20262.010 116 829 305 392 207 161 0 0 0 0 0 0
Totale 7.577