CNR Institutional Research Information System

PROIETTI, GUIDO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 1.521
NA - Nord America 1.391
SA - Sud America 288
EU - Europa 229
AF - Africa 22
OC - Oceania 5
Continente sconosciuto - Info sul continente non disponibili 1
Totale 3.457
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.340
SG - Singapore 664
CN - Cina 278
BR - Brasile 231
VN - Vietnam 160
HK - Hong Kong 151
FR - Francia 82
KR - Corea 58
NL - Olanda 48
ID - Indonesia 34
BD - Bangladesh 31
IT - Italia 29
TH - Thailandia 24
JP - Giappone 23
CA - Canada 22
GB - Regno Unito 19
IN - India 17
DE - Germania 14
VE - Venezuela 13
CO - Colombia 12
PH - Filippine 12
AR - Argentina 11
EC - Ecuador 9
IL - Israele 9
MY - Malesia 9
FI - Finlandia 8
MX - Messico 8
IQ - Iraq 7
PK - Pakistan 7
TR - Turchia 7
CL - Cile 6
SA - Arabia Saudita 6
ZA - Sudafrica 6
JO - Giordania 5
PE - Perù 5
AU - Australia 4
HN - Honduras 4
JM - Giamaica 4
NP - Nepal 4
RU - Federazione Russa 4
TN - Tunisia 4
AL - Albania 3
CR - Costa Rica 3
SE - Svezia 3
UZ - Uzbekistan 3
AE - Emirati Arabi Uniti 2
BH - Bahrain 2
DZ - Algeria 2
EE - Estonia 2
ES - Italia 2
GT - Guatemala 2
KZ - Kazakistan 2
MA - Marocco 2
NG - Nigeria 2
PT - Portogallo 2
UA - Ucraina 2
AT - Austria 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BB - Barbados 1
BM - Bermuda 1
CG - Congo 1
CH - Svizzera 1
DO - Repubblica Dominicana 1
EG - Egitto 1
GE - Georgia 1
GL - Groenlandia 1
GM - Gambi 1
GR - Grecia 1
IE - Irlanda 1
IR - Iran 1
KE - Kenya 1
KN - Saint Kitts e Nevis 1
KW - Kuwait 1
KY - Cayman, isole 1
LB - Libano 1
LT - Lituania 1
LV - Lettonia 1
MD - Moldavia 1
PA - Panama 1
PG - Papua Nuova Guinea 1
PL - Polonia 1
PR - Porto Rico 1
PY - Paraguay 1
RE - Reunion 1
RS - Serbia 1
SC - Seychelles 1
SK - Slovacchia (Repubblica Slovacca) 1
TJ - Tagikistan 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 3.457
Salva come PNG Salva come JPEG
Città #
Santa Clara 747
Singapore 409
Hong Kong 149
Hefei 133
Lauterbourg 75
San Jose 73
Ho Chi Minh City 62
Ashburn 59
Seoul 58
Beijing 38
Los Angeles 37
Hanoi 30
Bangkok 21
Dallas 21
Jakarta 18
New York 15
Council Bluffs 14
São Paulo 14
Tokyo 11
Chicago 10
Minamishinagawa 9
Phoenix 9
Brooklyn 8
Brasília 7
Frankfurt am Main 7
Helsinki 7
Rio de Janeiro 7
Belo Horizonte 6
Buffalo 6
Caracas 6
Da Nang 6
Dhaka 6
Kansas City 6
Manila 6
Amman 5
Biên Hòa 5
Campinas 5
Fortaleza 5
Houston 5
Orem 5
Philadelphia 5
Quito 5
Toronto 5
Amsterdam 4
Baltimore 4
Bengaluru 4
Brownsville 4
Chennai 4
Denver 4
Guayaquil 4
Hải Dương 4
Kingston 4
Memphis 4
Newark 4
Porto Alegre 4
Recife 4
St Louis 4
Thái Nguyên 4
Wuhan 4
Albany 3
Atlanta 3
Baghdad 3
Bogotá 3
Campina Grande 3
Cypress 3
Haiphong 3
Hangzhou 3
Jeddah 3
Joinville 3
Kaifeng 3
Kitchener 3
Kuala Lumpur 3
Kuala Selangor 3
Lima 3
London 3
Maringá 3
Naples 3
Nova Iguaçu 3
Osaka 3
Salvador 3
Tashkent 3
Tegucigalpa 3
The Dalles 3
Tirana 3
Turin 3
Alegrete 2
Austin 2
Bekasi 2
Bensalem 2
Berkeley 2
Boardman 2
Bologna 2
Cachoeirinha 2
Can Tho 2
Caçapava 2
Chengdu 2
Cincinnati 2
Columbus 2
Curitiba 2
Des Moines 2
Totale 2.307
Salva come PNG Salva come JPEG
Nome #
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation 95
An improved algorithm for computing all the best swap edges of a tree spanner 79
Locating Facilities on a Network to Minimize their Average Service Radius 73
Strongly Polynomial-Time Truthful Mechanisms in One Shot 67
On the Approximability of TSP on Local Modifications of Optimally Solved Instances 67
Effcient oracles and routing schemes for replacement paths 66
Sequence Hypergraphs 62
On $k$-Edge-Connectivity Problems with Sharpened Triangle Inequality 50
Sequence hypergraphs: Paths, flows, and cuts 49
Fault-Tolerant Approximate Shortest-Path Trees 49
Accurate Modeling of Region Data 47
Network verification via routing table queries 45
{ATM} Layouts with Bounded Hop Count and Congestion 44
Rational Fair Consensus in the Gossip Model 44
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 44
An Improved Upper Bound for Scalable Distributed Search Trees 43
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges 43
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems 42
Multiple-edge-fault-tolerant approximate shortest-path trees 42
An {RP}$^*$ Extension with Amortized Almost Constant Costs 41
Simple and practically efficient fault-Tolerant 2-hop cover labelings 41
Exact and approximate algorithms for movement problems on (special classes of) graphs 41
Bounded-Distance Network Creation Games 40
Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: New algorithms and experiments 40
Compact and fast sensitivity oracles for single-source distances 40
Quality of Service in Wireless Networks 39
Dual-mode greedy algorithms can save energy 39
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems 38
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 38
Network creation games with traceroute-based strategies 38
Access Methods and Query Processing Techniques 38
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 38
Hardness of Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem 37
Polynomial time algorithms for 2-edge-connectivity augmentation problems 37
On the clustered shortest-path tree problem 37
Efficient Truthful Mechanisms for the Single-source Shortest Paths Tree Problem 37
Reusing Optimal TSP Solutions for Locally Modified Input Instances 37
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems 36
Network creation games with traceroute-based strategies 35
The Max-Distance Network Creation Game on General Host Graphs 35
A Generalized Comparison of Linear Representations of Thematic Layers 35
Cutting bamboo down to size 35
On the stability of approximation for Hamiltonian path problems 34
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals 34
Range augmentation problems in static ad-hoc wireless networks 34
Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs 34
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 34
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem 34
Fair Leader Election among Selfish Agents 34
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications 33
Finding the Most Vital Node of a Shortest Path 33
Augmentation problems and network matrices 33
Polygon-Constrained Motion Planning Problems 33
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 33
An RP* Extension with Amortized Almost Constant Costs 33
Efficient Unbalanced Merge-Sort 33
An Algorithm Composition Scheme Preserving Monotonicity 33
Hardness of an asymmetric 2-player stackelberg network pricing game 33
On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem 32
On the Hardness of Constructing Minimal Biconnected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality 32
Local-knowledge Network Creation Games 32
Tracking routes in communication networks 32
Locality-Based Network Creation Games 32
Polynomial-time algorithms for edge-connectivity augmentation of {H}amiltonian paths 32
Dynamic Mechanism Design 32
Specializations and generalizations of the Stackelberg minimum spanning tree game 32
Improved Purely Additive FaultTolerant Spanners 31
Special Issue: {SIROCCO 2000} 31
Edge-connectivity augmentation and network matrices 31
Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases 30
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor 30
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures 30
Exact and Approximate Truthful Mechanisms for the Shortest-Paths Tree Problem 30
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree 30
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree 30
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks 30
Optimal MST Maintainace for Transient Deletion of Every Node in Planar Graphs 29
Swapping a Failing Edge of a Single Source Shortest Paths Tree is Good and Fast 29
On $k$-Edge-Connectivity Problems with Sharpened Triangle Inequality 29
Path-Fault-Tolerant Approximate Shortest-Path Trees 29
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii 29
A Faster Computation of All the Best Swap Edges of a Tree Spanner 29
Dynamically Maintaining Shortest Path Trees Under Batches of Updates 29
On the Stability of Approximation for Hamiltonian Path Problems 28
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 28
A Faster Computation of the Most Vital Edge of a Shortest Path 27
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem 26
Fault-tolerant approximate shortest-path trees 26
Bounded-Distance Network Creation Games 26
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 26
Finding the Most Vital Node of a Shortest Path 26
The Max-Distance Network Creation Game on General Host Graphs 24
Totale 3.457
Salva come PNG Salva come JPEG
Categoria #
all - tutte 11.565
article - articoli 6.580
book - libri 114
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 531
Totale 18.790
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2024/20251.537 7 13 81 49 648 95 0 34 13 52 301 244
2025/20261.589 67 140 166 218 241 51 344 131 82 112 20 17
2026/2027331 70 99 162 0 0 0 0 0 0 0 0 0
Totale 3.457