D'ANGELO, GIANLORENZO
 Distribuzione geografica
Continente #
NA - Nord America 3.281
AS - Asia 2.135
EU - Europa 1.714
OC - Oceania 77
AF - Africa 39
Continente sconosciuto - Info sul continente non disponibili 39
SA - Sud America 32
Totale 7.317
Nazione #
US - Stati Uniti d'America 3.229
CN - Cina 718
HK - Hong Kong 481
SG - Singapore 442
SE - Svezia 346
IT - Italia 337
DE - Germania 304
UA - Ucraina 213
TR - Turchia 120
IE - Irlanda 113
JP - Giappone 104
FR - Francia 85
GB - Regno Unito 79
AU - Australia 70
NL - Olanda 53
CA - Canada 44
VN - Vietnam 42
EU - Europa 36
TW - Taiwan 35
IN - India 30
IR - Iran 30
KR - Corea 27
BR - Brasile 20
FI - Finlandia 20
BE - Belgio 17
ES - Italia 17
IL - Israele 17
CH - Svizzera 16
AT - Austria 15
CZ - Repubblica Ceca 14
MO - Macao, regione amministrativa speciale della Cina 12
MY - Malesia 12
KE - Kenya 11
GR - Grecia 10
NO - Norvegia 10
PK - Pakistan 10
RU - Federazione Russa 10
ID - Indonesia 9
LT - Lituania 7
RO - Romania 7
IQ - Iraq 6
PT - Portogallo 6
ZA - Sudafrica 6
AE - Emirati Arabi Uniti 5
BD - Bangladesh 5
ET - Etiopia 5
NZ - Nuova Zelanda 5
PH - Filippine 5
PL - Polonia 5
SA - Arabia Saudita 5
CL - Cile 4
DK - Danimarca 4
DZ - Algeria 4
MA - Marocco 4
NG - Nigeria 4
A2 - ???statistics.table.value.countryCode.A2??? 3
BG - Bulgaria 3
EC - Ecuador 3
EG - Egitto 3
HR - Croazia 3
HU - Ungheria 3
LK - Sri Lanka 3
LV - Lettonia 3
MX - Messico 3
AL - Albania 2
AZ - Azerbaigian 2
BT - Bhutan 2
CO - Colombia 2
GL - Groenlandia 2
LA - Repubblica Popolare Democratica del Laos 2
LU - Lussemburgo 2
ME - Montenegro 2
NC - Nuova Caledonia 2
NP - Nepal 2
OM - Oman 2
RS - Serbia 2
SI - Slovenia 2
TH - Thailandia 2
AR - Argentina 1
BN - Brunei Darussalam 1
BO - Bolivia 1
BS - Bahamas 1
BY - Bielorussia 1
BZ - Belize 1
CR - Costa Rica 1
EE - Estonia 1
GH - Ghana 1
KW - Kuwait 1
KZ - Kazakistan 1
LB - Libano 1
MD - Moldavia 1
PE - Perù 1
PS - Palestinian Territory 1
SK - Slovacchia (Repubblica Slovacca) 1
ZW - Zimbabwe 1
Totale 7.317
Città #
Chandler 562
Boardman 545
Hong Kong 248
The Dalles 220
Los Angeles 217
Singapore 217
Shanghai 169
Milan 151
New York 138
Kitzingen 121
Istanbul 108
Dublin 105
Central 92
San Mateo 88
Ogden 78
Tokyo 57
Guangzhou 54
Ashburn 52
Santa Clara 48
Seattle 41
Strasbourg 37
Beijing 36
West Jordan 36
Dong Ket 34
Turin 34
Hanover 32
Xi'an 28
Frankfurt am Main 26
Melbourne 26
Wilmington 23
Shenzhen 21
North Bergen 20
Helsinki 19
Las Vegas 19
Rome 19
Berlin 18
Jiaxing 18
Munich 18
L’Aquila 17
Amsterdam 16
Sydney 16
Kai Yi Wan 15
Toronto 14
Nanjing 13
Phoenix 13
Brussels 12
Council Bluffs 12
San Jose 12
Chicago 11
Edinburgh 11
San Francisco 11
Vienna 11
Wuxi 11
Fremont 10
Nairobi 10
Osaka 10
Taipei 10
Central District 9
Lahore 9
Adelaide 8
Ann Arbor 8
Cork 8
London 8
Macao 8
Oslo 8
Piscataway 8
Redwood City 8
Zurich 8
Alexandria 7
Brno 7
Cambridge 7
Dallas 7
Dongyang 7
Hangzhou 7
Houston 7
Kocaeli 7
Kuala Lumpur 7
Madrid 7
Pescara 7
Washington 7
Bordeaux 6
Brisbane 6
Buffalo 6
Clifton 6
Fuzhou 6
Kowloon 6
Miami 6
Paris 6
Quanzhou 6
Venice 6
Zhengzhou 6
Canberra 5
Ha Kwai Chung 5
Ho Chi Minh City 5
Kansas City 5
McLean 5
Minneapolis 5
Nuremberg 5
Olomouc 5
Salt Lake City 5
Totale 4.295
Nome #
Recommending Links to Maximize the Influence in Social Networks 1.597
Understanding the power of stigmergy of anonymous agents in discrete environments 87
A loop-free shortest-path routing algorithm for dynamic networks 85
Greedily Improving Our Own Closeness Centrality in a Network 81
Engineering graph-based models for dynamic timetable information systems 78
What Can Be Verified Locally? 77
Coverage Centrality Maximization in Undirected Networks 74
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation 68
Front Matter, Table of Contents, Preface, Organization 68
Election Control Through Social Influence with Unknown Preferences 66
Improving the betweenness centrality of a node by adding links 64
Recoverable robustness in shunting and timetabling 64
The Shortcut Problem - Complexity and Algorithms 63
Introduction to the special issue SEA 2018 63
Balancing spreads of influence in a social network 62
Greedily improving our own centrality in a network 61
Arc-Flags in Dynamic Graphs 60
Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model 59
Link recommendation for social influence maximization 59
Multi-winner election control via social influence 59
Exploiting Social Influence to Control Elections Based on Scoring Rules 58
Better bounds on the adaptivity gap of influence maximization under full-adoption feedback 57
Election control through social influence with voters’ uncertainty 57
Influence Maximization with Co-Existing Seeds 57
The Shortcut Problem - Complexity and Approximation 56
Influence maximization in the independent cascade model 55
Vote For Me!: Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems 55
Building international doctoral schools in computer science in italy, de nicola’s way 55
Dynamic Arc-Flags in Road Networks 55
Bandwidth constrained multi-interface networks 55
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback 55
Maintenance of multi-level overlay graphs for timetable queries 54
Leader election and compaction for asynchronous silent programmable matter 54
Budgeted Out-Tree Maximization with Submodular Prizes 53
APPROXIMATION BOUNDS FOR CENTRALITY MAXIMIZATION PROBLEMS 53
SRLG-Diverse Routing with the Star Property 53
A unified approach for different tasks on rings in robot-based computing systems 53
Evaluation of Recoverable-Robust Timetables on Tree Networks 53
Delay Management Problem: Complexity Results and Robust Algorithms 53
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 52
Scheduling Real-Time Mixed-Criticality Jobs 52
The Multi-budget Maximum Weighted Coverage Problem 52
The Minimum κ-Storage Problem: Complexity, Approximation, and Experimental Analysis 51
What can be verified locally? 51
Dynamic multi-level overlay graphs for shortest paths 51
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems 51
Gathering of Six Robots on Anonymous Symmetric Rings 51
Fairness in Influence Maximization through Randomization 50
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios 50
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks 50
Recommending links through influence maximization 50
Distance queries in large-scale fully dynamic complex networks 50
Brief announcement: Local distributed verification 50
Optimal placement of storage nodes in a wireless sensor network 50
Fully Dynamic Maintenance of Arc-Flags in Road Networks 50
Models and algorithms for election control through influence maximization 49
Recoverable robust timetables on trees 49
A speed-up technique for distributed shortest paths computation 49
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction 49
Maximizing influence-based group shapley centrality 49
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 48
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem 48
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Network 48
Engineering Graph-Based Models for Dynamic Timetable Information Systems 48
Gathering of Robots on Anonymous Grids without multiplicity detection 48
Fairness in Influence Maximization through Randomization 48
Computation and Bribery of Voting Power in Delegative Simple Games 47
Partially dynamic algorithms for distributed shortest paths and their experimental evaluation 47
Robust algorithms and price of robustness in shunting problems 47
Adding Edges for Maximizing Weighted Reachability 47
Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks 47
Partially dynamic concurrent update of distributed shortest paths 46
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities 46
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling 46
Algorithms for hierarchical and semi-partitioned parallel scheduling 46
Recoverable Robustness for Train Shunting Problems 45
Minimize the Maximum Duty in Multi-interface Networks 45
Finding disjoint paths in networks with star shared risk link groups 45
Recommending links to control elections via social influence 45
Multi-Interface Wireless Networks: Complexity and Algorithms 45
Recoverable-Robust Timetables for Trains on Single-Line Corridors 44
Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases 44
Unveiling the Truth in Liquid Democracy with Misinformed Voters 44
Dynamic update of minimum cost paths in computer networks 43
Approximation bounds for the minimum k-storage problem 43
Improved approximation factor for adaptive influence maximization via simple greedy strategies 43
A unified approach for gathering and exclusive searching on rings under weak assumption 42
Mixed-criticality scheduling of sporadic task systems 42
Scheduling Real-Time Mixed-Criticality Jobs 42
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks 42
Sparse Temporal Spanners with Low Stretch 41
Gathering six oblivious robots on anonymous symmetric rings 41
Recoverable Robust Timetables: An Algorithmic Approach on Trees 41
Mitigating Negative Influence Diffusion is Hard 41
Partially dynamic efficient algorithms for distributed shortest paths 40
Exploiting social influence to control elections based on positional scoring rules 39
Generalized budgeted submodular set function maximization 39
Blackout-Tolerant Temporal Spanners 38
Mixed-criticality scheduling 38
Min-Max Coverage in Multi-Interface Networks 38
Totale 6.749
Categoria #
all - tutte 61.940
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 61.940


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021214 0 0 11 3 2 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/20252.766 92 411 517 247 295 227 294 168 240 275 0 0
Totale 7.451