D'ANGELO, GIANLORENZO
 Distribuzione geografica
Continente #
NA - Nord America 4.657
EU - Europa 4.580
AS - Asia 4.081
SA - Sud America 385
AF - Africa 107
OC - Oceania 99
Continente sconosciuto - Info sul continente non disponibili 40
AN - Antartide 1
Totale 13.950
Nazione #
US - Stati Uniti d'America 4.480
RU - Federazione Russa 2.528
CN - Cina 1.307
SG - Singapore 1.163
HK - Hong Kong 576
IT - Italia 370
SE - Svezia 364
DE - Germania 361
BR - Brasile 311
UA - Ucraina 220
GB - Regno Unito 171
KR - Corea 161
JP - Giappone 150
TR - Turchia 138
VN - Vietnam 125
FR - Francia 118
IE - Irlanda 117
CA - Canada 114
IN - India 107
AU - Australia 89
NL - Olanda 66
TW - Taiwan 63
IR - Iran 46
MX - Messico 43
BD - Bangladesh 41
EU - Europa 36
PL - Polonia 34
ES - Italia 32
FI - Finlandia 30
ZA - Sudafrica 29
IQ - Iraq 24
AR - Argentina 23
IL - Israele 23
BE - Belgio 20
PK - Pakistan 19
CH - Svizzera 18
MY - Malesia 18
AT - Austria 17
LT - Lituania 17
KE - Kenya 16
CZ - Repubblica Ceca 15
ID - Indonesia 15
EC - Ecuador 14
GR - Grecia 13
MO - Macao, regione amministrativa speciale della Cina 13
SA - Arabia Saudita 13
UZ - Uzbekistan 13
AE - Emirati Arabi Uniti 11
CL - Cile 11
MA - Marocco 10
NO - Norvegia 10
CO - Colombia 8
DZ - Algeria 8
PH - Filippine 8
PT - Portogallo 8
RO - Romania 8
JO - Giordania 7
NZ - Nuova Zelanda 7
ET - Etiopia 6
DK - Danimarca 5
EG - Egitto 5
LV - Lettonia 5
PS - Palestinian Territory 5
TN - Tunisia 5
VE - Venezuela 5
HR - Croazia 4
NE - Niger 4
NG - Nigeria 4
NP - Nepal 4
OM - Oman 4
TH - Thailandia 4
TT - Trinidad e Tobago 4
UY - Uruguay 4
A2 - ???statistics.table.value.countryCode.A2??? 3
AL - Albania 3
AZ - Azerbaigian 3
BB - Barbados 3
BG - Bulgaria 3
BO - Bolivia 3
HU - Ungheria 3
LK - Sri Lanka 3
MD - Moldavia 3
ML - Mali 3
PE - Perù 3
RE - Reunion 3
RS - Serbia 3
SI - Slovenia 3
SN - Senegal 3
AM - Armenia 2
BS - Bahamas 2
BT - Bhutan 2
BY - Bielorussia 2
CR - Costa Rica 2
EE - Estonia 2
GL - Groenlandia 2
GT - Guatemala 2
KZ - Kazakistan 2
LA - Repubblica Popolare Democratica del Laos 2
LU - Lussemburgo 2
ME - Montenegro 2
Totale 13.914
Città #
Moscow 713
Singapore 616
Chandler 562
Boardman 545
Ashburn 336
Los Angeles 308
Hong Kong 303
The Dalles 240
Dallas 232
New York 191
Shanghai 170
Beijing 164
Milan 153
Seoul 129
Hefei 128
Kitzingen 121
Istanbul 110
Dublin 109
Central 92
Tokyo 91
San Mateo 88
Ogden 78
Santa Clara 64
Munich 58
Guangzhou 57
Seattle 57
São Paulo 54
Strasbourg 37
Turin 36
West Jordan 36
Dong Ket 34
Ho Chi Minh City 34
Frankfurt am Main 33
Montreal 33
Phoenix 33
Columbus 32
Hanover 32
Melbourne 32
Chennai 31
Xi'an 29
Warsaw 28
Amsterdam 27
Atlanta 25
Chicago 25
Brooklyn 24
Rome 24
Wilmington 24
San Jose 23
Sydney 23
Helsinki 22
San Francisco 22
London 21
Shenzhen 21
Stockholm 21
Toronto 21
Las Vegas 20
Mexico City 20
North Bergen 20
Berlin 19
Houston 19
Jiaxing 18
Johannesburg 18
L’Aquila 18
Hanoi 16
Poplar 16
Taipei 16
Boston 15
Kai Yi Wan 15
Denver 14
Ha Kwai Chung 14
Nairobi 14
Nanjing 14
Orem 14
Council Bluffs 13
Brussels 12
Manchester 12
Mumbai 12
Tashkent 12
Vienna 12
Edinburgh 11
Fremont 11
Lahore 11
New Delhi 11
Wuxi 11
Buenos Aires 10
Kuala Lumpur 10
Miami 10
Osaka 10
Rio de Janeiro 10
Vancouver 10
Zurich 10
Adelaide 9
Ankara 9
Central District 9
Dhaka 9
Macao 9
Paris 9
Piscataway 9
Riyadh 9
Ann Arbor 8
Totale 7.130
Nome #
Recommending Links to Maximize the Influence in Social Networks 1.979
Greedily Improving Our Own Closeness Centrality in a Network 156
A loop-free shortest-path routing algorithm for dynamic networks 147
Understanding the power of stigmergy of anonymous agents in discrete environments 140
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation 131
Improving the betweenness centrality of a node by adding links 129
What Can Be Verified Locally? 129
Balancing spreads of influence in a social network 129
Building international doctoral schools in computer science in italy, de nicola’s way 127
Front Matter, Table of Contents, Preface, Organization 125
Better bounds on the adaptivity gap of influence maximization under full-adoption feedback 124
Arc-Flags in Dynamic Graphs 123
Greedily improving our own centrality in a network 123
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback 121
Engineering graph-based models for dynamic timetable information systems 120
Bandwidth constrained multi-interface networks 120
A unified approach for different tasks on rings in robot-based computing systems 118
Coverage Centrality Maximization in Undirected Networks 117
A unified approach for gathering and exclusive searching on rings under weak assumption 116
APPROXIMATION BOUNDS FOR CENTRALITY MAXIMIZATION PROBLEMS 116
Election Control Through Social Influence with Unknown Preferences 115
Fairness in Influence Maximization through Randomization 115
Budgeted Out-Tree Maximization with Submodular Prizes 114
Fairness in Influence Maximization through Randomization 114
Introduction to the special issue SEA 2018 114
Link recommendation for social influence maximization 113
SRLG-Diverse Routing with the Star Property 112
Election control through social influence with voters’ uncertainty 112
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling 111
Exploiting Social Influence to Control Elections Based on Scoring Rules 111
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction 111
A speed-up technique for distributed shortest paths computation 110
Brief announcement: Local distributed verification 109
Recoverable robustness in shunting and timetabling 108
Influence Maximization with Co-Existing Seeds 108
Algorithms for hierarchical and semi-partitioned parallel scheduling 107
Dynamic Arc-Flags in Road Networks 106
Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model 106
Computation and Bribery of Voting Power in Delegative Simple Games 105
Approximation bounds for the minimum k-storage problem 105
Maximizing influence-based group shapley centrality 105
Multi-winner election control via social influence 103
Scheduling Real-Time Mixed-Criticality Jobs 102
Dynamic multi-level overlay graphs for shortest paths 101
Delay Management Problem: Complexity Results and Robust Algorithms 101
Adding Edges for Maximizing Weighted Reachability 101
Improved approximation factor for adaptive influence maximization via simple greedy strategies 101
Unveiling the Truth in Liquid Democracy with Misinformed Voters 100
Influence maximization in the independent cascade model 99
Maintenance of multi-level overlay graphs for timetable queries 98
Vote For Me!: Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems 97
The Shortcut Problem - Complexity and Approximation 97
Gathering of Six Robots on Anonymous Symmetric Rings 96
Approximation Algorithms for Node-Weighted Directed Steiner Problems 95
The Shortcut Problem - Complexity and Algorithms 95
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 95
What can be verified locally? 95
Evaluation of Recoverable-Robust Timetables on Tree Networks 95
Optimal placement of storage nodes in a wireless sensor network 95
The Multi-budget Maximum Weighted Coverage Problem 94
Partially dynamic algorithms for distributed shortest paths and their experimental evaluation 93
Recoverable robust timetables on trees 93
Recommending links through influence maximization 92
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems 92
Group-harmonic and group-closeness maximization - Approximation and engineering 92
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios 91
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks 91
Distance queries in large-scale fully dynamic complex networks 91
Fully Dynamic Maintenance of Arc-Flags in Road Networks 91
Gathering of Robots on Anonymous Grids without multiplicity detection 91
Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases 91
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 90
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities 90
Robust algorithms and price of robustness in shunting problems 90
Leader election and compaction for asynchronous silent programmable matter 90
Gathering six oblivious robots on anonymous symmetric rings 88
Recoverable Robust Timetables: An Algorithmic Approach on Trees 88
Partially dynamic concurrent update of distributed shortest paths 88
Models and algorithms for election control through influence maximization 87
An experimental study of distributed algorithms for shortest paths on real networks 87
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem 86
Recommending links to control elections via social influence 86
Scheduling Real-Time Mixed-Criticality Jobs 86
The Minimum κ-Storage Problem: Complexity, Approximation, and Experimental Analysis 85
Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks 85
Mitigating Negative Influence Diffusion is Hard 85
Exploiting social influence to control elections based on positional scoring rules 84
Minimize the Maximum Duty in Multi-interface Networks 84
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Network 84
Multi-Interface Wireless Networks: Complexity and Algorithms 84
Engineering Graph-Based Models for Dynamic Timetable Information Systems 84
Recoverable Robustness for Train Shunting Problems 83
Finding disjoint paths in networks with star shared risk link groups 83
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks 83
Generalized budgeted submodular set function maximization 83
Blackout-Tolerant Temporal Spanners 82
Efficient algorithms for distributed shortest paths on power-law networks 82
Recoverable-Robust Timetables for Trains on Single-Line Corridors 80
Dynamic update of minimum cost paths in computer networks 79
Sparse Temporal Spanners with Low Stretch 78
Totale 12.033
Categoria #
all - tutte 89.700
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 89.700


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021198 0 0 0 0 0 4 0 3 42 31 2 116
2021/2022909 12 1 39 412 72 51 49 24 104 75 39 31
2022/20231.847 28 65 49 211 164 246 135 271 284 107 229 58
2023/20241.715 68 93 217 82 104 216 119 181 60 284 184 107
2024/20253.460 92 411 517 247 295 227 294 168 240 285 386 298
2025/20265.946 803 621 439 884 803 2.396 0 0 0 0 0 0
Totale 14.091