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