IRIS
BILO', DAVIDE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.522
EU - Europa 2.933
AS - Asia 2.826
SA - Sud America 450
Continente sconosciuto - Info sul continente non disponibili 159
AF - Africa 62
OC - Oceania 3
Totale 11.955
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.373
SG - Singapore 1.296
IT - Italia 895
IE - Irlanda 641
CN - Cina 514
RU - Federazione Russa 504
BR - Brasile 372
HK - Hong Kong 280
TR - Turchia 266
VN - Vietnam 204
DE - Germania 181
GB - Regno Unito 150
SE - Svezia 132
UA - Ucraina 106
FR - Francia 100
FI - Finlandia 95
CA - Canada 87
BD - Bangladesh 58
IN - India 53
MX - Messico 27
AR - Argentina 26
JP - Giappone 26
ES - Italia 23
ZA - Sudafrica 23
IQ - Iraq 20
PL - Polonia 19
NL - Olanda 16
PH - Filippine 15
CO - Colombia 14
ID - Indonesia 13
LT - Lituania 12
AE - Emirati Arabi Uniti 11
BE - Belgio 11
EC - Ecuador 11
CL - Cile 10
NI - Nicaragua 8
KR - Corea 7
PK - Pakistan 7
CR - Costa Rica 6
EU - Europa 6
SA - Arabia Saudita 6
VE - Venezuela 6
CH - Svizzera 5
KE - Kenya 5
MA - Marocco 5
PE - Perù 5
SC - Seychelles 5
TN - Tunisia 5
UZ - Uzbekistan 5
AZ - Azerbaigian 4
BG - Bulgaria 4
IL - Israele 4
JM - Giamaica 4
LB - Libano 4
MD - Moldavia 4
MY - Malesia 4
RO - Romania 4
RS - Serbia 4
AT - Austria 3
BH - Bahrain 3
CI - Costa d'Avorio 3
CZ - Repubblica Ceca 3
DK - Danimarca 3
EG - Egitto 3
GT - Guatemala 3
JO - Giordania 3
KG - Kirghizistan 3
ME - Montenegro 3
NP - Nepal 3
OM - Oman 3
PR - Porto Rico 3
SV - El Salvador 3
A2 - ???statistics.table.value.countryCode.A2??? 2
AU - Australia 2
BA - Bosnia-Erzegovina 2
BB - Barbados 2
DZ - Algeria 2
ET - Etiopia 2
GA - Gabon 2
GE - Georgia 2
HN - Honduras 2
HU - Ungheria 2
KZ - Kazakistan 2
LV - Lettonia 2
NG - Nigeria 2
PY - Paraguay 2
QA - Qatar 2
TH - Thailandia 2
TW - Taiwan 2
UY - Uruguay 2
AO - Angola 1
BO - Bolivia 1
BS - Bahamas 1
BY - Bielorussia 1
BZ - Belize 1
CM - Camerun 1
CV - Capo Verde 1
CY - Cipro 1
DO - Repubblica Dominicana 1
EE - Estonia 1
Totale 11.789
Salva come PNG Salva come JPEG
Città #
Singapore 709
San Jose 697
Dublin 641
Ashburn 528
Chandler 499
Dallas 398
Jacksonville 390
Council Bluffs 282
Hong Kong 274
Santa Clara 256
Boardman 172
The Dalles 172
Milan 137
New York 129
Izmir 114
Staranzano 111
L’Aquila 97
Moscow 91
Rome 88
Lawrence 82
Princeton 82
Los Angeles 73
Ho Chi Minh City 72
Nanjing 72
San Mateo 69
Columbus 66
Wilmington 62
Hanoi 52
Munich 48
Lauterbourg 47
L'aquila 45
Beijing 39
Nanchang 39
São Paulo 39
North Bergen 37
Brooklyn 28
Chicago 28
Naples 25
Shenyang 24
Montreal 23
Hefei 22
Tokyo 22
Ann Arbor 21
Helsinki 21
Kunming 21
Seattle 21
Stockholm 21
Atlanta 19
Miano 19
Shanghai 18
Turku 18
Verona 18
Buffalo 17
Guangzhou 17
Johannesburg 17
Mountain View 17
Phoenix 17
Toronto 16
Amsterdam 15
Orem 15
Warsaw 15
Lappeenranta 14
Turin 14
Bari 13
Cedar Knolls 13
Charlotte 13
Denver 13
Des Moines 13
Lissone 13
Poplar 13
Woodbridge 13
Hebei 12
Venezia 12
Brussels 11
San Francisco 11
Tianjin 11
Belo Horizonte 10
Manchester 10
Zhengzhou 10
Brasília 9
Curitiba 9
Falkenstein 9
Jiaxing 9
Mexico City 9
Norwalk 9
Rio de Janeiro 9
Tappahannock 9
Baghdad 8
Boston 8
Campinas 8
Catania 8
Edinburgh 8
Florence 8
Hải Dương 8
London 8
Mumbai 8
Biên Hòa 7
Bresso 7
Changchun 7
Falls Church 7
Totale 7.615
Salva come PNG Salva come JPEG
Nome #
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 224
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 167
Exact and approximate algorithms for movement problems on (special classes of) graphs 166
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 154
Approximating the Metric TSP in Linear Time 151
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 149
Approximating the Metric TSP in Linear Time 148
Effcient oracles and routing schemes for replacement paths 144
Network creation games with traceroute-based strategies 144
Network Verification via Routing Table Queries 143
Fault-Tolerant Approximate Shortest-Path Trees 143
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 142
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 138
Compact and fast sensitivity oracles for single-source distances 136
Bounded-Distance Network Creation Games 135
A faster computation of all the best swap edges of a tree spanner 135
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 134
Dynamic Mechanism Design 133
Stability of Networks in Stretchable Graphs 133
The Max-Distance Network Creation Game on General Host Graphs 133
Cutting bamboo down to size 133
Fault-Tolerant Approximate Shortest-Path Trees 132
Multiple-edge-fault-tolerant approximate shortest-path trees 132
Bounded-Distance Network Creation Games 130
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 128
Cutting Bamboo Down to Size 128
Hardness of an asymmetric 2-player stackelberg network pricing game 128
An improved algorithm for computing all the best swap edges of a tree spanner 126
Network Creation Games with Traceroute-Based Strategies 126
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 126
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 125
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 123
Improved Purely Additive Fault-Tolerant Spanners 123
Computational Aspects of a 2-player Stackelberg Shortest Paths Tree Game 123
Range augmentation problems in static ad-hoc wireless networks 121
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 121
Near-optimal deterministic single-source distance sensitivity oracles 121
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 120
Tracking Routes in Communication Networks 118
Locality-based Network Creation Games 118
Finding diameter-reducing shortcuts in trees 118
Dynamic Mechanism Design 117
Network Verification via Routing Table Queries 116
Locality-Based Network Creation Games 116
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 116
The max-distance network creation game on general host graphs 115
Polygon-Constrained Motion Planning Problems 114
Almost optimal algorithms for diameter-optimally augmenting trees 114
Fair tree connection games with topology-dependent edge cost 113
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path 112
Reoptimization of the Shortest Common Superstring Problem (Extended Abstract) 112
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 111
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 109
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 108
Graph Spanners for Group Steiner Distances 107
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 106
Augmenting the Edge-Connectivity of a Spider Tree 105
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 105
A novel algorithm for the all-best-swap-edge problem on tree spanners 103
Geometric network creation games 103
On the tree conjecture for the network creation game 102
Blackout-Tolerant Temporal Spanners 101
Tracking routes in communication networks 101
Sparse Temporal Spanners with Low Stretch 99
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 99
On the complexity of two dots for narrow boards and few colors 99
Locating Facilities on a Network to Minimize their Average Service Radius 98
Fixed-Parameter Sensitivity Oracles 98
On the Approximability of Graph Visibility Problems 96
Geometric Network Creation Games 96
On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem 95
Reoptimization of weighted graph and covering problems 95
Reoptimization of the shortest common superstring problem 95
New approximation algorithms for the heterogeneous weighted delivery problem 95
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper) 93
Reoptimization of steiner trees 93
New bounds for the balloon popping problem 93
Approximate Distance Sensitivity Oracles in Subquadratic Space 89
Space-Efficient Fault-Tolerant Diameter Oracles 89
Blackout-tolerant temporal spanners 88
An Algorithm Composition Scheme Preserving Monotonicity 87
Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks 87
Fault-Tolerant ST-Diameter Oracles 85
Temporal Queries for Dynamic Temporal Forests 83
Topological influence and locality in swap schelling games 83
Swapping Mixed-Up Beers to Keep Them Cool 82
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances 82
Reconstructing visibility graphs with simple robots 81
Topological influence and locality in swap schelling games 80
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard 80
New algorithms for Steiner tree reoptimization 80
Discovery of network properties with all-shortest-paths queries 79
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games 78
Approximate Distance Sensitivity Oracles in Subquadratic Space 78
Discovery of network properties with all-shortest-paths queries 78
Improved Distance (Sensitivity) Oracles with Subquadratic Space 77
On the Tree Conjecture for the Network Creation Game 76
Schelling Games with Continuous Types 74
Finding Diameter-Reducing Shortcuts in Trees 74
Selfish Creation of Social Networks 72
Totale 11.184
Salva come PNG Salva come JPEG
Categoria #
all - tutte 50.307
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 50.307
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022315 0 0 0 20 22 6 12 62 26 5 34 128
2022/20231.667 102 75 20 172 116 157 0 128 770 8 88 31
2023/2024452 153 22 20 47 33 103 5 11 8 32 8 10
2024/20252.368 129 51 145 127 330 197 319 229 417 98 132 194
2025/20263.974 153 382 311 508 399 291 564 141 323 597 219 86
2026/20271.494 139 145 418 792 0 0 0 0 0 0 0 0
Totale 11.955