CNR Institutional Research Information System

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