IRIS
BILÒ, Davide
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.527
AS - Asia 2.246
SA - Sud America 1.381
EU - Europa 1.280
AF - Africa 84
OC - Oceania 10
Continente sconosciuto - Info sul continente non disponibili 9
Totale 8.537
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.433
BR - Brasile 1.237
SG - Singapore 845
CN - Cina 753
UA - Ucraina 471
HK - Hong Kong 194
DE - Germania 185
SE - Svezia 156
VN - Vietnam 129
IT - Italia 118
FR - Francia 99
FI - Finlandia 65
GB - Regno Unito 54
IN - India 54
AR - Argentina 43
IQ - Iraq 35
TR - Turchia 35
CA - Canada 34
BD - Bangladesh 33
MX - Messico 32
RU - Federazione Russa 32
UZ - Uzbekistan 27
EC - Ecuador 25
ZA - Sudafrica 23
CO - Colombia 21
MA - Marocco 19
PL - Polonia 19
PK - Pakistan 18
VE - Venezuela 18
BE - Belgio 15
ES - Italia 15
KE - Kenya 14
SA - Arabia Saudita 14
ID - Indonesia 13
JO - Giordania 12
JP - Giappone 12
PE - Perù 12
AZ - Azerbaigian 10
NL - Olanda 9
AU - Australia 8
EU - Europa 8
NP - Nepal 8
PY - Paraguay 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
GE - Georgia 4
SV - El Salvador 4
SY - Repubblica araba siriana 4
AM - Armenia 3
BA - Bosnia-Erzegovina 3
BG - Bulgaria 3
CR - Costa Rica 3
DO - Repubblica Dominicana 3
GR - Grecia 3
HN - Honduras 3
LT - Lituania 3
MY - Malesia 3
OM - Oman 3
PH - Filippine 3
RO - Romania 3
AO - Angola 2
BW - Botswana 2
BY - Bielorussia 2
CH - Svizzera 2
CZ - Repubblica Ceca 2
JM - Giamaica 2
KG - Kirghizistan 2
KW - Kuwait 2
MN - Mongolia 2
NZ - Nuova Zelanda 2
PS - Palestinian Territory 2
RS - Serbia 2
TT - Trinidad e Tobago 2
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
IS - Islanda 1
KH - Cambogia 1
KR - Corea 1
LA - Repubblica Popolare Democratica del Laos 1
LU - Lussemburgo 1
MD - Moldavia 1
MT - Malta 1
Totale 8.530
Salva come PNG Salva come JPEG
Città #
Dallas 883
Singapore 450
Chandler 420
San Jose 346
Jacksonville 270
Hong Kong 188
Ashburn 161
Princeton 160
Beijing 139
Nanjing 111
São Paulo 95
Wilmington 79
Lauterbourg 68
Ann Arbor 62
Columbus 54
Council Bluffs 52
Dearborn 50
Shanghai 50
The Dalles 47
Santa Clara 46
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
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
Milan 13
Orem 13
Sorocaba 13
Campinas 12
Kunming 12
Zhengzhou 12
Amman 11
Campo Grande 11
Guarulhos 11
Guayaquil 11
Manaus 11
Santo André 11
Toronto 11
Ahmedabad 10
Brooklyn 10
Fairfield 10
Johannesburg 10
Juiz de Fora 10
Montreal 10
Phoenix 10
Bogotá 9
Hangzhou 9
Tokyo 9
Amsterdam 8
Atlanta 8
Baku 8
Dhaka 8
Frankfurt am Main 8
Haikou 8
Helsinki 8
Lima 8
London 8
Osasco 8
Paris 8
Americana 7
Ankara 7
Buffalo 7
Caracas 7
Da Nang 7
Fortaleza 7
Houston 7
Joinville 7
Maceió 7
Recife 7
Stockholm 7
São José do Rio Preto 7
Uberlândia 7
Totale 4.957
Salva come PNG Salva come JPEG
Nome #
Bounded-distance network creation games 160
Efficient oracles and routing schemes for replacement paths 154
A novel algorithm for the all-best-swap-edge problem on tree spanners 151
A faster computation of all the best swap edges of a shortest paths tree 149
Approximate mechanisms for the graphical TSP and other graph-traversal problems 149
Finding the best swap edges minimizing the routing cost of a spanning tree 144
Fault-tolerant approximate shortest-path trees 143
An improved algorithm for computing all the best swap edges of a tree spanner 143
A faster computation of all the best swap edges of a shortest paths tree 141
Almost optimal algorithms for diameter-optimally augmenting trees 140
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game 136
Bounded-distance network creation game 136
A 13/10-approximation Algorithm for Minimum-size 2-Vertex-connectivity of Hamiltonian Graphs 135
New algorithms for Steiner tree reoptimization 135
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 134
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 134
Augmenting the Edge-Connectivity of a Spider Tree 131
A Faster Computation of All the Best Swap Edges of a Tree Spanner 130
Dynamic mechanism design 128
Approximating the Metric TSP in Linear Time 127
Network Verification via Routing Table Queries 125
New bounds for the balloon popping problem 125
Cutting bamboo down to size 125
An algorithm composition scheme preserving monotonicity 124
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path 124
Compact and Fast Sensitivity Oracles for Single-Source Distances 123
New advances in reoptimizing the minimum Steiner tree problem 122
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 121
Approximating the Metric TSP in Linear Time 117
Range Augmentation Problems in Static Ad-Hoc Wireless Networks 116
Locality-Based Network Creation Games 113
On the complexity of two dots for narrow boards and few colors 112
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 111
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 109
Specializations and generalizations of the Stackelberg minimum spanning tree game 107
Fault-Tolerant Approximate Shortest-Path Trees 107
Near-optimal deterministic single-source distance sensitivity oracles 105
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 103
Discovery of Network Properties with All-Shortest-Paths Queries 103
Space-Efficient Fault-Tolerant Diameter Oracles 102
The max-distance network creation game on general host graphs 102
On the tree conjecture for the network creation game 100
The max-distance network creation game on general host graphs 99
Reconstructing visibility graphs with simple robots 99
Discovery of network properties with all-shortest-paths queries 99
Multiple-edge-fault-tolerant approximate shortest-path trees 99
Reoptimization of the Shortest Common Superstring Problem 98
Polygon-constrained motion planning problems 98
Reoptimization of Weighted Graph and Covering Problems 96
Topological influence and locality in swap schelling games 96
Locating Facilities on a Network to Minimize Their Average Service Radius 95
Improved approximability and non-approximability results for graph diameter decreasing problems 95
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 95
Locality-based network creation game 95
Reconstructing Visibility Graphs with Simple Robots 94
Reoptimization of the Shortest Common Superstring Problem 93
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game 91
Improved Purely Additive Fault-Tolerant Spanners 91
New bounds for the balloon popping problem 89
Exact and approximate algorithms for movement problems on (special classes of) graphs 89
New reoptimization techniques applied to Steiner tree problem 88
On the complexity of minimizing interference in ad-hoc and sensor networks 88
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 87
Network creation games with traceroute-based strategies 87
Improved approximability and non-approximability results for graph diameter decreasing problems 86
Geometric network creation games 83
Exact and approximate algorithms for movement problems on (special classes of) graphs 81
Fair tree connection games with topology-dependent edge cost 80
Network creation games with traceroute-based strategies 78
Tracking routes in communication networks 78
Hardness of an asymmetric 2-player stackelberg network pricing game 76
Finding best swap edges minimizing the routing cost of a spanning tree 75
Reoptimization of Steiner Trees 75
Dynamic Mechanism Design 73
Tracking routes in communication networks 72
Stability of Networks in Stretchable Graphs 71
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 68
Network verification via routing table queries 68
On the Tree Conjecture for the Network Creation Game 63
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 62
Selfish Creation of Social Networks 41
Totale 8.587
Salva come PNG Salva come JPEG
Categoria #
all - tutte 36.381
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 36.381
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202112 0 0 0 0 0 0 0 0 0 0 0 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/20263.020 116 829 305 392 207 184 441 87 125 270 61 3
Totale 8.587