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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022369 0 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/20263.050 116 829 305 392 207 184 441 87 125 270 61 33
2026/2027297 84 213 0 0 0 0 0 0 0 0 0 0
Totale 8.914