IRIS
D'ANGELO, GIANLORENZO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 6.399
NA - Nord America 4.751
AS - Asia 4.130
SA - Sud America 392
AF - Africa 113
OC - Oceania 99
Continente sconosciuto - Info sul continente non disponibili 40
AN - Antartide 1
Totale 15.925
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.568
RU - Federazione Russa 4.333
CN - Cina 1.310
SG - Singapore 1.170
HK - Hong Kong 577
IT - Italia 370
SE - Svezia 365
DE - Germania 361
BR - Brasile 317
UA - Ucraina 221
GB - Regno Unito 180
KR - Corea 161
JP - Giappone 152
VN - Vietnam 145
TR - Turchia 139
FR - Francia 118
CA - Canada 117
IE - Irlanda 117
IN - India 111
AU - Australia 89
NL - Olanda 66
TW - Taiwan 63
IR - Iran 47
MX - Messico 46
BD - Bangladesh 42
EU - Europa 36
PL - Polonia 34
ES - Italia 33
ZA - Sudafrica 32
FI - Finlandia 30
IQ - Iraq 25
AR - Argentina 23
IL - Israele 23
PK - Pakistan 22
BE - Belgio 21
CH - Svizzera 18
LT - Lituania 18
MY - Malesia 18
AT - Austria 17
KE - Kenya 17
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 12
CL - Cile 11
MA - Marocco 11
NO - Norvegia 10
CO - Colombia 8
DZ - Algeria 8
JO - Giordania 8
PH - Filippine 8
PT - Portogallo 8
RO - Romania 8
NZ - Nuova Zelanda 7
EG - Egitto 6
ET - Etiopia 6
VE - Venezuela 6
DK - Danimarca 5
LV - Lettonia 5
PS - Palestinian Territory 5
TN - Tunisia 5
HR - Croazia 4
KZ - Kazakistan 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
LA - Repubblica Popolare Democratica del Laos 2
LU - Lussemburgo 2
ME - Montenegro 2
Totale 15.888
Salva come PNG Salva come JPEG
Città #
Moscow 1.160
Singapore 622
Chandler 562
Boardman 546
Ashburn 357
Los Angeles 315
Hong Kong 303
The Dalles 240
Dallas 232
New York 197
Shanghai 170
Beijing 164
Milan 153
Seoul 129
Hefei 128
Kitzingen 121
Istanbul 110
Dublin 109
Tokyo 93
Central 92
San Mateo 88
Ogden 78
Santa Clara 66
Munich 58
Guangzhou 57
Seattle 57
São Paulo 57
Ho Chi Minh City 40
Strasbourg 37
Turin 36
West Jordan 36
Chennai 34
Dong Ket 34
Montreal 34
Phoenix 34
Frankfurt am Main 33
Columbus 32
Hanover 32
Melbourne 32
Xi'an 29
Brooklyn 28
San Jose 28
Warsaw 28
Amsterdam 27
Chicago 27
Atlanta 26
Rome 24
Wilmington 24
Sydney 23
Helsinki 22
Poplar 22
San Francisco 22
Stockholm 22
Hanoi 21
Johannesburg 21
London 21
Shenzhen 21
Toronto 21
Las Vegas 20
Mexico City 20
North Bergen 20
Berlin 19
Houston 19
Jiaxing 18
L’Aquila 18
Denver 17
Orem 17
Taipei 16
Boston 15
Kai Yi Wan 15
Nairobi 15
Ha Kwai Chung 14
Nanjing 14
Council Bluffs 13
Manchester 13
Brussels 12
Lahore 12
Mumbai 12
Tashkent 12
Vienna 12
Edinburgh 11
Fremont 11
New Delhi 11
Vancouver 11
Wuxi 11
Ankara 10
Buenos Aires 10
Kuala Lumpur 10
Miami 10
Osaka 10
Rio de Janeiro 10
Zurich 10
Adelaide 9
Central District 9
Dhaka 9
Macao 9
Paris 9
Piscataway 9
Riyadh 9
Amman 8
Totale 7.674
Salva come PNG Salva come JPEG
Nome #
Recommending Links to Maximize the Influence in Social Networks 1.998
Greedily Improving Our Own Closeness Centrality in a Network 174
A loop-free shortest-path routing algorithm for dynamic networks 169
Understanding the power of stigmergy of anonymous agents in discrete environments 155
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation 149
What Can Be Verified Locally? 147
Building international doctoral schools in computer science in italy, de nicola’s way 146
Improving the betweenness centrality of a node by adding links 145
Balancing spreads of influence in a social network 143
Better bounds on the adaptivity gap of influence maximization under full-adoption feedback 142
Arc-Flags in Dynamic Graphs 142
Greedily improving our own centrality in a network 142
Front Matter, Table of Contents, Preface, Organization 142
Bandwidth constrained multi-interface networks 138
A unified approach for gathering and exclusive searching on rings under weak assumption 137
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback 137
SRLG-Diverse Routing with the Star Property 136
A unified approach for different tasks on rings in robot-based computing systems 135
Budgeted Out-Tree Maximization with Submodular Prizes 133
Engineering graph-based models for dynamic timetable information systems 133
Election Control Through Social Influence with Unknown Preferences 133
APPROXIMATION BOUNDS FOR CENTRALITY MAXIMIZATION PROBLEMS 132
Fairness in Influence Maximization through Randomization 131
Introduction to the special issue SEA 2018 131
Coverage Centrality Maximization in Undirected Networks 130
Link recommendation for social influence maximization 130
Fairness in Influence Maximization through Randomization 130
Brief announcement: Local distributed verification 128
A speed-up technique for distributed shortest paths computation 128
Election control through social influence with voters’ uncertainty 127
Exploiting Social Influence to Control Elections Based on Scoring Rules 125
Algorithms for hierarchical and semi-partitioned parallel scheduling 125
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction 124
Influence Maximization with Co-Existing Seeds 124
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling 123
Dynamic Arc-Flags in Road Networks 122
Approximation bounds for the minimum k-storage problem 121
Maximizing influence-based group shapley centrality 121
Improved approximation factor for adaptive influence maximization via simple greedy strategies 121
Computation and Bribery of Voting Power in Delegative Simple Games 120
Recoverable robustness in shunting and timetabling 120
Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model 119
Delay Management Problem: Complexity Results and Robust Algorithms 117
Scheduling Real-Time Mixed-Criticality Jobs 117
Adding Edges for Maximizing Weighted Reachability 117
Multi-winner election control via social influence 117
Unveiling the Truth in Liquid Democracy with Misinformed Voters 116
Approximation Algorithms for Node-Weighted Directed Steiner Problems 115
Dynamic multi-level overlay graphs for shortest paths 115
Vote For Me!: Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems 114
What can be verified locally? 112
Influence maximization in the independent cascade model 112
Maintenance of multi-level overlay graphs for timetable queries 112
Gathering of Six Robots on Anonymous Symmetric Rings 111
The Shortcut Problem - Complexity and Approximation 111
The Shortcut Problem - Complexity and Algorithms 110
Optimal placement of storage nodes in a wireless sensor network 110
Group-harmonic and group-closeness maximization - Approximation and engineering 110
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 109
Gathering six oblivious robots on anonymous symmetric rings 109
Evaluation of Recoverable-Robust Timetables on Tree Networks 109
Recommending links through influence maximization 108
The Multi-budget Maximum Weighted Coverage Problem 108
Models and algorithms for election control through influence maximization 107
Recoverable robust timetables on trees 107
Robust algorithms and price of robustness in shunting problems 107
Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases 107
Partially dynamic algorithms for distributed shortest paths and their experimental evaluation 106
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems 106
Leader election and compaction for asynchronous silent programmable matter 106
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks 105
Recoverable Robust Timetables: An Algorithmic Approach on Trees 105
An experimental study of distributed algorithms for shortest paths on real networks 105
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 104
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios 104
Distance queries in large-scale fully dynamic complex networks 104
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities 104
Fully Dynamic Maintenance of Arc-Flags in Road Networks 104
Gathering of Robots on Anonymous Grids without multiplicity detection 104
Partially dynamic concurrent update of distributed shortest paths 103
The Minimum κ-Storage Problem: Complexity, Approximation, and Experimental Analysis 101
Finding disjoint paths in networks with star shared risk link groups 101
Scheduling Real-Time Mixed-Criticality Jobs 101
Engineering Graph-Based Models for Dynamic Timetable Information Systems 101
Minimize the Maximum Duty in Multi-interface Networks 100
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem 100
Recommending links to control elections via social influence 100
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Network 100
Exploiting social influence to control elections based on positional scoring rules 99
Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks 99
Recoverable Robustness for Train Shunting Problems 98
Efficient algorithms for distributed shortest paths on power-law networks 97
Mitigating Negative Influence Diffusion is Hard 97
Blackout-Tolerant Temporal Spanners 96
Recoverable-Robust Timetables for Trains on Single-Line Corridors 96
Multi-Interface Wireless Networks: Complexity and Algorithms 95
Blackout-tolerant temporal spanners 94
Generalized budgeted submodular set function maximization 94
How to Gather Asynchronous Oblivious Robots on Anonymous Rings 93
Approximating Optimal Labelings for Temporal Connectivity 92
Totale 13.609
Salva come PNG Salva come JPEG
Categoria #
all - tutte 92.357
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 92.357
Salva come PNG Salva come JPEG


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/20267.921 803 621 439 884 803 4.371 0 0 0 0 0 0
Totale 16.066