IRIS
BILÒ, Davide
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1.566
EU - Europa 954
AS - Asia 453
Continente sconosciuto - Info sul continente non disponibili 8
OC - Oceania 8
SA - Sud America 3
AF - Africa 1
Totale 2.993
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.551
UA - Ucraina 452
CN - Cina 426
DE - Germania 167
SE - Svezia 149
FI - Finlandia 63
IT - Italia 46
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 3
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 2.993
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
Tianjin 20
Andover 19
Jiaxing 17
Norwalk 16
Brussels 15
Jinan 15
Taizhou 15
Guangzhou 12
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
Falls Church 4
Mountain View 4
Washington 4
Alghero 3
Amsterdam 3
Auburn Hills 3
Canberra 3
Changchun 3
Frankfurt am Main 3
Izmir 3
Melbourne 3
Cagliari 2
Fuzhou 2
Hefei 2
Krasnoyarsk 2
La Spezia 2
Lima 2
Markham 2
Montréal 2
Redwood City 2
Saint Petersburg 2
Seattle 2
Sydney 2
Warsaw 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
Santa Clara 1
Shaoxing 1
Sofia 1
Taiyuan 1
Winterbach 1
Totale 1.772
Salva come PNG Salva come JPEG
Nome #
Finding the best swap edges minimizing the routing cost of a spanning tree 75
Fault-tolerant approximate shortest-path trees 72
Bounded-distance network creation games 67
A faster computation of all the best swap edges of a shortest paths tree 60
New algorithms for Steiner tree reoptimization 57
New reoptimization techniques applied to Steiner tree problem 56
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 55
An improved algorithm for computing all the best swap edges of a tree spanner 53
Approximate mechanisms for the graphical TSP and other graph-traversal problems 52
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game 51
Almost optimal algorithms for diameter-optimally augmenting trees 51
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path 50
A novel algorithm for the all-best-swap-edge problem on tree spanners 50
Reconstructing visibility graphs with simple robots 49
A 13/10-approximation Algorithm for Minimum-size 2-Vertex-connectivity of Hamiltonian Graphs 49
Compact and Fast Sensitivity Oracles for Single-Source Distances 49
A Faster Computation of All the Best Swap Edges of a Tree Spanner 46
Reoptimization of the Shortest Common Superstring Problem 46
New advances in reoptimizing the minimum Steiner tree problem 46
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem 45
Range Augmentation Problems in Static Ad-Hoc Wireless Networks 45
Locality-Based Network Creation Games 45
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems 44
Cutting bamboo down to size 44
Bounded-distance network creation game 44
Network Verification via Routing Table Queries 43
The max-distance network creation game on general host graphs 43
Approximating the Metric TSP in Linear Time 43
On the complexity of two dots for narrow boards and few colors 42
A faster computation of all the best swap edges of a shortest paths tree 41
Reoptimization of Weighted Graph and Covering Problems 41
Approximating the Metric TSP in Linear Time 41
Specializations and generalizations of the Stackelberg minimum spanning tree game 40
Reoptimization of the Shortest Common Superstring Problem 40
Efficient oracles and routing schemes for replacement paths 40
An algorithm composition scheme preserving monotonicity 40
Locality-based network creation game 40
Discovery of network properties with all-shortest-paths queries 40
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 39
Reconstructing Visibility Graphs with Simple Robots 39
New bounds for the balloon popping problem 39
Geometric network creation games 39
Network creation games with traceroute-based strategies 39
Augmenting the Edge-Connectivity of a Spider Tree 38
Discovery of Network Properties with All-Shortest-Paths Queries 37
Tracking routes in communication networks 37
Dynamic mechanism design 37
Improved approximability and non-approximability results for graph diameter decreasing problems 36
Multiple-edge-fault-tolerant approximate shortest-path trees 36
The max-distance network creation game on general host graphs 35
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 35
Fault-Tolerant Approximate Shortest-Path Trees 35
On the tree conjecture for the network creation game 35
New bounds for the balloon popping problem 33
Polygon-constrained motion planning problems 33
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 32
Exact and approximate algorithms for movement problems on (special classes of) graphs 32
Reoptimization of Steiner Trees 30
On the Tree Conjecture for the Network Creation Game 30
Dynamic Mechanism Design 29
Exact and approximate algorithms for movement problems on (special classes of) graphs 29
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 29
Stability of Networks in Stretchable Graphs 28
Network verification via routing table queries 28
Locating Facilities on a Network to Minimize Their Average Service Radius 27
Improved Purely Additive Fault-Tolerant Spanners 27
Improved approximability and non-approximability results for graph diameter decreasing problems 26
Finding best swap edges minimizing the routing cost of a spanning tree 25
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game 24
On the complexity of minimizing interference in ad-hoc and sensor networks 23
Tracking routes in communication networks 23
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 23
Topological influence and locality in swap schelling games 22
Hardness of an asymmetric 2-player stackelberg network pricing game 22
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 22
Network creation games with traceroute-based strategies 17
Fair tree connection games with topology-dependent edge cost 10
Space-Efficient Fault-Tolerant Diameter Oracles 10
Near-optimal deterministic single-source distance sensitivity oracles 8
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 5
Selfish Creation of Social Networks 5
Totale 3.043
Salva come PNG Salva come JPEG
Categoria #
all - tutte 13.732
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 13.732
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019104 0 0 0 0 0 0 0 0 0 0 0 104
2019/2020715 137 3 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/202485 36 16 4 5 16 3 1 2 0 2 0 0
Totale 3.043