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


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/20251.491 92 411 517 247 224 0 0 0 0 0 0 0
Totale 6.176