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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021299 0 0 0 0 0 0 0 0 0 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/20264.024 170 441 271 505 400 329 765 182 435 526 0 0
Totale 14.416