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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021106 0 0 0 0 0 0 0 0 0 0 91 15
2021/2022390 10 29 36 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.838 153 382 311 508 399 291 564 141 323 597 169 0
Totale 10.325