IRIS
BILO', DAVIDE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.405
EU - Europa 1.441
AS - Asia 1.197
SA - Sud America 70
Continente sconosciuto - Info sul continente non disponibili 8
AF - Africa 4
OC - Oceania 1
Totale 5.126
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.388
IE - Irlanda 639
SG - Singapore 426
CN - Cina 331
TR - Turchia 253
IT - Italia 249
HK - Hong Kong 135
SE - Svezia 115
DE - Germania 110
UA - Ucraina 99
GB - Regno Unito 89
BR - Brasile 61
FI - Finlandia 59
FR - Francia 39
IN - India 19
CA - Canada 13
BE - Belgio 9
EU - Europa 6
VN - Vietnam 6
CH - Svizzera 5
CO - Colombia 5
RU - Federazione Russa 5
ES - Italia 4
IQ - Iraq 4
MX - Messico 4
AE - Emirati Arabi Uniti 3
BD - Bangladesh 3
IL - Israele 3
KG - Kirghizistan 3
RS - Serbia 3
A2 - ???statistics.table.value.countryCode.A2??? 2
BG - Bulgaria 2
DK - Danimarca 2
DZ - Algeria 2
JP - Giappone 2
MD - Moldavia 2
OM - Oman 2
PE - Perù 2
TW - Taiwan 2
AT - Austria 1
AU - Australia 1
CL - Cile 1
EC - Ecuador 1
GR - Grecia 1
HR - Croazia 1
HU - Ungheria 1
IR - Iran 1
LI - Liechtenstein 1
NG - Nigeria 1
NL - Olanda 1
NO - Norvegia 1
NP - Nepal 1
PH - Filippine 1
PL - Polonia 1
PT - Portogallo 1
QA - Qatar 1
RO - Romania 1
UZ - Uzbekistan 1
ZA - Sudafrica 1
Totale 5.126
Salva come PNG Salva come JPEG
Città #
Dublin 639
Chandler 499
Jacksonville 389
Singapore 347
Santa Clara 211
Boardman 172
Hong Kong 135
Izmir 113
L’Aquila 91
Lawrence 82
Princeton 82
New York 78
Nanjing 72
San Mateo 69
Wilmington 61
Ashburn 52
L'aquila 45
Nanchang 39
Milan 29
Los Angeles 28
North Bergen 25
Shenyang 24
Ann Arbor 21
Kunming 21
Rome 21
Seattle 18
Guangzhou 17
Mountain View 17
Shanghai 16
Cedar Knolls 13
Verona 13
Woodbridge 13
Hebei 12
Helsinki 12
Venezia 12
Tianjin 11
Buffalo 10
Dallas 10
Zhengzhou 10
Brussels 9
Jiaxing 9
Norwalk 9
Tappahannock 9
Beijing 8
Edinburgh 8
Changchun 7
Des Moines 7
Falls Church 7
Jinan 7
Toronto 7
Centrale 6
Changsha 6
Dong Ket 6
Munich 6
Ningbo 6
Brasília 5
Lanzhou 5
Lappeenranta 5
São Paulo 5
Mumbai 4
Pune 4
Stockholm 4
Belgrade 3
Bishkek 3
Campinas 3
Chicago 3
Dubai 3
London 3
Montreal 3
Washington 3
Zurich 3
Aquila 2
Atlanta 2
Bogotá 2
Bremen 2
Centro 2
Controguerra 2
Copenhagen 2
Curitiba 2
Dearborn 2
Grafing 2
Istanbul 2
Madrid 2
Ottawa 2
San Jose 2
Sofia 2
Taipei 2
Taizhou 2
Xuzhou 2
Amsterdam 1
Andover 1
Antalya 1
Arapongas 1
Assis 1
Auburn Hills 1
Baghdad 1
Barakaldo 1
Barra do Garças 1
Barueri 1
Belo Horizonte 1
Totale 3.752
Salva come PNG Salva come JPEG
Nome #
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 176
Exact and approximate algorithms for movement problems on (special classes of) graphs 108
Approximating the Metric TSP in Linear Time 101
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 90
Network Verification via Routing Table Queries 89
Stability of Networks in Stretchable Graphs 87
Approximating the Metric TSP in Linear Time 86
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 86
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 79
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 79
Fault-Tolerant Approximate Shortest-Path Trees 78
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 78
Bounded-Distance Network Creation Games 78
Network Creation Games with Traceroute-Based Strategies 78
Bounded-Distance Network Creation Games 77
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 77
The Max-Distance Network Creation Game on General Host Graphs 77
The max-distance network creation game on general host graphs 75
Compact and fast sensitivity oracles for single-source distances 74
Fault-Tolerant Approximate Shortest-Path Trees 74
Network Verification via Routing Table Queries 73
Dynamic Mechanism Design 73
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 73
Dynamic Mechanism Design 72
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path 72
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 72
A faster computation of all the best swap edges of a tree spanner 72
Locality-Based Network Creation Games 72
An improved algorithm for computing all the best swap edges of a tree spanner 72
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 71
Multiple-edge-fault-tolerant approximate shortest-path trees 71
Polygon-Constrained Motion Planning Problems 71
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 70
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 69
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 67
Locality-based Network Creation Games 67
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 67
Improved Purely Additive Fault-Tolerant Spanners 66
Computational Aspects of a 2-player Stackelberg Shortest Paths Tree Game 66
Augmenting the Edge-Connectivity of a Spider Tree 64
Effcient oracles and routing schemes for replacement paths 64
Range augmentation problems in static ad-hoc wireless networks 63
Reoptimization of the Shortest Common Superstring Problem (Extended Abstract) 63
Near-optimal deterministic single-source distance sensitivity oracles 60
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 59
Locating Facilities on a Network to Minimize their Average Service Radius 58
Almost optimal algorithms for diameter-optimally augmenting trees 58
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 54
An Algorithm Composition Scheme Preserving Monotonicity 54
Cutting Bamboo Down to Size 54
On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem 52
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 50
Hardness of an asymmetric 2-player stackelberg network pricing game 47
Tracking Routes in Communication Networks 45
Fixed-Parameter Sensitivity Oracles 45
Reoptimization of steiner trees 43
Cutting bamboo down to size 43
Tracking routes in communication networks 42
A novel algorithm for the all-best-swap-edge problem on tree spanners 42
Reoptimization of weighted graph and covering problems 42
Reconstructing visibility graphs with simple robots 41
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 40
Network creation games with traceroute-based strategies 40
New bounds for the balloon popping problem 40
Fair tree connection games with topology-dependent edge cost 39
Discovery of network properties with all-shortest-paths queries 38
On the complexity of two dots for narrow boards and few colors 37
Space-Efficient Fault-Tolerant Diameter Oracles 37
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 36
Discovery of network properties with all-shortest-paths queries 34
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 33
Geometric network creation games 33
Reoptimization of the shortest common superstring problem 33
New algorithms for Steiner tree reoptimization 32
On the tree conjecture for the network creation game 31
New advances in reoptimizing the minimum Steiner tree problem 30
Topological influence and locality in swap schelling games 29
Selfish Creation of Social Networks 28
Reconstructing visibility graphs with simple robots 28
Sparse Temporal Spanners with Low Stretch 27
New reoptimization techniques applied to steiner tree problem 27
New bounds for the balloon popping problem 27
On the Tree Conjecture for the Network Creation Game 27
New approximation algorithms for the heterogeneous weighted delivery problem 27
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games 25
Blackout-Tolerant Temporal Spanners 25
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances 25
Topological influence and locality in swap schelling games 24
Geometric Network Creation Games 22
Fault-Tolerant ST-Diameter Oracles 21
Almost optimal algorithms for diameter-optimally augmenting trees 18
Approximate Distance Sensitivity Oracles in Subquadratic Space 15
Blackout-tolerant temporal spanners 15
Temporal Network Creation Games 15
Schelling Games with Continuous Types 13
Finding Diameter-Reducing Shortcuts in Trees 12
Compact Distance Oracles with Large Sensitivity and Low Stretch 10
Schelling Games with Continuous Types (short paper) 9
Approximate Distance Sensitivity Oracles in Subquadratic Space 5
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper) 5
Totale 5.238
Salva come PNG Salva come JPEG
Categoria #
all - tutte 25.420
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 25.420
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020164 0 0 0 0 0 0 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/2024452 153 22 20 47 33 103 5 11 8 32 8 10
2024/20251.141 129 51 145 127 330 197 162 0 0 0 0 0
Totale 5.260