IRIS
BILO', DAVIDE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.062
EU - Europa 1.417
AS - Asia 687
Continente sconosciuto - Info sul continente non disponibili 8
AF - Africa 3
SA - Sud America 3
OC - Oceania 1
Totale 4.181
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.048
IE - Irlanda 638
CN - Cina 268
TR - Turchia 252
IT - Italia 241
SG - Singapore 134
SE - Svezia 115
DE - Germania 104
UA - Ucraina 99
GB - Regno Unito 89
FI - Finlandia 53
FR - Francia 39
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
TW - Taiwan 1
ZA - Sudafrica 1
Totale 4.181
Salva come PNG Salva come JPEG
Città #
Dublin 638
Chandler 499
Jacksonville 389
Singapore 120
Izmir 113
L’Aquila 91
Lawrence 82
Princeton 82
Boardman 78
New York 76
Nanjing 72
San Mateo 69
Wilmington 61
Ashburn 52
L'aquila 45
Nanchang 38
Milan 29
Los Angeles 24
Shenyang 22
Ann Arbor 21
Kunming 21
Rome 21
Seattle 18
Mountain View 17
Cedar Knolls 13
Santa Clara 13
Verona 13
Woodbridge 13
Hebei 12
Venezia 12
Tianjin 11
Buffalo 10
Dallas 10
Shanghai 10
Brussels 9
Guangzhou 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
Lanzhou 5
Lappeenranta 5
Ningbo 5
Changsha 4
Pune 4
Stockholm 4
Belgrade 3
Chicago 3
Dubai 3
London 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
Xuzhou 2
Amsterdam 1
Andover 1
Auburn Hills 1
Barakaldo 1
Budapest 1
Callao 1
Chisinau 1
Clifton 1
Cormeilles-en-Parisis 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
Totale 3.013
Salva come PNG Salva come JPEG
Nome #
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 166
Approximating the Metric TSP in Linear Time 92
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 82
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 80
Approximating the Metric TSP in Linear Time 79
Network Verification via Routing Table Queries 79
Stability of Networks in Stretchable Graphs 78
The Max-Distance Network Creation Game on General Host Graphs 72
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 72
Bounded-Distance Network Creation Games 71
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 70
The max-distance network creation game on general host graphs 70
Exact and approximate algorithms for movement problems on (special classes of) graphs 70
Fault-Tolerant Approximate Shortest-Path Trees 69
Network Creation Games with Traceroute-Based Strategies 69
Network Verification via Routing Table Queries 68
Bounded-Distance Network Creation Games 68
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 67
Dynamic Mechanism Design 66
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 66
Fault-Tolerant Approximate Shortest-Path Trees 66
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 65
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path 65
Compact and fast sensitivity oracles for single-source distances 65
An improved algorithm for computing all the best swap edges of a tree spanner 65
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 64
A faster computation of all the best swap edges of a tree spanner 64
Multiple-edge-fault-tolerant approximate shortest-path trees 64
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 63
Polygon-Constrained Motion Planning Problems 63
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 61
Dynamic Mechanism Design 61
Locality-Based Network Creation Games 61
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 60
Improved Purely Additive Fault-Tolerant Spanners 59
Locality-based Network Creation Games 59
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 59
Computational Aspects of a 2-player Stackelberg Shortest Paths Tree Game 58
Augmenting the Edge-Connectivity of a Spider Tree 57
Range augmentation problems in static ad-hoc wireless networks 56
Effcient oracles and routing schemes for replacement paths 53
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 52
Locating Facilities on a Network to Minimize their Average Service Radius 51
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 48
An Algorithm Composition Scheme Preserving Monotonicity 47
On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem 46
Cutting Bamboo Down to Size 45
Almost optimal algorithms for diameter-optimally augmenting trees 44
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 43
Tracking Routes in Communication Networks 38
Reoptimization of steiner trees 36
Fixed-Parameter Sensitivity Oracles 35
Hardness of an asymmetric 2-player stackelberg network pricing game 35
Reoptimization of weighted graph and covering problems 35
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 34
New bounds for the balloon popping problem 34
Tracking routes in communication networks 33
Reconstructing visibility graphs with simple robots 32
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 31
Network creation games with traceroute-based strategies 31
A novel algorithm for the all-best-swap-edge problem on tree spanners 31
Fair tree connection games with topology-dependent edge cost 31
Discovery of network properties with all-shortest-paths queries 30
Space-Efficient Fault-Tolerant Diameter Oracles 29
On the complexity of two dots for narrow boards and few colors 28
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 28
Cutting bamboo down to size 28
New algorithms for Steiner tree reoptimization 27
On the tree conjecture for the network creation game 26
Discovery of network properties with all-shortest-paths queries 26
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 25
Geometric network creation games 25
New advances in reoptimizing the minimum Steiner tree problem 24
Reoptimization of the shortest common superstring problem 24
Near-optimal deterministic single-source distance sensitivity oracles 23
Selfish Creation of Social Networks 23
New bounds for the balloon popping problem 22
On the Tree Conjecture for the Network Creation Game 22
Reoptimization of the Shortest Common Superstring Problem (Extended Abstract) 22
Reconstructing visibility graphs with simple robots 21
New reoptimization techniques applied to steiner tree problem 20
Topological influence and locality in swap schelling games 19
Topological influence and locality in swap schelling games 19
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games 16
Blackout-Tolerant Temporal Spanners 16
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances 16
New approximation algorithms for the heterogeneous weighted delivery problem 16
Sparse Temporal Spanners with Low Stretch 15
Geometric Network Creation Games 12
Almost optimal algorithms for diameter-optimally augmenting trees 11
Fault-Tolerant ST-Diameter Oracles 8
Blackout-tolerant temporal spanners 6
Schelling Games with Continuous Types 5
Temporal Network Creation Games 5
Finding Diameter-Reducing Shortcuts in Trees 4
Approximate Distance Sensitivity Oracles in Subquadratic Space 4
Compact Distance Oracles with Large Sensitivity and Low Stretch 3
Schelling Games with Continuous Types (short paper) 2
Totale 4.304
Salva come PNG Salva come JPEG
Categoria #
all - tutte 19.926
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.926
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020264 0 0 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/2024452 153 22 20 47 33 103 5 11 8 32 8 10
2024/2025185 129 51 5 0 0 0 0 0 0 0 0 0
Totale 4.304