IRIS
PROIETTI, GUIDO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.401
AS - Asia 3.279
EU - Europa 3.192
SA - Sud America 387
AF - Africa 45
Continente sconosciuto - Info sul continente non disponibili 16
OC - Oceania 3
Totale 12.323
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.331
SG - Singapore 1.403
IE - Irlanda 855
CN - Cina 803
TR - Turchia 570
IT - Italia 561
DE - Germania 345
BR - Brasile 340
HK - Hong Kong 300
RU - Federazione Russa 300
SE - Svezia 270
GB - Regno Unito 247
UA - Ucraina 247
FI - Finlandia 143
FR - Francia 112
VN - Vietnam 52
IN - India 47
CA - Canada 39
BE - Belgio 26
NL - Olanda 25
MX - Messico 20
PL - Polonia 19
ZA - Sudafrica 17
BD - Bangladesh 16
JP - Giappone 16
IQ - Iraq 15
AR - Argentina 13
ES - Italia 12
EU - Europa 12
CO - Colombia 10
MA - Marocco 8
PK - Pakistan 8
AE - Emirati Arabi Uniti 7
CH - Svizzera 6
PE - Perù 6
EC - Ecuador 5
SA - Arabia Saudita 5
VE - Venezuela 5
JO - Giordania 4
LB - Libano 4
LT - Lituania 4
UZ - Uzbekistan 4
DZ - Algeria 3
ID - Indonesia 3
IL - Israele 3
JM - Giamaica 3
KE - Kenya 3
NI - Nicaragua 3
QA - Qatar 3
RS - Serbia 3
SN - Senegal 3
TN - Tunisia 3
A2 - ???statistics.table.value.countryCode.A2??? 2
AZ - Azerbaigian 2
BB - Barbados 2
BH - Bahrain 2
CR - Costa Rica 2
CZ - Repubblica Ceca 2
EG - Egitto 2
GA - Gabon 2
KG - Kirghizistan 2
MD - Moldavia 2
NO - Norvegia 2
OM - Oman 2
PH - Filippine 2
PY - Paraguay 2
UY - Uruguay 2
XK - ???statistics.table.value.countryCode.XK??? 2
AT - Austria 1
AU - Australia 1
BG - Bulgaria 1
BO - Bolivia 1
BY - Bielorussia 1
CG - Congo 1
CI - Costa d'Avorio 1
CL - Cile 1
CM - Camerun 1
CV - Capo Verde 1
DK - Danimarca 1
EE - Estonia 1
GE - Georgia 1
GR - Grecia 1
GY - Guiana 1
HR - Croazia 1
HU - Ungheria 1
IR - Iran 1
KR - Corea 1
ME - Montenegro 1
MK - Macedonia 1
MY - Malesia 1
NP - Nepal 1
NZ - Nuova Zelanda 1
PW - Palau 1
RO - Romania 1
SR - Suriname 1
TT - Trinidad e Tobago 1
TW - Taiwan 1
Totale 12.323
Salva come PNG Salva come JPEG
Città #
Jacksonville 977
Dublin 855
Chandler 821
Singapore 777
Dallas 411
Boardman 310
Santa Clara 302
Hong Kong 300
Izmir 257
Ashburn 225
Nanjing 205
San Mateo 169
Wilmington 147
New York 138
Lawrence 131
Princeton 131
The Dalles 102
L’Aquila 96
Milan 89
Ann Arbor 88
Nanchang 79
Moscow 67
L'aquila 64
Munich 61
Shenyang 60
Los Angeles 49
Rome 46
Verona 46
Tianjin 45
Kunming 38
Mountain View 38
São Paulo 36
Beijing 35
Hebei 35
Seattle 34
Woodbridge 33
Columbus 30
Hefei 29
North Bergen 29
Brussels 26
Hangzhou 24
Des Moines 23
Shanghai 23
Jiaxing 22
Helsinki 21
Brooklyn 18
Norwalk 18
Zhengzhou 18
San Jose 17
Hanoi 16
Changsha 15
Falls Church 15
Jinan 15
Warsaw 15
Council Bluffs 14
Guangzhou 14
Atlanta 13
Denver 13
Ningbo 13
Stockholm 13
Chicago 12
Turku 12
Venezia 12
Changchun 11
Ho Chi Minh City 11
Johannesburg 11
Rio de Janeiro 11
Tappahannock 11
Lanzhou 10
Manchester 10
Amsterdam 9
Baghdad 9
Belo Horizonte 9
Berlin 9
Poplar 9
Pune 9
Auburn Hills 8
Cedar Knolls 8
Dong Ket 8
Montreal 8
Orem 8
Tokyo 8
Brasília 7
Bresso 7
Charlotte 7
Falkenstein 7
Houston 7
Lissone 7
Mexico City 7
Mumbai 7
Taizhou 7
Centrale 6
Orange 6
Ottawa 6
Pittsburgh 6
Prineville 6
Bologna 5
Chennai 5
Corigliano Calabro 5
Frankfurt am Main 5
Totale 8.077
Salva come PNG Salva come JPEG
Nome #
La teoria degli algoritmi nella scuola secondaria di secondo grado 250
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 190
Learning and teaching programming with cognitive apprenticeship 136
Exact and approximate algorithms for movement problems on (special classes of) graphs 134
On the clustered shortest-path tree problem 123
Approximating the Metric TSP in Linear Time 121
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 121
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 121
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 119
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor 118
Teaching Informatics in Italian Secondary Schools after the Reform 116
Network Verification via Routing Table Queries 114
Rational Fair Consensus in the Gossip Model 114
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 114
On the Approximability of TSP on Local Modifications of Optimally Solved Instances 112
Finding the Most Vital Node of a Shortest Path 111
Fault-Tolerant Approximate Shortest-Path Trees 111
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 108
An Efficient Spatial Access Method for Spatial Images Containing Multiple Non-Overlapping Features 107
Network creation games with traceroute-based strategies 107
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 106
Approximating the Metric TSP in Linear Time 105
Dual-mode greedy algorithms can save energy 104
Stability of Networks in Stretchable Graphs 103
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 103
Compact and fast sensitivity oracles for single-source distances 103
Bounded-Distance Network Creation Games 103
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality 102
Sequence hypergraphs 102
Truthful Mechanisms for Building Trust in E-Commerce 102
Fault-Tolerant Approximate Shortest-Path Trees 101
ATM Layouts with Bounded Hop Count and Congestion 101
Accurate Modeling of Region Data 100
Effcient oracles and routing schemes for replacement paths 100
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 100
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 99
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 99
Computational Aspects of a 2-player Stackelberg Shortest Paths Tree Game 99
On k-Connectivity Problems with Sharpened Triangle Inequality 99
Time and Space Efficient Secondary Memory Representation of Quadtrees 99
The Max-Distance Network Creation Game on General Host Graphs 98
A Generalized Comparison of Linear Representations of Thematic Layers 98
An improved algorithm for computing all the best swap edges of a tree spanner 98
Network Creation Games with Traceroute-Based Strategies 98
A Faster Computation of the Most Vital Edge of a Shortest Path 97
Dynamic Mechanism Design 97
Multiple-edge-fault-tolerant approximate shortest-path trees 97
Optimizing Nozzle Travel Time in Proton Therapy 96
Dynamic Mechanism Design 96
Bounded-Distance Network Creation Games 95
Network Verification via Routing Table Queries 95
An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks 95
Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases 95
Stability of reapproximation algorithms for the β-metric traveling Salesman (path) problem 95
Polygon-Constrained Motion Planning Problems 95
Hardness of an asymmetric 2-player stackelberg network pricing game 94
Cutting Bamboo Down to Size 93
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 93
Cutting bamboo down to size 93
Analysis of Range Queries and Self Spatial Join Queries on Real Region Datasets Stored Using an R-tree 92
A faster computation of all the best swap edges of a tree spanner 92
Quality of Service in Wireless Networks 91
Improved Purely Additive Fault-Tolerant Spanners 91
Dynamically Maintaining Shortest Path Trees under Batches of Updates 91
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 91
A Manifesto for Applied Data Science - Reasoning from a Business Perspective 90
Informatica: didattica possibile e pensiero computazionale 90
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 90
Probabilistic Models for Images and Quadtrees: Differences and Equivalences 90
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 90
Access Methods and Query Processing Techniques 90
Locality-based Network Creation Games 90
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 90
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures 89
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications 89
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 89
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path 88
Strongly Polynomial-Time Truthful Mechanisms in One Shot 88
The max-distance network creation game on general host graphs 88
Intersection Reporting on Two Collections of Disjoint Sets 87
How to Swap a Failing Edge of a Single Source Shortest Paths Tree 87
On the Stability of Approximation for Hamiltonian Path Problems 86
Exact and Approximate Truthful Mechanisms for the Shortest-Paths Tree Problem 86
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 86
Range augmentation problems in static ad-hoc wireless networks 86
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 86
Swapping a Failing Edge of a Single Source Shortest Paths Tree is Good and Fast 85
Path-Fault-Tolerant Approximate Shortest-Path Trees 85
Augmenting the Edge-Connectivity of a Spider Tree 85
Locality-Based Network Creation Games 85
Sequence hypergraphs: Paths, flows, and cuts 85
Tracking Routes in Communication Networks 85
Quality of Service in Wireless Networks 84
Efficient Secondary Memory Processing of Window Queries on Spatial Data 83
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 82
Efficient Unbalanced Merge-Sort 82
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation 82
Finding the Most Vital Node of a Shortest Path 82
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor 82
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures 82
Totale 9.967
Salva come PNG Salva come JPEG
Categoria #
all - tutte 53.442
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 53.442
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021613 0 0 0 0 0 29 146 2 137 39 226 34
2021/2022700 27 74 99 42 39 13 20 47 56 11 52 220
2022/20232.435 172 132 47 252 200 262 4 152 1.072 16 88 38
2023/2024676 180 40 37 85 45 165 16 18 1 43 10 36
2024/20252.671 129 55 217 124 386 186 271 262 537 133 179 192
2025/20262.028 170 441 271 505 400 241 0 0 0 0 0 0
Totale 12.420