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