IRIS
PROIETTI, GUIDO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 4.379
EU - Europa 2.997
AS - Asia 2.328
SA - Sud America 205
Continente sconosciuto - Info sul continente non disponibili 14
AF - Africa 11
OC - Oceania 2
Totale 9.936
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.362
IE - Irlanda 855
SG - Singapore 725
CN - Cina 709
TR - Turchia 563
IT - Italia 536
RU - Federazione Russa 296
DE - Germania 290
SE - Svezia 260
HK - Hong Kong 254
UA - Ucraina 245
GB - Regno Unito 214
BR - Brasile 190
FI - Finlandia 129
FR - Francia 108
IN - India 29
BE - Belgio 25
NL - Olanda 15
EU - Europa 12
CA - Canada 10
VN - Vietnam 10
JP - Giappone 8
CH - Svizzera 6
BD - Bangladesh 4
EC - Ecuador 4
IQ - Iraq 4
PK - Pakistan 4
ZA - Sudafrica 4
AR - Argentina 3
CO - Colombia 3
ES - Italia 3
MX - Messico 3
NI - Nicaragua 3
PE - Perù 3
A2 - ???statistics.table.value.countryCode.A2??? 2
KG - Kirghizistan 2
MA - Marocco 2
MD - Moldavia 2
NO - Norvegia 2
OM - Oman 2
PL - Polonia 2
RS - Serbia 2
TN - Tunisia 2
UY - Uruguay 2
UZ - Uzbekistan 2
AE - Emirati Arabi Uniti 1
AU - Australia 1
AZ - Azerbaigian 1
CR - Costa Rica 1
CZ - Repubblica Ceca 1
DK - Danimarca 1
DZ - Algeria 1
EE - Estonia 1
EG - Egitto 1
GA - Gabon 1
GE - Georgia 1
GR - Grecia 1
HR - Croazia 1
HU - Ungheria 1
ID - Indonesia 1
IL - Israele 1
IR - Iran 1
JO - Giordania 1
KR - Corea 1
NP - Nepal 1
NZ - Nuova Zelanda 1
PH - Filippine 1
QA - Qatar 1
RO - Romania 1
TW - Taiwan 1
Totale 9.936
Salva come PNG Salva come JPEG
Città #
Jacksonville 977
Dublin 855
Chandler 821
Singapore 402
Boardman 310
Santa Clara 283
Izmir 257
Hong Kong 254
Nanjing 205
San Mateo 169
Wilmington 147
Lawrence 131
Princeton 131
New York 119
L’Aquila 96
Ann Arbor 88
Milan 84
Ashburn 82
Nanchang 79
Moscow 67
L'aquila 64
Shenyang 60
The Dalles 55
Verona 46
Rome 45
Tianjin 45
Kunming 38
Mountain View 38
Hebei 35
Woodbridge 33
Seattle 31
North Bergen 29
Brussels 25
Hangzhou 24
Des Moines 22
Jiaxing 22
Shanghai 22
Helsinki 20
Los Angeles 20
Norwalk 18
Zhengzhou 18
São Paulo 17
Beijing 15
Changsha 15
Falls Church 15
Jinan 15
Guangzhou 13
Ningbo 13
Council Bluffs 12
Venezia 12
Changchun 11
Dallas 11
Munich 11
Tappahannock 11
Lanzhou 10
Berlin 9
Auburn Hills 8
Cedar Knolls 8
Dong Ket 8
Pune 8
Falkenstein 7
Lissone 7
Taizhou 7
Centrale 6
Orange 6
Belo Horizonte 5
Bologna 5
Brasília 5
Bresso 5
Corigliano Calabro 5
Lanciano 5
Centro 4
Edinburgh 4
Guarulhos 4
Haikou 4
Houston 4
Mumbai 4
Palermo 4
Rio de Janeiro 4
Washington 4
Aquila 3
Atlanta 3
Cagliari 3
Campinas 3
Fremont 3
Grosseto 3
Istanbul 3
Johannesburg 3
Juiz de Fora 3
Managua 3
Ottawa 3
Praia Grande 3
San Giuseppe Vesuviano 3
Stockholm 3
Zurich 3
Abbiategrasso 2
Antalya 2
Avellino 2
Bari 2
Belgrade 2
Totale 6.643
Salva come PNG Salva come JPEG
Nome #
La teoria degli algoritmi nella scuola secondaria di secondo grado 206
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
Learning and teaching programming with cognitive apprenticeship 106
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor 101
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 101
Finding the Most Vital Node of a Shortest Path 98
On the Approximability of TSP on Local Modifications of Optimally Solved Instances 97
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 97
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 94
Approximating the Metric TSP in Linear Time 94
Network Verification via Routing Table Queries 94
On the clustered shortest-path tree problem 94
Rational Fair Consensus in the Gossip Model 93
Stability of Networks in Stretchable Graphs 91
Teaching Informatics in Italian Secondary Schools after the Reform 91
On k-Connectivity Problems with Sharpened Triangle Inequality 89
An Efficient Spatial Access Method for Spatial Images Containing Multiple Non-Overlapping Features 88
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
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 86
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality 85
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 85
Network Verification via Routing Table Queries 84
An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks 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
Sequence hypergraphs 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
A Faster Computation of the Most Vital Edge of a Shortest Path 82
Bounded-Distance Network Creation Games 82
Bounded-Distance Network Creation Games 81
A Generalized Comparison of Linear Representations of Thematic Layers 81
Compact and fast sensitivity oracles for single-source distances 81
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 81
ATM Layouts with Bounded Hop Count and Congestion 81
Dynamic Mechanism Design 80
Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases 79
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
Truthful Mechanisms for Building Trust in E-Commerce 79
The max-distance network creation game on general host graphs 79
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 78
Probabilistic Models for Images and Quadtrees: Differences and Equivalences 78
Dynamically Maintaining Shortest Path Trees under Batches of Updates 78
How to Swap a Failing Edge of a Single Source Shortest Paths Tree 78
Accurate Modeling of Region Data 77
Informatica: didattica possibile e pensiero computazionale 77
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path 76
Dynamic Mechanism Design 76
Analysis of Range Queries and Self Spatial Join Queries on Real Region Datasets Stored Using an R-tree 76
Polygon-Constrained Motion Planning Problems 76
Swapping a Failing Edge of a Single Source Shortest Paths Tree is Good and Fast 75
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
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications 74
Access Methods and Query Processing Techniques 74
Quality of Service in Wireless Networks 74
Dual-mode greedy algorithms can save energy 74
Time and Space Efficient Secondary Memory Representation of Quadtrees 74
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 74
Intersection Reporting on Two Collections of Disjoint Sets 73
Improved Purely Additive Fault-Tolerant Spanners 73
Effcient oracles and routing schemes for replacement paths 73
Efficient Secondary Memory Processing of Window Queries on Spatial Data 72
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures 72
Locality-based Network Creation Games 72
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 71
Strongly Polynomial-Time Truthful Mechanisms in One Shot 71
On the Stability of Approximation for Hamiltonian Path Problems 70
Finding the Most Vital Node of a Shortest Path 70
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor 70
On the Creation of Quadtrees by Using a Branching Process 69
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation 69
Path-Fault-Tolerant Approximate Shortest-Path Trees 69
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures 69
Efficient Unbalanced Merge-Sort 68
Range augmentation problems in static ad-hoc wireless networks 68
Augmenting the Edge-Connectivity of a Spider Tree 68
Efficient ATM Layouts with Bounded Hop Count and Congestion 66
Quality of Service in Wireless Networks 66
Maintaining a Minimum Spanning Tree Under Transient Node Failures 66
Locating Facilities on a Network to Minimize their Average Service Radius 66
Exact and Approximate Truthful Mechanisms for the Shortest-Paths Tree Problem 65
ATM Layouts with Bounded Hop Count and Congestion 65
An Improved Upper Bound for Scalable Distributed Search Trees 65
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 65
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem 65
Stability of reapproximation algorithms for the β-metric traveling Salesman (path) problem 65
Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases 65
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals 64
Truthful mechanisms for generalized utilitarian problems 64
Totale 8.141
Salva come PNG Salva come JPEG
Categoria #
all - tutte 42.778
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 42.778
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020132 0 0 0 0 0 0 0 0 0 0 7 125
2020/20211.016 14 127 7 129 126 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.310 129 55 217 124 386 186 271 262 537 133 10 0
Totale 10.031