D'ANGELO, GIANLORENZO
 Distribuzione geografica
Continente #
EU - Europa 8.792
NA - Nord America 7.155
AS - Asia 5.334
SA - Sud America 528
Continente sconosciuto - Info sul continente non disponibili 182
AF - Africa 147
OC - Oceania 103
AN - Antartide 1
Totale 22.242
Nazione #
US - Stati Uniti d'America 6.907
RU - Federazione Russa 5.983
CN - Cina 1.598
SG - Singapore 1.427
IT - Italia 859
HK - Hong Kong 630
VN - Vietnam 451
BR - Brasile 396
DE - Germania 387
SE - Svezia 366
FR - Francia 241
UA - Ucraina 229
GB - Regno Unito 220
KR - Corea 166
IN - India 164
JP - Giappone 164
BD - Bangladesh 159
CA - Canada 150
TR - Turchia 148
IE - Irlanda 120
AU - Australia 93
NL - Olanda 78
TW - Taiwan 68
MX - Messico 60
IR - Iran 48
IQ - Iraq 47
ZA - Sudafrica 44
PL - Polonia 43
ES - Italia 42
EU - Europa 36
AR - Argentina 34
FI - Finlandia 34
PK - Pakistan 27
MY - Malesia 25
ID - Indonesia 24
IL - Israele 24
CL - Cile 23
KE - Kenya 23
BE - Belgio 22
EC - Ecuador 21
LT - Lituania 20
SA - Arabia Saudita 20
AE - Emirati Arabi Uniti 19
AT - Austria 19
VE - Venezuela 19
CH - Svizzera 18
CO - Colombia 17
UZ - Uzbekistan 17
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
GT - Guatemala 6
LV - Lettonia 6
PS - Palestinian Territory 6
BO - Bolivia 5
DK - Danimarca 5
HR - Croazia 5
MD - Moldavia 5
NG - Nigeria 5
OM - Oman 5
PE - Perù 5
TH - Thailandia 5
AL - Albania 4
BB - Barbados 4
BG - Bulgaria 4
LK - Sri Lanka 4
NE - Niger 4
NI - Nicaragua 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
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
Totale 22.047
Città #
Moscow 1.493
Council Bluffs 836
Singapore 753
San Jose 713
Ashburn 631
Chandler 562
Boardman 548
Rome 434
Los Angeles 343
Hong Kong 341
Dallas 250
New York 247
The Dalles 242
Beijing 190
Shanghai 171
Milan 163
Chicago 159
Ho Chi Minh City 129
Seoul 129
Hefei 128
Kitzingen 121
Lauterbourg 115
Istanbul 113
Dublin 111
Tokyo 99
Hanoi 97
Santa Clara 94
Central 92
San Mateo 88
Ogden 78
Phoenix 68
São Paulo 61
Orem 59
Seattle 59
Guangzhou 58
Munich 58
Chennai 52
Montreal 44
Frankfurt am Main 41
Turin 39
Strasbourg 37
West Jordan 36
Atlanta 35
Melbourne 35
Dong Ket 34
Amsterdam 33
Brooklyn 33
Columbus 33
Hanover 32
Warsaw 32
Xi'an 29
Toronto 28
Helsinki 25
Houston 25
London 25
Mexico City 25
Poplar 25
San Francisco 25
Berlin 24
Shenzhen 24
Sydney 24
Wilmington 24
Da Nang 23
Johannesburg 23
Stockholm 23
Denver 22
Las Vegas 21
Nairobi 20
North Bergen 20
Haiphong 19
Manchester 19
Jiaxing 18
L’Aquila 18
Mumbai 18
Taipei 18
Boston 17
Tashkent 16
Buffalo 15
Dhaka 15
Kai Yi Wan 15
Kuala Lumpur 15
Amman 14
Baghdad 14
Ha Kwai Chung 14
Nanjing 14
Vancouver 14
Edinburgh 13
New Delhi 13
Paris 13
Rio de Janeiro 13
Vienna 13
Brussels 12
Fremont 12
Lahore 12
Miami 12
Ankara 11
Riyadh 11
Wuxi 11
Buenos Aires 10
Erbil 10
Totale 11.243
Nome #
Recommending Links to Maximize the Influence in Social Networks 2.183
Approximation Algorithms for Node-Weighted Directed Steiner Problems 303
Election control through social influence with voters’ uncertainty 235
Greedily Improving Our Own Closeness Centrality in a Network 223
Understanding the power of stigmergy of anonymous agents in discrete environments 218
A loop-free shortest-path routing algorithm for dynamic networks 215
Balancing spreads of influence in a social network 213
Better bounds on the adaptivity gap of influence maximization under full-adoption feedback 210
What Can Be Verified Locally? 210
Building international doctoral schools in computer science in italy, de nicola’s way 203
Brief announcement: Local distributed verification 198
Improving the betweenness centrality of a node by adding links 197
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation 197
Budgeted Out-Tree Maximization with Submodular Prizes 196
Fairness in Influence Maximization through Randomization 196
Front Matter, Table of Contents, Preface, Organization 195
A unified approach for gathering and exclusive searching on rings under weak assumption 190
Arc-Flags in Dynamic Graphs 190
Greedily improving our own centrality in a network 189
Bandwidth constrained multi-interface networks 187
Approximation bounds for the minimum k-storage problem 185
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback 184
Computation and Bribery of Voting Power in Delegative Simple Games 182
Election Control Through Social Influence with Unknown Preferences 182
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction 180
APPROXIMATION BOUNDS FOR CENTRALITY MAXIMIZATION PROBLEMS 179
A speed-up technique for distributed shortest paths computation 179
Maintenance of multi-level overlay graphs for timetable queries 179
Engineering graph-based models for dynamic timetable information systems 178
A unified approach for different tasks on rings in robot-based computing systems 176
Link recommendation for social influence maximization 176
Fairness in Influence Maximization through Randomization 175
SRLG-Diverse Routing with the Star Property 174
Coverage Centrality Maximization in Undirected Networks 173
Introduction to the special issue SEA 2018 173
Algorithms for hierarchical and semi-partitioned parallel scheduling 173
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling 169
Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model 168
Recoverable robustness in shunting and timetabling 166
Maximizing influence-based group shapley centrality 166
Evaluation of Recoverable-Robust Timetables on Tree Networks 165
Delay Management Problem: Complexity Results and Robust Algorithms 165
Improved approximation factor for adaptive influence maximization via simple greedy strategies 165
Influence Maximization with Co-Existing Seeds 165
Dynamic Arc-Flags in Road Networks 164
Recoverable robust timetables on trees 162
Scheduling Real-Time Mixed-Criticality Jobs 161
The Minimum κ-Storage Problem: Complexity, Approximation, and Experimental Analysis 160
Gathering of Six Robots on Anonymous Symmetric Rings 160
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 159
Adding Edges for Maximizing Weighted Reachability 158
Exploiting Social Influence to Control Elections Based on Scoring Rules 158
What can be verified locally? 156
Unveiling the Truth in Liquid Democracy with Misinformed Voters 156
Group-harmonic and group-closeness maximization - Approximation and engineering 156
Influence maximization in the independent cascade model 155
The Shortcut Problem - Complexity and Approximation 154
Scheduling Real-Time Mixed-Criticality Jobs 154
Optimal placement of storage nodes in a wireless sensor network 154
Multi-winner election control via social influence 154
Partially dynamic algorithms for distributed shortest paths and their experimental evaluation 153
Gathering six oblivious robots on anonymous symmetric rings 152
Distance queries in large-scale fully dynamic complex networks 152
Vote For Me!: Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems 152
The Multi-budget Maximum Weighted Coverage Problem 152
Finding disjoint paths in networks with star shared risk link groups 151
Flow Problems in Multi-Interface Networks 151
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks 151
Improving Fairness in Information Exposure by Adding Links 150
The Shortcut Problem - Complexity and Algorithms 150
Dynamic multi-level overlay graphs for shortest paths 150
An experimental study of distributed algorithms for shortest paths on real networks 150
Leader election and compaction for asynchronous silent programmable matter 150
Gathering on rings under the Look-Compute-Move model 149
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios 149
Approximating Optimal Labelings for Temporal Connectivity 148
Models and algorithms for election control through influence maximization 148
Fully Dynamic Maintenance of Arc-Flags in Road Networks 147
Exploiting social influence to control elections based on positional scoring rules 146
Partially dynamic concurrent update of distributed shortest paths 146
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 145
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems 145
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities 145
Minimize the Maximum Duty in Multi-interface Networks 144
Recoverable Robust Timetables: An Algorithmic Approach on Trees 144
Robust algorithms and price of robustness in shunting problems 144
Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases 143
Engineering Graph-Based Models for Dynamic Timetable Information Systems 142
Gathering of Robots on Anonymous Grids without multiplicity detection 140
Blackout-Tolerant Temporal Spanners 139
Mitigating Negative Influence Diffusion is Hard 139
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem 138
How to Gather Asynchronous Oblivious Robots on Anonymous Rings 137
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Network 137
Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks 137
Recommending links through influence maximization 136
Recoverable Robustness for Train Shunting Problems 135
Fully dynamic update of arc-flags 135
Generalized budgeted submodular set function maximization 135
Recommending links to control elections via social influence 134
Totale 18.637
Categoria #
all - tutte 107.931
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 107.931


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022897 0 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.427 803 621 439 884 803 6.229 1.124 325 823 491 350 535
2026/2027670 336 334 0 0 0 0 0 0 0 0 0 0
Totale 22.242