IRIS
BILO', DAVIDE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.499
EU - Europa 1.827
AS - Asia 1.488
SA - Sud America 201
AF - Africa 9
Continente sconosciuto - Info sul continente non disponibili 8
OC - Oceania 1
Totale 6.033
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.476
IE - Irlanda 639
SG - Singapore 588
IT - Italia 377
CN - Cina 335
TR - Turchia 257
HK - Hong Kong 242
RU - Federazione Russa 238
BR - Brasile 181
DE - Germania 122
SE - Svezia 115
UA - Ucraina 100
GB - Regno Unito 89
FI - Finlandia 66
FR - Francia 39
IN - India 19
CA - Canada 16
BE - Belgio 10
BD - Bangladesh 6
EU - Europa 6
IQ - Iraq 6
VN - Vietnam 6
AR - Argentina 5
CH - Svizzera 5
CO - Colombia 5
MX - Messico 5
AE - Emirati Arabi Uniti 4
EC - Ecuador 4
ES - Italia 4
PK - Pakistan 4
IL - Israele 3
KG - Kirghizistan 3
MD - Moldavia 3
OM - Oman 3
PE - Perù 3
RS - Serbia 3
ZA - Sudafrica 3
A2 - ???statistics.table.value.countryCode.A2??? 2
BG - Bulgaria 2
DK - Danimarca 2
DZ - Algeria 2
JP - Giappone 2
LT - Lituania 2
MA - Marocco 2
NI - Nicaragua 2
TW - Taiwan 2
UY - Uruguay 2
AT - Austria 1
AU - Australia 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
CL - Cile 1
GE - Georgia 1
GR - Grecia 1
HR - Croazia 1
HU - Ungheria 1
IR - Iran 1
JO - Giordania 1
KE - Kenya 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
Totale 6.033
Salva come PNG Salva come JPEG
Città #
Dublin 639
Chandler 499
Jacksonville 389
Singapore 351
Hong Kong 242
Santa Clara 211
Boardman 172
Izmir 113
L’Aquila 97
Lawrence 82
Princeton 82
New York 78
Nanjing 72
The Dalles 71
San Mateo 69
Wilmington 61
Milan 59
Moscow 59
Ashburn 53
Rome 47
L'aquila 45
Nanchang 39
Los Angeles 28
North Bergen 25
Shenyang 24
Ann Arbor 21
Kunming 21
Helsinki 19
Seattle 18
Guangzhou 17
Mountain View 17
Shanghai 16
São Paulo 16
Verona 15
Cedar Knolls 13
Lissone 13
Woodbridge 13
Hebei 12
Venezia 12
Tianjin 11
Brussels 10
Buffalo 10
Council Bluffs 10
Dallas 10
Falkenstein 10
Zhengzhou 10
Jiaxing 9
Norwalk 9
Tappahannock 9
Beijing 8
Edinburgh 8
Toronto 8
Brasília 7
Changchun 7
Des Moines 7
Falls Church 7
Jinan 7
Centrale 6
Changsha 6
Dong Ket 6
Munich 6
Ningbo 6
Bresso 5
Campinas 5
Lanzhou 5
Lappeenranta 5
Belo Horizonte 4
Curitiba 4
Florence 4
Guarulhos 4
Mumbai 4
Ottawa 4
Pune 4
Sorocaba 4
Stockholm 4
Baghdad 3
Bari 3
Belgrade 3
Bishkek 3
Chicago 3
Dubai 3
Istanbul 3
London 3
Montreal 3
Praia Grande 3
Rio de Janeiro 3
São José dos Campos 3
Washington 3
Zurich 3
Antalya 2
Aquila 2
Atlanta 2
Bogotá 2
Bremen 2
Caraguatatuba 2
Centro 2
Chisinau 2
Contagem 2
Controguerra 2
Copenhagen 2
Totale 4.137
Salva come PNG Salva come JPEG
Nome #
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 179
Exact and approximate algorithms for movement problems on (special classes of) graphs 114
Approximating the Metric TSP in Linear Time 107
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 101
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 97
Approximating the Metric TSP in Linear Time 94
Network Verification via Routing Table Queries 94
Stability of Networks in Stretchable Graphs 91
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 88
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 87
The Max-Distance Network Creation Game on General Host Graphs 87
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 85
Network Verification via Routing Table Queries 84
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 84
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 84
Network Creation Games with Traceroute-Based Strategies 84
Computational Aspects of a 2-player Stackelberg Shortest Paths Tree Game 83
Fault-Tolerant Approximate Shortest-Path Trees 83
Multiple-edge-fault-tolerant approximate shortest-path trees 83
An improved algorithm for computing all the best swap edges of a tree spanner 83
Fault-Tolerant Approximate Shortest-Path Trees 83
Bounded-Distance Network Creation Games 82
Bounded-Distance Network Creation Games 81
Compact and fast sensitivity oracles for single-source distances 81
Dynamic Mechanism Design 80
A faster computation of all the best swap edges of a tree spanner 79
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 79
The max-distance network creation game on general host graphs 79
Almost optimal algorithms for diameter-optimally augmenting trees 79
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 78
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path 76
Dynamic Mechanism Design 76
Polygon-Constrained Motion Planning Problems 76
Locality-Based Network Creation Games 75
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 75
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 74
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 74
Improved Purely Additive Fault-Tolerant Spanners 73
Effcient oracles and routing schemes for replacement paths 73
Locality-based Network Creation Games 72
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 71
Reoptimization of the Shortest Common Superstring Problem (Extended Abstract) 69
Range augmentation problems in static ad-hoc wireless networks 68
Augmenting the Edge-Connectivity of a Spider Tree 68
Locating Facilities on a Network to Minimize their Average Service Radius 66
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 65
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 63
Cutting Bamboo Down to Size 63
Near-optimal deterministic single-source distance sensitivity oracles 63
A novel algorithm for the all-best-swap-edge problem on tree spanners 62
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 59
On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem 57
An Algorithm Composition Scheme Preserving Monotonicity 57
Fair tree connection games with topology-dependent edge cost 57
Hardness of an asymmetric 2-player stackelberg network pricing game 57
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 56
Cutting bamboo down to size 56
Tracking Routes in Communication Networks 54
Network creation games with traceroute-based strategies 53
On the complexity of two dots for narrow boards and few colors 53
Geometric network creation games 53
Tracking routes in communication networks 52
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 50
Reoptimization of steiner trees 50
Topological influence and locality in swap schelling games 50
Reoptimization of the shortest common superstring problem 50
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 49
Fixed-Parameter Sensitivity Oracles 49
Reoptimization of weighted graph and covering problems 47
Reconstructing visibility graphs with simple robots 45
New bounds for the balloon popping problem 45
Discovery of network properties with all-shortest-paths queries 42
Topological influence and locality in swap schelling games 41
Space-Efficient Fault-Tolerant Diameter Oracles 41
Selfish Creation of Social Networks 39
On the tree conjecture for the network creation game 39
Blackout-Tolerant Temporal Spanners 38
New algorithms for Steiner tree reoptimization 38
New approximation algorithms for the heterogeneous weighted delivery problem 38
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games 37
Discovery of network properties with all-shortest-paths queries 37
Sparse Temporal Spanners with Low Stretch 36
New bounds for the balloon popping problem 35
New advances in reoptimizing the minimum Steiner tree problem 33
On the Tree Conjecture for the Network Creation Game 32
Reconstructing visibility graphs with simple robots 32
Almost optimal algorithms for diameter-optimally augmenting trees 30
New reoptimization techniques applied to steiner tree problem 30
Blackout-tolerant temporal spanners 29
Approximate Distance Sensitivity Oracles in Subquadratic Space 28
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances 28
Fault-Tolerant ST-Diameter Oracles 28
Geometric Network Creation Games 26
Finding Diameter-Reducing Shortcuts in Trees 22
Schelling Games with Continuous Types 20
Graph Spanners for Group Steiner Distances 20
Temporal Network Creation Games 20
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard 17
Swapping Mixed-Up Beers to Keep Them Cool 16
Approximate Distance Sensitivity Oracles in Subquadratic Space 16
Totale 6.082
Salva come PNG Salva come JPEG
Categoria #
all - tutte 30.056
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 30.056
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/202049 0 0 0 0 0 0 0 0 0 0 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/20252.052 129 51 145 127 330 197 321 232 418 99 3 0
Totale 6.171