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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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.974 153 382 311 508 399 291 564 141 323 597 219 86
2026/2027118 118 0 0 0 0 0 0 0 0 0 0 0
Totale 10.579