IRIS
BILÒ, Davide
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.961
AS - Asia 1.886
SA - Sud America 1.328
EU - Europa 1.144
AF - Africa 71
Continente sconosciuto - Info sul continente non disponibili 9
OC - Oceania 8
Totale 7.407
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.884
BR - Brasile 1.203
SG - Singapore 766
CN - Cina 673
UA - Ucraina 468
DE - Germania 172
HK - Hong Kong 169
SE - Svezia 153
IT - Italia 108
FI - Finlandia 65
VN - Vietnam 53
GB - Regno Unito 42
AR - Argentina 40
IN - India 34
TR - Turchia 33
RU - Federazione Russa 31
CA - Canada 29
MX - Messico 24
IQ - Iraq 23
EC - Ecuador 22
FR - Francia 21
ZA - Sudafrica 21
UZ - Uzbekistan 20
BD - Bangladesh 19
CO - Colombia 18
MA - Marocco 17
BE - Belgio 15
PL - Polonia 15
VE - Venezuela 15
PK - Pakistan 14
KE - Kenya 11
JO - Giordania 10
ID - Indonesia 9
NL - Olanda 9
PE - Perù 9
AU - Australia 8
EU - Europa 8
PY - Paraguay 8
AZ - Azerbaigian 7
ES - Italia 7
KZ - Kazakistan 7
AL - Albania 6
DZ - Algeria 6
JP - Giappone 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.407
Salva come PNG Salva come JPEG
Città #
Dallas 882
Chandler 420
Singapore 407
Jacksonville 270
Hong Kong 169
Princeton 160
Beijing 126
Nanjing 111
São Paulo 90
Wilmington 79
Ashburn 72
Ann Arbor 62
Columbus 54
Dearborn 50
Shanghai 49
Boardman 43
The Dalles 43
Council Bluffs 42
Rio de Janeiro 42
Belo Horizonte 40
Nanchang 38
Santa Clara 35
Changsha 30
Ningbo 29
Brasília 28
Los Angeles 28
Tianjin 27
Shenyang 26
Woodbridge 26
Hebei 25
Sassari 24
Andover 19
Guangzhou 19
Jiaxing 17
New York 17
San Francisco 17
Tashkent 17
Jinan 16
Norwalk 16
Brussels 15
Curitiba 15
Ho Chi Minh City 15
Porto Alegre 15
Ribeirão Preto 15
Taizhou 15
Warsaw 14
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
Amsterdam 8
Haikou 8
Helsinki 8
Montreal 8
Osasco 8
Americana 7
Ankara 7
Baku 7
Bogotá 7
Brooklyn 7
Buffalo 7
Fortaleza 7
Houston 7
Joinville 7
Lima 7
London 7
Maceió 7
Recife 7
São José do Rio Preto 7
Asunción 6
Caxias do Sul 6
Lahore 6
Lanzhou 6
São Bernardo do Campo 6
Tappahannock 6
Tokyo 6
Uberlândia 6
Várzea Grande 6
Washington 6
Wuppertal 6
Aparecida de Goiânia 5
Betim 5
Totale 4.229
Salva come PNG Salva come JPEG
Nome #
Efficient oracles and routing schemes for replacement paths 141
Bounded-distance network creation games 135
A novel algorithm for the all-best-swap-edge problem on tree spanners 132
A faster computation of all the best swap edges of a shortest paths tree 129
Approximate mechanisms for the graphical TSP and other graph-traversal problems 129
Finding the best swap edges minimizing the routing cost of a spanning tree 129
A faster computation of all the best swap edges of a shortest paths tree 128
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 125
An improved algorithm for computing all the best swap edges of a tree spanner 124
Bounded-distance network creation game 124
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game 123
A 13/10-approximation Algorithm for Minimum-size 2-Vertex-connectivity of Hamiltonian Graphs 123
Almost optimal algorithms for diameter-optimally augmenting trees 123
Fault-tolerant approximate shortest-path trees 121
New algorithms for Steiner tree reoptimization 119
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 117
Augmenting the Edge-Connectivity of a Spider Tree 115
Cutting bamboo down to size 114
Network Verification via Routing Table Queries 113
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path 113
Dynamic mechanism design 111
New advances in reoptimizing the minimum Steiner tree problem 109
A Faster Computation of All the Best Swap Edges of a Tree Spanner 107
An algorithm composition scheme preserving monotonicity 107
New bounds for the balloon popping problem 106
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 104
Approximating the Metric TSP in Linear Time 104
Approximating the Metric TSP in Linear Time 103
Locality-Based Network Creation Games 101
Compact and Fast Sensitivity Oracles for Single-Source Distances 100
Range Augmentation Problems in Static Ad-Hoc Wireless Networks 99
On the complexity of two dots for narrow boards and few colors 98
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 95
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 95
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 91
On the tree conjecture for the network creation game 91
Specializations and generalizations of the Stackelberg minimum spanning tree game 90
Reconstructing visibility graphs with simple robots 90
Multiple-edge-fault-tolerant approximate shortest-path trees 90
Near-optimal deterministic single-source distance sensitivity oracles 88
Discovery of Network Properties with All-Shortest-Paths Queries 86
The max-distance network creation game on general host graphs 86
Locating Facilities on a Network to Minimize Their Average Service Radius 85
Reoptimization of the Shortest Common Superstring Problem 85
Reoptimization of the Shortest Common Superstring Problem 84
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 84
Fault-Tolerant Approximate Shortest-Path Trees 84
Locality-based network creation game 84
Discovery of network properties with all-shortest-paths queries 84
New reoptimization techniques applied to Steiner tree problem 83
Topological influence and locality in swap schelling games 83
Space-Efficient Fault-Tolerant Diameter Oracles 83
Polygon-constrained motion planning problems 83
The max-distance network creation game on general host graphs 82
Reconstructing Visibility Graphs with Simple Robots 82
Improved Purely Additive Fault-Tolerant Spanners 82
Improved approximability and non-approximability results for graph diameter decreasing problems 82
Reoptimization of Weighted Graph and Covering Problems 81
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game 80
New bounds for the balloon popping problem 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 75
Network creation games with traceroute-based strategies 75
Improved approximability and non-approximability results for graph diameter decreasing problems 73
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 73
Geometric network creation games 72
Exact and approximate algorithms for movement problems on (special classes of) graphs 71
Fair tree connection games with topology-dependent edge cost 68
Dynamic Mechanism Design 66
Network creation games with traceroute-based strategies 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 62
Stability of Networks in Stretchable Graphs 60
Hardness of an asymmetric 2-player stackelberg network pricing game 57
Network verification via routing table queries 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 35
Totale 7.457
Salva come PNG Salva come JPEG
Categoria #
all - tutte 32.303
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.303
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/20261.890 116 829 305 392 207 41 0 0 0 0 0 0
Totale 7.457