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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020516 0 0 0 0 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/2025291 8 51 146 35 51 0 0 0 0 0 0 0
Totale 3.368