BILO', DAVIDE
 Distribuzione geografica
Continente #
NA - Nord America 2.025
EU - Europa 1.414
AS - Asia 529
Continente sconosciuto - Info sul continente non disponibili 8
AF - Africa 3
SA - Sud America 3
OC - Oceania 1
Totale 3.983
Nazione #
US - Stati Uniti d'America 2.011
IE - Irlanda 638
TR - Turchia 252
CN - Cina 243
IT - Italia 241
SE - Svezia 115
DE - Germania 104
UA - Ucraina 99
GB - Regno Unito 89
FI - Finlandia 51
FR - Francia 38
IN - India 16
CA - Canada 12
BE - Belgio 9
EU - Europa 6
VN - Vietnam 6
CH - Svizzera 5
RU - Federazione Russa 4
AE - Emirati Arabi Uniti 3
ES - Italia 3
RS - Serbia 3
A2 - ???statistics.table.value.countryCode.A2??? 2
BG - Bulgaria 2
CO - Colombia 2
DK - Danimarca 2
JP - Giappone 2
MD - Moldavia 2
MX - Messico 2
AT - Austria 1
AU - Australia 1
BD - Bangladesh 1
DZ - Algeria 1
GR - Grecia 1
HR - Croazia 1
HU - Ungheria 1
IL - Israele 1
IQ - Iraq 1
IR - Iran 1
LI - Liechtenstein 1
NG - Nigeria 1
NL - Olanda 1
NO - Norvegia 1
PE - Perù 1
PH - Filippine 1
PL - Polonia 1
RO - Romania 1
SG - Singapore 1
TW - Taiwan 1
ZA - Sudafrica 1
Totale 3.983
Città #
Dublin 638
Chandler 499
Jacksonville 389
Izmir 113
L’Aquila 91
Lawrence 82
Princeton 82
New York 76
Boardman 74
Nanjing 72
San Mateo 69
Wilmington 61
Ashburn 52
L'aquila 45
Nanchang 38
Milan 29
Los Angeles 24
Ann Arbor 21
Kunming 21
Rome 21
Shenyang 21
Seattle 18
Mountain View 17
Cedar Knolls 13
Verona 13
Woodbridge 13
Hebei 12
Venezia 12
Tianjin 11
Buffalo 10
Brussels 9
Jiaxing 9
Norwalk 9
Tappahannock 9
Zhengzhou 9
Edinburgh 8
Des Moines 7
Falls Church 7
Jinan 7
Toronto 7
Beijing 6
Centrale 6
Changchun 6
Dong Ket 6
Helsinki 6
Guangzhou 5
Lanzhou 5
Ningbo 5
Changsha 4
Pune 4
Stockholm 4
Belgrade 3
Chicago 3
Dubai 3
Lappeenranta 3
London 3
Shanghai 3
Washington 3
Zurich 3
Aquila 2
Atlanta 2
Bremen 2
Centro 2
Controguerra 2
Copenhagen 2
Dearborn 2
Grafing 2
Istanbul 2
Montreal 2
Mumbai 2
Ottawa 2
San Jose 2
Sofia 2
Amsterdam 1
Andover 1
Auburn Hills 1
Barakaldo 1
Budapest 1
Callao 1
Chisinau 1
Cormeilles-en-Parisis 1
Dallas 1
Düsseldorf 1
Fairfield 1
Fremont 1
Giulianova 1
Hangzhou 1
Islington 1
Johannesburg 1
Kyiv 1
Lagos 1
Littleton 1
Madrid 1
Manchester 1
Manila 1
Marseille 1
Mexico City 1
Miami 1
Montréal 1
New Orleans 1
Totale 2.854
Nome #
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 166
Approximating the Metric TSP in Linear Time 91
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 81
Approximating the Metric TSP in Linear Time 78
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 78
Stability of Networks in Stretchable Graphs 77
Network Verification via Routing Table Queries 77
The Max-Distance Network Creation Game on General Host Graphs 71
Bounded-Distance Network Creation Games 70
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 69
The max-distance network creation game on general host graphs 69
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 68
Fault-Tolerant Approximate Shortest-Path Trees 68
Exact and approximate algorithms for movement problems on (special classes of) graphs 68
Network Creation Games with Traceroute-Based Strategies 68
Bounded-Distance Network Creation Games 67
Dynamic Mechanism Design 65
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 65
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path 64
An improved algorithm for computing all the best swap edges of a tree spanner 64
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 64
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 63
Fault-Tolerant Approximate Shortest-Path Trees 63
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 62
Compact and fast sensitivity oracles for single-source distances 62
A faster computation of all the best swap edges of a tree spanner 62
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 62
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 60
Dynamic Mechanism Design 60
Multiple-edge-fault-tolerant approximate shortest-path trees 60
Polygon-Constrained Motion Planning Problems 60
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 59
Locality-Based Network Creation Games 59
Network Verification via Routing Table Queries 58
Improved Purely Additive Fault-Tolerant Spanners 58
Locality-based Network Creation Games 58
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 58
Computational Aspects of a 2-player Stackelberg Shortest Paths Tree Game 56
Augmenting the Edge-Connectivity of a Spider Tree 56
Range augmentation problems in static ad-hoc wireless networks 54
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 51
Effcient oracles and routing schemes for replacement paths 51
Locating Facilities on a Network to Minimize their Average Service Radius 49
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 47
An Algorithm Composition Scheme Preserving Monotonicity 46
On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem 43
Cutting Bamboo Down to Size 43
Almost optimal algorithms for diameter-optimally augmenting trees 42
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 41
Reoptimization of steiner trees 35
Tracking Routes in Communication Networks 34
Reoptimization of weighted graph and covering problems 34
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 33
Hardness of an asymmetric 2-player stackelberg network pricing game 33
Tracking routes in communication networks 32
Fixed-Parameter Sensitivity Oracles 32
Reconstructing visibility graphs with simple robots 30
New bounds for the balloon popping problem 30
Network creation games with traceroute-based strategies 29
A novel algorithm for the all-best-swap-edge problem on tree spanners 29
Fair tree connection games with topology-dependent edge cost 29
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 27
Space-Efficient Fault-Tolerant Diameter Oracles 27
Discovery of network properties with all-shortest-paths queries 27
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 27
Cutting bamboo down to size 27
On the complexity of two dots for narrow boards and few colors 26
New algorithms for Steiner tree reoptimization 26
On the tree conjecture for the network creation game 24
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 23
Discovery of network properties with all-shortest-paths queries 23
Geometric network creation games 23
New advances in reoptimizing the minimum Steiner tree problem 22
Selfish Creation of Social Networks 21
Near-optimal deterministic single-source distance sensitivity oracles 20
New bounds for the balloon popping problem 20
On the Tree Conjecture for the Network Creation Game 20
Reoptimization of the Shortest Common Superstring Problem (Extended Abstract) 20
Reoptimization of the shortest common superstring problem 20
New reoptimization techniques applied to steiner tree problem 19
Reconstructing visibility graphs with simple robots 18
Topological influence and locality in swap schelling games 17
Topological influence and locality in swap schelling games 16
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games 14
Blackout-Tolerant Temporal Spanners 14
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances 14
Sparse Temporal Spanners with Low Stretch 13
New approximation algorithms for the heterogeneous weighted delivery problem 13
Almost optimal algorithms for diameter-optimally augmenting trees 9
Geometric Network Creation Games 9
Fault-Tolerant ST-Diameter Oracles 5
Schelling Games with Continuous Types 2
Approximate Distance Sensitivity Oracles in Subquadratic Space 2
Blackout-tolerant temporal spanners 2
Temporal Network Creation Games 2
Finding Diameter-Reducing Shortcuts in Trees 1
Compact Distance Oracles with Large Sensitivity and Low Stretch 1
Schelling Games with Continuous Types (short paper) 1
Totale 4.106
Categoria #
all - tutte 16.508
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 16.508


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019162 0 0 0 0 0 0 0 0 0 0 13 149
2019/2020349 82 3 49 1 2 48 66 0 48 1 2 47
2020/2021409 8 49 2 52 49 9 52 1 59 22 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/2024439 153 22 20 47 33 103 5 11 8 32 5 0
Totale 4.106