IRIS
BILÒ, Davide
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1.644
EU - Europa 987
AS - Asia 891
SA - Sud America 37
Continente sconosciuto - Info sul continente non disponibili 9
OC - Oceania 8
AF - Africa 2
Totale 3.578
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.627
CN - Cina 509
UA - Ucraina 452
SG - Singapore 208
DE - Germania 168
SE - Svezia 149
HK - Hong Kong 141
IT - Italia 74
FI - Finlandia 63
BR - Brasile 30
GB - Regno Unito 22
FR - Francia 20
IN - India 17
BE - Belgio 15
CA - Canada 15
AU - Australia 8
EU - Europa 8
RU - Federazione Russa 6
TR - Turchia 6
NL - Olanda 4
PL - Polonia 4
ES - Italia 2
IQ - Iraq 2
PE - Perù 2
AT - Austria 1
BD - Bangladesh 1
BG - Bulgaria 1
CH - Svizzera 1
CL - Cile 1
CO - Colombia 1
CZ - Repubblica Ceca 1
EC - Ecuador 1
IE - Irlanda 1
IL - Israele 1
JO - Giordania 1
KE - Kenya 1
KR - Corea 1
KW - Kuwait 1
LU - Lussemburgo 1
MX - Messico 1
PK - Pakistan 1
RO - Romania 1
RS - Serbia 1
SV - El Salvador 1
UY - Uruguay 1
UZ - Uzbekistan 1
VE - Venezuela 1
VN - Vietnam 1
XK - ???statistics.table.value.countryCode.XK??? 1
ZA - Sudafrica 1
Totale 3.578
Salva come PNG Salva come JPEG
Città #
Chandler 420
Jacksonville 270
Princeton 160
Singapore 152
Hong Kong 141
Nanjing 111
Wilmington 79
Ann Arbor 62
Dearborn 50
Shanghai 48
Boardman 43
Nanchang 38
Beijing 33
Ningbo 29
Santa Clara 28
Changsha 27
Shenyang 26
Woodbridge 26
Hebei 25
Sassari 24
Tianjin 20
Andover 19
Guangzhou 19
Jiaxing 17
Norwalk 16
Brussels 15
Jinan 15
Taizhou 15
Kunming 12
Zhengzhou 12
San Francisco 11
Ahmedabad 10
Fairfield 10
Toronto 10
Haikou 8
Helsinki 8
Ashburn 7
Houston 7
São Paulo 7
Hangzhou 6
Lanzhou 6
Tappahannock 6
Wuppertal 6
Paris 5
Dallas 4
Falls Church 4
Mountain View 4
Washington 4
Alghero 3
Amsterdam 3
Auburn Hills 3
Canberra 3
Changchun 3
Frankfurt am Main 3
Fuzhou 3
Hefei 3
Izmir 3
Melbourne 3
Warsaw 3
Bologna 2
Cagliari 2
Krasnoyarsk 2
La Spezia 2
Lima 2
Markham 2
Montréal 2
Redwood City 2
Saint Petersburg 2
Seattle 2
Sydney 2
Almere Stad 1
Amman 1
Arcoverde 1
Auburn 1
Azusa 1
Barcelona 1
Basra 1
Belgrade 1
Betim 1
Brno 1
Cambridge 1
Campo Grande 1
Caracas 1
Carapicuíba 1
Carmo do Paranaíba 1
Caxias do Sul 1
Centurion 1
Chengdu 1
Coaraci 1
Dublin 1
Figline Valdarno 1
Guayaquil 1
Haifa 1
Hanoi 1
Hanover 1
Horia 1
Huntington 1
Islamabad 1
Istanbul 1
Jinhua 1
Totale 2.160
Salva come PNG Salva come JPEG
Nome #
Bounded-distance network creation games 103
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game 89
Finding the best swap edges minimizing the routing cost of a spanning tree 82
Fault-tolerant approximate shortest-path trees 77
A faster computation of all the best swap edges of a shortest paths tree 67
New algorithms for Steiner tree reoptimization 65
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 65
New reoptimization techniques applied to Steiner tree problem 61
An improved algorithm for computing all the best swap edges of a tree spanner 60
Approximate mechanisms for the graphical TSP and other graph-traversal problems 60
Almost optimal algorithms for diameter-optimally augmenting trees 59
A 13/10-approximation Algorithm for Minimum-size 2-Vertex-connectivity of Hamiltonian Graphs 57
A novel algorithm for the all-best-swap-edge problem on tree spanners 57
Reconstructing visibility graphs with simple robots 56
A Faster Computation of All the Best Swap Edges of a Tree Spanner 55
Cutting bamboo down to size 54
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path 54
Reoptimization of the Shortest Common Superstring Problem 53
Compact and Fast Sensitivity Oracles for Single-Source Distances 52
Bounded-distance network creation game 52
Range Augmentation Problems in Static Ad-Hoc Wireless Networks 51
Network Verification via Routing Table Queries 51
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 51
On the complexity of two dots for narrow boards and few colors 51
New advances in reoptimizing the minimum Steiner tree problem 51
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 50
Locality-Based Network Creation Games 50
Reoptimization of Weighted Graph and Covering Problems 49
The max-distance network creation game on general host graphs 49
A faster computation of all the best swap edges of a shortest paths tree 48
Locality-based network creation game 48
Approximating the Metric TSP in Linear Time 48
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 47
Efficient oracles and routing schemes for replacement paths 47
Reoptimization of the Shortest Common Superstring Problem 46
Approximating the Metric TSP in Linear Time 46
Geometric network creation games 46
Discovery of network properties with all-shortest-paths queries 46
Network creation games with traceroute-based strategies 46
Augmenting the Edge-Connectivity of a Spider Tree 45
Fault-Tolerant Approximate Shortest-Path Trees 45
New bounds for the balloon popping problem 45
An algorithm composition scheme preserving monotonicity 45
Specializations and generalizations of the Stackelberg minimum spanning tree game 44
Improved approximability and non-approximability results for graph diameter decreasing problems 44
Reconstructing Visibility Graphs with Simple Robots 44
Dynamic mechanism design 44
Multiple-edge-fault-tolerant approximate shortest-path trees 44
The max-distance network creation game on general host graphs 43
Discovery of Network Properties with All-Shortest-Paths Queries 42
On the tree conjecture for the network creation game 40
Network verification via routing table queries 40
Exact and approximate algorithms for movement problems on (special classes of) graphs 40
Polygon-constrained motion planning problems 40
Dynamic Mechanism Design 39
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 39
Tracking routes in communication networks 39
New bounds for the balloon popping problem 38
Reoptimization of Steiner Trees 38
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 38
Exact and approximate algorithms for movement problems on (special classes of) graphs 34
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 34
Stability of Networks in Stretchable Graphs 33
Improved Purely Additive Fault-Tolerant Spanners 33
On the Tree Conjecture for the Network Creation Game 33
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 33
Locating Facilities on a Network to Minimize Their Average Service Radius 32
Finding best swap edges minimizing the routing cost of a spanning tree 31
Improved approximability and non-approximability results for graph diameter decreasing problems 31
Topological influence and locality in swap schelling games 31
Tracking routes in communication networks 31
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game 29
On the complexity of minimizing interference in ad-hoc and sensor networks 27
Hardness of an asymmetric 2-player stackelberg network pricing game 27
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 27
Network creation games with traceroute-based strategies 23
Space-Efficient Fault-Tolerant Diameter Oracles 17
Fair tree connection games with topology-dependent edge cost 16
Near-optimal deterministic single-source distance sensitivity oracles 14
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 9
Selfish Creation of Social Networks 8
Totale 3.628
Salva come PNG Salva come JPEG
Categoria #
all - tutte 21.165
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 21.165
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020382 0 0 0 0 0 0 181 6 78 26 80 11
2020/2021581 72 1 97 4 79 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/2025551 8 51 146 35 73 85 153 0 0 0 0 0
Totale 3.628