IRIS
BILÒ, Davide
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1.592
EU - Europa 955
AS - Asia 519
Continente sconosciuto - Info sul continente non disponibili 8
OC - Oceania 8
SA - Sud America 3
AF - Africa 1
Totale 3.086
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.577
CN - Cina 454
UA - Ucraina 452
DE - Germania 167
SE - Svezia 149
FI - Finlandia 63
IT - Italia 46
SG - Singapore 38
GB - Regno Unito 22
FR - Francia 20
IN - India 17
BE - Belgio 15
CA - Canada 15
AU - Australia 8
EU - Europa 8
TR - Turchia 6
RU - Federazione Russa 5
NL - Olanda 4
PL - Polonia 4
ES - Italia 2
PE - Perù 2
BG - Bulgaria 1
CL - Cile 1
CZ - Repubblica Ceca 1
IE - Irlanda 1
IL - Israele 1
KW - Kuwait 1
LU - Lussemburgo 1
PK - Pakistan 1
RO - Romania 1
RS - Serbia 1
VN - Vietnam 1
ZA - Sudafrica 1
Totale 3.086
Salva come PNG Salva come JPEG
Città #
Chandler 420
Jacksonville 270
Princeton 160
Nanjing 111
Wilmington 79
Ann Arbor 62
Dearborn 50
Boardman 43
Nanchang 38
Beijing 33
Ningbo 29
Changsha 27
Shenyang 26
Woodbridge 26
Hebei 25
Sassari 24
Singapore 23
Tianjin 20
Andover 19
Guangzhou 19
Jiaxing 17
Norwalk 16
Brussels 15
Jinan 15
Santa Clara 15
Taizhou 15
Kunming 12
San Francisco 11
Zhengzhou 11
Ahmedabad 10
Fairfield 10
Toronto 10
Haikou 8
Helsinki 8
Ashburn 7
Houston 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
Cagliari 2
Krasnoyarsk 2
La Spezia 2
Lima 2
Markham 2
Montréal 2
Redwood City 2
Saint Petersburg 2
Seattle 2
Shanghai 2
Sydney 2
Almere Stad 1
Auburn 1
Barcelona 1
Belgrade 1
Brno 1
Cambridge 1
Centurion 1
Chengdu 1
Dublin 1
Figline Valdarno 1
Haifa 1
Hanoi 1
Hanover 1
Horia 1
Huntington 1
Islamabad 1
Istanbul 1
Jinhua 1
Kuwait City 1
L'aquila 1
Las Vegas 1
Los Angeles 1
Luxembourg 1
Madrid 1
Mumbai 1
New York 1
Newcastle upon Tyne 1
Pointe-Claire 1
San Jose 1
San Mateo 1
Shaoxing 1
Sofia 1
Taiyuan 1
Totale 1.824
Salva come PNG Salva come JPEG
Nome #
Finding the best swap edges minimizing the routing cost of a spanning tree 77
Fault-tolerant approximate shortest-path trees 74
Bounded-distance network creation games 68
A faster computation of all the best swap edges of a shortest paths tree 61
New algorithms for Steiner tree reoptimization 58
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 57
New reoptimization techniques applied to Steiner tree problem 56
An improved algorithm for computing all the best swap edges of a tree spanner 54
Approximate mechanisms for the graphical TSP and other graph-traversal problems 53
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game 52
Almost optimal algorithms for diameter-optimally augmenting trees 51
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path 51
A novel algorithm for the all-best-swap-edge problem on tree spanners 51
Reconstructing visibility graphs with simple robots 50
A 13/10-approximation Algorithm for Minimum-size 2-Vertex-connectivity of Hamiltonian Graphs 50
Compact and Fast Sensitivity Oracles for Single-Source Distances 50
A Faster Computation of All the Best Swap Edges of a Tree Spanner 49
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 46
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 46
Cutting bamboo down to size 46
Reoptimization of the Shortest Common Superstring Problem 46
New advances in reoptimizing the minimum Steiner tree problem 46
Range Augmentation Problems in Static Ad-Hoc Wireless Networks 45
Network Verification via Routing Table Queries 45
Locality-Based Network Creation Games 45
Bounded-distance network creation game 45
Approximating the Metric TSP in Linear Time 44
Reoptimization of Weighted Graph and Covering Problems 43
The max-distance network creation game on general host graphs 43
A faster computation of all the best swap edges of a shortest paths tree 42
Approximating the Metric TSP in Linear Time 42
On the complexity of two dots for narrow boards and few colors 42
Efficient oracles and routing schemes for replacement paths 42
Locality-based network creation game 42
Discovery of network properties with all-shortest-paths queries 42
Specializations and generalizations of the Stackelberg minimum spanning tree game 41
Reconstructing Visibility Graphs with Simple Robots 41
Augmenting the Edge-Connectivity of a Spider Tree 41
An algorithm composition scheme preserving monotonicity 41
Network creation games with traceroute-based strategies 41
Reoptimization of the Shortest Common Superstring Problem 40
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 40
Geometric network creation games 40
New bounds for the balloon popping problem 39
Improved approximability and non-approximability results for graph diameter decreasing problems 38
Discovery of Network Properties with All-Shortest-Paths Queries 38
Tracking routes in communication networks 38
Dynamic mechanism design 38
Multiple-edge-fault-tolerant approximate shortest-path trees 37
The max-distance network creation game on general host graphs 36
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 36
Fault-Tolerant Approximate Shortest-Path Trees 36
On the tree conjecture for the network creation game 36
Network verification via routing table queries 36
Exact and approximate algorithms for movement problems on (special classes of) graphs 34
Polygon-constrained motion planning problems 34
New bounds for the balloon popping problem 33
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 32
Reoptimization of Steiner Trees 31
Exact and approximate algorithms for movement problems on (special classes of) graphs 30
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 30
On the Tree Conjecture for the Network Creation Game 30
Stability of Networks in Stretchable Graphs 29
Dynamic Mechanism Design 29
Locating Facilities on a Network to Minimize Their Average Service Radius 28
Improved Purely Additive Fault-Tolerant Spanners 28
Improved approximability and non-approximability results for graph diameter decreasing problems 27
Finding best swap edges minimizing the routing cost of a spanning tree 26
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game 25
Tracking routes in communication networks 25
On the complexity of minimizing interference in ad-hoc and sensor networks 24
Topological influence and locality in swap schelling games 23
Hardness of an asymmetric 2-player stackelberg network pricing game 23
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 23
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 23
Network creation games with traceroute-based strategies 19
Fair tree connection games with topology-dependent edge cost 11
Space-Efficient Fault-Tolerant Diameter Oracles 11
Near-optimal deterministic single-source distance sensitivity oracles 9
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 6
Selfish Creation of Social Networks 6
Totale 3.136
Salva come PNG Salva come JPEG
Categoria #
all - tutte 16.779
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.779
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020575 0 0 52 7 82 52 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/202559 8 51 0 0 0 0 0 0 0 0 0 0
Totale 3.136