D'ANGELO, GIANLORENZO
 Distribuzione geografica
Continente #
EU - Europa 8.764
NA - Nord America 6.526
AS - Asia 5.296
SA - Sud America 525
AF - Africa 147
OC - Oceania 103
Continente sconosciuto - Info sul continente non disponibili 40
AN - Antartide 1
Totale 21.402
Nazione #
US - Stati Uniti d'America 6.288
RU - Federazione Russa 5.983
CN - Cina 1.578
SG - Singapore 1.426
IT - Italia 839
HK - Hong Kong 628
VN - Vietnam 450
BR - Brasile 395
DE - Germania 387
SE - Svezia 366
FR - Francia 241
UA - Ucraina 229
GB - Regno Unito 217
KR - Corea 166
JP - Giappone 164
IN - India 162
BD - Bangladesh 153
TR - Turchia 147
CA - Canada 146
IE - Irlanda 120
AU - Australia 93
NL - Olanda 75
TW - Taiwan 68
MX - Messico 59
IR - Iran 48
IQ - Iraq 47
ZA - Sudafrica 44
PL - Polonia 42
ES - Italia 41
EU - Europa 36
AR - Argentina 34
FI - Finlandia 34
PK - Pakistan 27
IL - Israele 24
MY - Malesia 24
CL - Cile 23
KE - Kenya 23
BE - Belgio 22
ID - Indonesia 22
EC - Ecuador 20
LT - Lituania 20
SA - Arabia Saudita 20
AT - Austria 19
VE - Venezuela 19
CH - Svizzera 18
AE - Emirati Arabi Uniti 17
UZ - Uzbekistan 17
CO - Colombia 16
PH - Filippine 16
CZ - Repubblica Ceca 15
JO - Giordania 15
GR - Grecia 14
MO - Macao, regione amministrativa speciale della Cina 13
DZ - Algeria 12
MA - Marocco 12
NO - Norvegia 12
NP - Nepal 11
PT - Portogallo 9
RO - Romania 8
TN - Tunisia 8
EG - Egitto 7
KZ - Kazakistan 7
NZ - Nuova Zelanda 7
AZ - Azerbaigian 6
ET - Etiopia 6
LV - Lettonia 6
PS - Palestinian Territory 6
BO - Bolivia 5
DK - Danimarca 5
GT - Guatemala 5
HR - Croazia 5
MD - Moldavia 5
NG - Nigeria 5
OM - Oman 5
PE - Perù 5
TH - Thailandia 5
AL - Albania 4
BG - Bulgaria 4
LK - Sri Lanka 4
NE - Niger 4
RS - Serbia 4
SN - Senegal 4
TT - Trinidad e Tobago 4
UY - Uruguay 4
A2 - ???statistics.table.value.countryCode.A2??? 3
AM - Armenia 3
BB - Barbados 3
BS - Bahamas 3
CI - Costa d'Avorio 3
CR - Costa Rica 3
HU - Ungheria 3
JM - Giamaica 3
LB - Libano 3
ML - Mali 3
PY - Paraguay 3
RE - Reunion 3
SI - Slovenia 3
SK - Slovacchia (Repubblica Slovacca) 3
BT - Bhutan 2
BY - Bielorussia 2
Totale 21.350
Città #
Moscow 1.493
Singapore 752
San Jose 711
Ashburn 610
Chandler 562
Boardman 548
Rome 431
Council Bluffs 365
Hong Kong 339
Los Angeles 339
The Dalles 241
Dallas 239
New York 236
Beijing 184
Shanghai 171
Milan 159
Chicago 158
Ho Chi Minh City 129
Seoul 129
Hefei 128
Kitzingen 121
Lauterbourg 115
Istanbul 112
Dublin 111
Tokyo 99
Hanoi 96
Central 92
San Mateo 88
Santa Clara 88
Ogden 78
São Paulo 61
Orem 59
Munich 58
Seattle 58
Guangzhou 57
Chennai 51
Montreal 43
Frankfurt am Main 41
Phoenix 40
Strasbourg 37
Turin 37
West Jordan 36
Melbourne 35
Dong Ket 34
Amsterdam 33
Columbus 33
Atlanta 32
Hanover 32
Warsaw 32
Brooklyn 30
Xi'an 29
Toronto 27
Helsinki 25
Houston 25
Mexico City 25
Poplar 25
Berlin 24
Shenzhen 24
Sydney 24
Wilmington 24
Da Nang 23
Johannesburg 23
London 23
San Francisco 23
Stockholm 23
Las Vegas 21
Nairobi 20
North Bergen 20
Denver 19
Haiphong 19
Manchester 19
Jiaxing 18
L’Aquila 18
Mumbai 18
Taipei 18
Boston 17
Tashkent 16
Dhaka 15
Kai Yi Wan 15
Amman 14
Baghdad 14
Buffalo 14
Ha Kwai Chung 14
Kuala Lumpur 14
Nanjing 14
Edinburgh 13
New Delhi 13
Paris 13
Rio de Janeiro 13
Vienna 13
Brussels 12
Fremont 12
Lahore 12
Vancouver 12
Ankara 11
Miami 11
Riyadh 11
Wuxi 11
Buenos Aires 10
Erbil 10
Totale 10.644
Nome #
Recommending Links to Maximize the Influence in Social Networks 2.168
Approximation Algorithms for Node-Weighted Directed Steiner Problems 231
Election control through social influence with voters’ uncertainty 229
Greedily Improving Our Own Closeness Centrality in a Network 219
A loop-free shortest-path routing algorithm for dynamic networks 210
Balancing spreads of influence in a social network 208
Understanding the power of stigmergy of anonymous agents in discrete environments 206
Better bounds on the adaptivity gap of influence maximization under full-adoption feedback 205
What Can Be Verified Locally? 202
Building international doctoral schools in computer science in italy, de nicola’s way 194
Budgeted Out-Tree Maximization with Submodular Prizes 192
Improving the betweenness centrality of a node by adding links 191
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation 191
Front Matter, Table of Contents, Preface, Organization 191
Fairness in Influence Maximization through Randomization 189
Arc-Flags in Dynamic Graphs 187
A unified approach for gathering and exclusive searching on rings under weak assumption 186
Greedily improving our own centrality in a network 185
Bandwidth constrained multi-interface networks 185
Approximation bounds for the minimum k-storage problem 181
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback 181
Computation and Bribery of Voting Power in Delegative Simple Games 179
Brief announcement: Local distributed verification 178
Election Control Through Social Influence with Unknown Preferences 177
Maintenance of multi-level overlay graphs for timetable queries 176
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction 176
APPROXIMATION BOUNDS FOR CENTRALITY MAXIMIZATION PROBLEMS 175
A speed-up technique for distributed shortest paths computation 175
A unified approach for different tasks on rings in robot-based computing systems 173
Link recommendation for social influence maximization 172
Engineering graph-based models for dynamic timetable information systems 171
SRLG-Diverse Routing with the Star Property 170
Introduction to the special issue SEA 2018 169
Algorithms for hierarchical and semi-partitioned parallel scheduling 169
Fairness in Influence Maximization through Randomization 169
Coverage Centrality Maximization in Undirected Networks 167
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling 165
Recoverable robustness in shunting and timetabling 162
Maximizing influence-based group shapley centrality 162
Improved approximation factor for adaptive influence maximization via simple greedy strategies 161
Delay Management Problem: Complexity Results and Robust Algorithms 160
Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model 160
Influence Maximization with Co-Existing Seeds 160
Dynamic Arc-Flags in Road Networks 159
Gathering of Six Robots on Anonymous Symmetric Rings 158
Evaluation of Recoverable-Robust Timetables on Tree Networks 158
Scheduling Real-Time Mixed-Criticality Jobs 157
The Minimum κ-Storage Problem: Complexity, Approximation, and Experimental Analysis 156
Exploiting Social Influence to Control Elections Based on Scoring Rules 156
Recoverable robust timetables on trees 155
Adding Edges for Maximizing Weighted Reachability 153
Group-harmonic and group-closeness maximization - Approximation and engineering 153
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 152
What can be verified locally? 152
Unveiling the Truth in Liquid Democracy with Misinformed Voters 152
Influence maximization in the independent cascade model 150
Optimal placement of storage nodes in a wireless sensor network 150
Multi-winner election control via social influence 150
Partially dynamic algorithms for distributed shortest paths and their experimental evaluation 148
Finding disjoint paths in networks with star shared risk link groups 148
The Shortcut Problem - Complexity and Approximation 148
Gathering six oblivious robots on anonymous symmetric rings 147
Flow Problems in Multi-Interface Networks 147
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks 147
Vote For Me!: Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems 147
Scheduling Real-Time Mixed-Criticality Jobs 147
The Shortcut Problem - Complexity and Algorithms 146
Distance queries in large-scale fully dynamic complex networks 146
The Multi-budget Maximum Weighted Coverage Problem 146
Leader election and compaction for asynchronous silent programmable matter 146
Dynamic multi-level overlay graphs for shortest paths 145
An experimental study of distributed algorithms for shortest paths on real networks 145
Exploiting social influence to control elections based on positional scoring rules 144
Models and algorithms for election control through influence maximization 144
Improving Fairness in Information Exposure by Adding Links 143
Approximating Optimal Labelings for Temporal Connectivity 143
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios 143
Gathering on rings under the Look-Compute-Move model 142
Partially dynamic concurrent update of distributed shortest paths 142
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 141
Minimize the Maximum Duty in Multi-interface Networks 141
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities 141
Recoverable Robust Timetables: An Algorithmic Approach on Trees 140
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems 140
Robust algorithms and price of robustness in shunting problems 140
Fully Dynamic Maintenance of Arc-Flags in Road Networks 140
Engineering Graph-Based Models for Dynamic Timetable Information Systems 137
Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases 137
Gathering of Robots on Anonymous Grids without multiplicity detection 135
Blackout-Tolerant Temporal Spanners 134
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem 134
Mitigating Negative Influence Diffusion is Hard 133
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Network 132
Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks 132
Recoverable Robustness for Train Shunting Problems 131
How to Gather Asynchronous Oblivious Robots on Anonymous Rings 131
Recommending links through influence maximization 131
Recommending links to control elections via social influence 130
Generalized budgeted submodular set function maximization 130
Fully dynamic update of arc-flags 129
Totale 18.061
Categoria #
all - tutte 103.934
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 103.934


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021116 0 0 0 0 0 0 0 0 0 0 0 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/202613.398 803 621 439 884 803 6.229 1.124 325 823 491 350 506
Totale 21.543