IRIS
D'ANGELO, GIANLORENZO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 8.718
NA - Nord America 5.856
AS - Asia 5.057
SA - Sud America 522
AF - Africa 147
OC - Oceania 103
Continente sconosciuto - Info sul continente non disponibili 40
AN - Antartide 1
Totale 20.444
Salva come PNG Salva come JPEG
Nazione #
RU - Federazione Russa 5.983
US - Stati Uniti d'America 5.641
CN - Cina 1.502
SG - Singapore 1.364
IT - Italia 803
HK - Hong Kong 625
VN - Vietnam 449
BR - Brasile 395
DE - Germania 387
SE - Svezia 366
FR - Francia 241
UA - Ucraina 228
GB - Regno Unito 211
KR - Corea 166
JP - Giappone 161
IN - India 160
TR - Turchia 147
CA - Canada 132
IE - Irlanda 120
AU - Australia 93
NL - Olanda 72
TW - Taiwan 68
BD - Bangladesh 66
MX - Messico 56
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
CL - Cile 23
KE - Kenya 23
BE - Belgio 22
ID - Indonesia 22
MY - Malesia 22
LT - Lituania 20
SA - Arabia Saudita 20
AT - Austria 19
VE - Venezuela 19
CH - Svizzera 18
EC - Ecuador 18
UZ - Uzbekistan 17
PH - Filippine 16
AE - Emirati Arabi Uniti 15
CO - Colombia 15
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 10
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
HR - Croazia 5
MD - Moldavia 5
NG - Nigeria 5
OM - Oman 5
PE - Perù 5
TH - Thailandia 5
AL - Albania 4
BG - Bulgaria 4
GT - Guatemala 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
CI - Costa d'Avorio 3
CR - Costa Rica 3
HU - Ungheria 3
LB - Libano 3
ML - Mali 3
PY - Paraguay 3
RE - Reunion 3
SI - Slovenia 3
SK - Slovacchia (Repubblica Slovacca) 3
BS - Bahamas 2
BT - Bhutan 2
BY - Bielorussia 2
CG - Congo 2
Totale 20.395
Salva come PNG Salva come JPEG
Città #
Moscow 1.493
Singapore 751
Ashburn 590
San Jose 581
Chandler 562
Boardman 548
Rome 425
Hong Kong 337
Los Angeles 331
The Dalles 241
Dallas 234
New York 203
Beijing 179
Shanghai 171
Chicago 158
Milan 156
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
Ogden 78
Santa Clara 67
São Paulo 61
Munich 58
Orem 58
Guangzhou 57
Seattle 57
Chennai 51
Frankfurt am Main 41
Montreal 37
Strasbourg 37
Phoenix 36
Turin 36
West Jordan 36
Melbourne 35
Dong Ket 34
Columbus 32
Hanover 32
Warsaw 32
Amsterdam 31
Atlanta 29
Brooklyn 29
Xi'an 29
Helsinki 25
Poplar 25
Berlin 24
Sydney 24
Toronto 24
Wilmington 24
Da Nang 23
Johannesburg 23
London 23
Shenzhen 23
Stockholm 23
Mexico City 22
San Francisco 22
Houston 21
Las Vegas 21
Council Bluffs 20
Nairobi 20
North Bergen 20
Haiphong 19
Manchester 19
Jiaxing 18
L’Aquila 18
Mumbai 18
Taipei 18
Denver 17
Boston 16
Tashkent 16
Kai Yi Wan 15
Amman 14
Baghdad 14
Ha Kwai Chung 14
Nanjing 14
Dhaka 13
Edinburgh 13
Kuala Lumpur 13
New Delhi 13
Paris 13
Rio de Janeiro 13
Vienna 13
Brussels 12
Lahore 12
Vancouver 12
Ankara 11
Fremont 11
Riyadh 11
Wuxi 11
Buenos Aires 10
Buffalo 10
Erbil 10
Jakarta 10
Totale 10.021
Salva come PNG Salva come JPEG
Nome #
Recommending Links to Maximize the Influence in Social Networks 2.129
Greedily Improving Our Own Closeness Centrality in a Network 212
A loop-free shortest-path routing algorithm for dynamic networks 205
Approximation Algorithms for Node-Weighted Directed Steiner Problems 196
Balancing spreads of influence in a social network 195
Understanding the power of stigmergy of anonymous agents in discrete environments 191
What Can Be Verified Locally? 190
Building international doctoral schools in computer science in italy, de nicola’s way 189
Improving the betweenness centrality of a node by adding links 187
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation 183
Better bounds on the adaptivity gap of influence maximization under full-adoption feedback 182
A unified approach for gathering and exclusive searching on rings under weak assumption 182
Arc-Flags in Dynamic Graphs 181
Bandwidth constrained multi-interface networks 180
Election control through social influence with voters’ uncertainty 179
Greedily improving our own centrality in a network 178
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback 177
Front Matter, Table of Contents, Preface, Organization 175
Budgeted Out-Tree Maximization with Submodular Prizes 173
Election Control Through Social Influence with Unknown Preferences 173
Fairness in Influence Maximization through Randomization 172
APPROXIMATION BOUNDS FOR CENTRALITY MAXIMIZATION PROBLEMS 171
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction 171
A speed-up technique for distributed shortest paths computation 169
SRLG-Diverse Routing with the Star Property 168
Approximation bounds for the minimum k-storage problem 167
Engineering graph-based models for dynamic timetable information systems 166
Link recommendation for social influence maximization 166
A unified approach for different tasks on rings in robot-based computing systems 165
Introduction to the special issue SEA 2018 164
Fairness in Influence Maximization through Randomization 164
Coverage Centrality Maximization in Undirected Networks 163
Computation and Bribery of Voting Power in Delegative Simple Games 162
Brief announcement: Local distributed verification 161
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling 160
Influence Maximization with Co-Existing Seeds 157
Recoverable robustness in shunting and timetabling 156
Delay Management Problem: Complexity Results and Robust Algorithms 156
Algorithms for hierarchical and semi-partitioned parallel scheduling 156
Maximizing influence-based group shapley centrality 156
Evaluation of Recoverable-Robust Timetables on Tree Networks 155
Improved approximation factor for adaptive influence maximization via simple greedy strategies 155
Scheduling Real-Time Mixed-Criticality Jobs 154
Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model 154
Exploiting Social Influence to Control Elections Based on Scoring Rules 153
Dynamic Arc-Flags in Road Networks 153
Recoverable robust timetables on trees 151
What can be verified locally? 149
Unveiling the Truth in Liquid Democracy with Misinformed Voters 149
Adding Edges for Maximizing Weighted Reachability 148
Group-harmonic and group-closeness maximization - Approximation and engineering 147
Influence maximization in the independent cascade model 146
Gathering of Six Robots on Anonymous Symmetric Rings 146
Multi-winner election control via social influence 146
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 145
The Minimum κ-Storage Problem: Complexity, Approximation, and Experimental Analysis 145
Optimal placement of storage nodes in a wireless sensor network 145
Finding disjoint paths in networks with star shared risk link groups 144
Dynamic multi-level overlay graphs for shortest paths 144
The Shortcut Problem - Complexity and Algorithms 143
Partially dynamic algorithms for distributed shortest paths and their experimental evaluation 143
Gathering six oblivious robots on anonymous symmetric rings 143
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks 143
The Shortcut Problem - Complexity and Approximation 142
Scheduling Real-Time Mixed-Criticality Jobs 142
An experimental study of distributed algorithms for shortest paths on real networks 141
Vote For Me!: Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems 141
Maintenance of multi-level overlay graphs for timetable queries 141
The Multi-budget Maximum Weighted Coverage Problem 141
Leader election and compaction for asynchronous silent programmable matter 141
Models and algorithms for election control through influence maximization 140
Exploiting social influence to control elections based on positional scoring rules 138
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities 138
Robust algorithms and price of robustness in shunting problems 138
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 137
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios 137
Recoverable Robust Timetables: An Algorithmic Approach on Trees 136
Distance queries in large-scale fully dynamic complex networks 136
Fully Dynamic Maintenance of Arc-Flags in Road Networks 136
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems 135
Gathering of Robots on Anonymous Grids without multiplicity detection 133
Partially dynamic concurrent update of distributed shortest paths 132
Engineering Graph-Based Models for Dynamic Timetable Information Systems 132
Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases 132
Improving Fairness in Information Exposure by Adding Links 130
Blackout-Tolerant Temporal Spanners 129
How to Gather Asynchronous Oblivious Robots on Anonymous Rings 129
Recommending links through influence maximization 129
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Network 129
Mitigating Negative Influence Diffusion is Hard 129
Minimize the Maximum Duty in Multi-interface Networks 128
Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks 128
Recoverable Robustness for Train Shunting Problems 127
Gathering on rings under the Look-Compute-Move model 127
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem 127
Generalized budgeted submodular set function maximization 126
Fully dynamic update of arc-flags 125
Recommending links to control elections via social influence 125
Efficient algorithms for distributed shortest paths on power-law networks 125
Gathering of robots on anonymous grids and trees without multiplicity detection 123
Totale 17.253
Salva come PNG Salva come JPEG
Categoria #
all - tutte 99.149
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 99.149
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021149 0 0 0 0 0 0 0 0 0 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/202612.440 803 621 439 884 803 6.229 1.124 325 823 389 0 0
Totale 20.585