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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022599 0 0 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.379 170 441 271 505 400 329 765 182 435 581 240 60
2026/2027315 119 178 18 0 0 0 0 0 0 0 0 0
Totale 15.086