IRIS
PROIETTI, GUIDO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.713
AS - Asia 3.782
EU - Europa 3.636
SA - Sud America 440
AF - Africa 63
Continente sconosciuto - Info sul continente non disponibili 16
OC - Oceania 3
Totale 14.653
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.623
SG - Singapore 1.560
CN - Cina 871
IE - Irlanda 856
IT - Italia 583
TR - Turchia 572
RU - Federazione Russa 549
BR - Brasile 374
DE - Germania 370
HK - Hong Kong 325
GB - Regno Unito 273
SE - Svezia 270
UA - Ucraina 249
VN - Vietnam 208
FR - Francia 202
FI - Finlandia 147
IN - India 63
CA - Canada 47
JP - Giappone 31
NL - Olanda 29
BE - Belgio 28
BD - Bangladesh 27
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
AE - Emirati Arabi Uniti 8
CL - Cile 8
ID - Indonesia 8
MA - Marocco 8
SA - Arabia Saudita 8
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
JM - Giamaica 4
JO - Giordania 4
LB - Libano 4
LT - Lituania 4
NP - Nepal 4
AZ - Azerbaigian 3
BB - Barbados 3
BH - Bahrain 3
CR - Costa Rica 3
IL - Israele 3
KR - Corea 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
CI - Costa d'Avorio 2
CZ - Repubblica Ceca 2
DK - Danimarca 2
GA - Gabon 2
GE - Georgia 2
GR - Grecia 2
HN - Honduras 2
KG - Kirghizistan 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
GY - Guiana 1
HR - Croazia 1
HU - Ungheria 1
IR - Iran 1
LC - Santa Lucia 1
Totale 14.645
Salva come PNG Salva come JPEG
Città #
Jacksonville 977
Singapore 890
Dublin 856
Chandler 821
San Jose 697
Dallas 413
Ashburn 366
Hong Kong 319
Santa Clara 319
Boardman 311
Izmir 258
Nanjing 205
The Dalles 196
Council Bluffs 178
San Mateo 169
New York 151
Wilmington 147
Lawrence 131
Princeton 131
Moscow 115
L’Aquila 96
Milan 90
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 47
Beijing 45
Tianjin 45
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
Chicago 15
Falls Church 15
Jinan 15
Manchester 15
Warsaw 15
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
Phoenix 7
San Francisco 7
Santiago 7
Taizhou 7
Turin 7
Totale 9.647
Salva come PNG Salva come JPEG
Nome #
La teoria degli algoritmi nella scuola secondaria di secondo grado 286
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 212
Exact and approximate algorithms for movement problems on (special classes of) graphs 154
Learning and teaching programming with cognitive apprenticeship 151
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 147
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 145
On the clustered shortest-path tree problem 141
On the Approximability of TSP on Local Modifications of Optimally Solved Instances 140
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor 140
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 137
Approximating the Metric TSP in Linear Time 136
Teaching Informatics in Italian Secondary Schools after the Reform 135
Rational Fair Consensus in the Gossip Model 135
Approximating the Metric TSP in Linear Time 133
An Efficient Spatial Access Method for Spatial Images Containing Multiple Non-Overlapping Features 132
Network Verification via Routing Table Queries 132
Network creation games with traceroute-based strategies 132
Optimizing Nozzle Travel Time in Proton Therapy 131
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 131
Fault-Tolerant Approximate Shortest-Path Trees 129
Dual-mode greedy algorithms can save energy 129
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 129
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 127
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality 126
Effcient oracles and routing schemes for replacement paths 125
Compact and fast sensitivity oracles for single-source distances 124
Sequence hypergraphs 124
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 123
Bounded-Distance Network Creation Games 122
Fault-Tolerant Approximate Shortest-Path Trees 122
Stability of Networks in Stretchable Graphs 122
On k-Connectivity Problems with Sharpened Triangle Inequality 122
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 121
Bounded-Distance Network Creation Games 121
Dynamic Mechanism Design 120
Time and Space Efficient Secondary Memory Representation of Quadtrees 120
Finding the Most Vital Node of a Shortest Path 119
The Max-Distance Network Creation Game on General Host Graphs 119
Analysis of Range Queries and Self Spatial Join Queries on Real Region Datasets Stored Using an R-tree 118
A Generalized Comparison of Linear Representations of Thematic Layers 118
Multiple-edge-fault-tolerant approximate shortest-path trees 117
A Manifesto for Applied Data Science - Reasoning from a Business Perspective 116
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 116
A faster computation of all the best swap edges of a tree spanner 116
Stability of reapproximation algorithms for the β-metric traveling Salesman (path) problem 116
Accurate Modeling of Region Data 115
An improved algorithm for computing all the best swap edges of a tree spanner 115
Cutting Bamboo Down to Size 115
Truthful Mechanisms for Building Trust in E-Commerce 115
Network Creation Games with Traceroute-Based Strategies 115
Cutting bamboo down to size 115
Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases 114
ATM Layouts with Bounded Hop Count and Congestion 114
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 114
Intersection Reporting on Two Collections of Disjoint Sets 113
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 113
Quality of Service in Wireless Networks 112
Improved Purely Additive Fault-Tolerant Spanners 112
Computational Aspects of a 2-player Stackelberg Shortest Paths Tree Game 111
Hardness of an asymmetric 2-player stackelberg network pricing game 111
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 109
Dynamic Mechanism Design 109
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 109
Network Verification via Routing Table Queries 108
Sequence hypergraphs: Paths, flows, and cuts 108
Polygon-Constrained Motion Planning Problems 108
A Faster Computation of the Most Vital Edge of a Shortest Path 107
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications 107
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 107
Locality-based Network Creation Games 107
The max-distance network creation game on general host graphs 107
Exact and Approximate Truthful Mechanisms for the Shortest-Paths Tree Problem 106
Probabilistic Models for Images and Quadtrees: Differences and Equivalences 106
An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks 105
Range augmentation problems in static ad-hoc wireless networks 105
Path-Fault-Tolerant Approximate Shortest-Path Trees 105
Efficient Unbalanced Merge-Sort 104
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures 104
Dynamically Maintaining Shortest Path Trees under Batches of Updates 104
Tracking Routes in Communication Networks 104
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 104
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path 103
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures 103
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 103
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 103
On the Stability of Approximation for Hamiltonian Path Problems 102
Access Methods and Query Processing Techniques 102
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 101
How to Swap a Failing Edge of a Single Source Shortest Paths Tree 100
Strongly Polynomial-Time Truthful Mechanisms in One Shot 100
Efficient Secondary Memory Processing of Window Queries on Spatial Data 99
Locality-Based Network Creation Games 99
Swapping a Failing Edge of a Single Source Shortest Paths Tree is Good and Fast 98
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem 98
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor 97
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 96
Informatica: didattica possibile e pensiero computazionale 96
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths 96
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 96
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation 94
Totale 11.834
Salva come PNG Salva come JPEG
Categoria #
all - tutte 59.803
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 59.803
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202134 0 0 0 0 0 0 0 0 0 0 0 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.358 170 441 271 505 400 329 765 182 435 581 240 39
Totale 14.750