UniSa - IRIS Institutional Research Information System

RESCIGNO, Adele Anna
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.696
EU - Europa 930
AS - Asia 591
SA - Sud America 112
AF - Africa 6
OC - Oceania 4
Continente sconosciuto - Info sul continente non disponibili 3
Totale 4.342
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.673
IT - Italia 349
CN - Cina 225
SG - Singapore 211
UA - Ucraina 183
RU - Federazione Russa 136
BR - Brasile 105
IE - Irlanda 77
DE - Germania 72
TR - Turchia 61
FI - Finlandia 41
VN - Vietnam 33
SE - Svezia 32
KR - Corea 25
CA - Canada 18
GB - Regno Unito 10
HK - Hong Kong 9
AT - Austria 8
FR - Francia 8
IN - India 6
IL - Israele 4
MX - Messico 4
RO - Romania 4
BD - Bangladesh 3
IQ - Iraq 3
AU - Australia 2
CZ - Repubblica Ceca 2
DZ - Algeria 2
ES - Italia 2
EU - Europa 2
IR - Iran 2
NL - Olanda 2
NZ - Nuova Zelanda 2
PH - Filippine 2
PK - Pakistan 2
PL - Polonia 2
A1 - Anonimo 1
AR - Argentina 1
BN - Brunei Darussalam 1
BO - Bolivia 1
BW - Botswana 1
BY - Bielorussia 1
CL - Cile 1
CO - Colombia 1
DO - Repubblica Dominicana 1
EC - Ecuador 1
HU - Ungheria 1
KE - Kenya 1
KZ - Kazakistan 1
MA - Marocco 1
ML - Mali 1
OM - Oman 1
QA - Qatar 1
SA - Arabia Saudita 1
UY - Uruguay 1
VE - Venezuela 1
Totale 4.342
Salva come PNG Salva come JPEG
Città #
Ann Arbor 601
Woodbridge 303
Chandler 257
Jacksonville 232
Wilmington 231
Princeton 204
Houston 168
Ashburn 99
Dublin 75
Salerno 70
Dearborn 68
Singapore 58
Izmir 55
Andover 45
Nanjing 44
Beijing 36
Moscow 35
Dong Ket 33
Pellezzano 31
Boardman 30
Naples 18
Mestre 17
Düsseldorf 16
Shenyang 16
Hebei 15
Nanchang 15
Ottawa 14
Ferrandina 13
Milan 13
Changsha 12
Fairfield 12
Redwood City 12
Washington 12
Jiaxing 11
São Paulo 11
Dallas 10
North Bergen 9
San Diego 9
The Dalles 9
Fisciano 8
Florianópolis 8
Los Angeles 8
Norwalk 8
Santa Clara 8
Hong Kong 7
Napoli 7
Tianjin 7
Pune 6
Rio de Janeiro 6
Jinan 5
London 5
Nuremberg 5
Rome 5
Seattle 5
Berlin 4
Cambridge 4
Council Bluffs 4
Munich 4
New York 4
Poggiomarino 4
Rescaldina 4
Toronto 4
Vienna 4
Afragola 3
Belo Horizonte 3
Castrolibero 3
Curitiba 3
Guangzhou 3
Helsinki 3
Lappeenranta 3
Mercato San Severino 3
Monterrey 3
Nola 3
Sennori 3
Villenave-d'Ornon 3
Acerra 2
Ankara 2
Barcelona 2
Brescia 2
Brno 2
Caruaru 2
Caserta 2
Des Moines 2
Dormagen 2
Eboli 2
Erbil 2
Groningen 2
Indiana 2
Ivrea 2
Jesolo 2
Maletto 2
Marigliano 2
Ningbo 2
Ribeirão das Neves 2
Rosh Ha‘Ayin 2
Shanghai 2
Shenzhen 2
Sorrento 2
Spinea 2
Springfield 2
Totale 3.139
Salva come PNG Salva come JPEG
Nome #
Evangelism in social networks 179
Active Spreading in Networks 149-162 119
Complexity of conflict-free colorings of graphs 118
Special Issue on Structural Information and Communication Complexity 112
20th Structural Information and Communication Complexity (SIROCOCO 2013) 111
Communication Complexity of Gossiping by Packets 105
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas 103
Coloring Circular Arcs with Applications 99
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 99
Strong Conflict-Free Coloring for Intervals 99
Efficient Collective Communication in Optical Networks. 97
Communication Complexity of Fault-Tolerant Information Diffusion 96
Strong Conflict-Free Coloring for Intervals 95
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 94
Influence Propagation over Large Scale Social Networks 93
Gathering with Minimum Delay in Tree Sensor Networks 92
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks 91
On the Communication Complexity of Polling 90
Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas 89
Collision–Free Path Coloring with Application to Minimum–Delay Gathering in Sensor Networks 87
Fast Gossiping by Short Messages 87
On finding small sets that influence large networks 86
Threshold-bounded dominating set with incentives 82
GATHERING WITH MINIMUM COMPLETION TIMEIN SENSOR TREE NETWORKS 81
Brief announcement: Active information spread in networks 80
Communication Complexity of Fault-Tolerant Information Diffusion 79
Active influence spreading in social networks 77
Optimal Polling in Communication Networks 76
Fault Tolerant Routing in the Supercube 75
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 75
Efficient Collective Communication in Optical Networks 74
Embedding Graphs onto the Supercube 73
Fault-Tolerance Properties of the Star Interconnection Network 73
Optimally Fast Data Gathering in Sensor Networks 71
On k-strong conflict-free multicoloring 69
Optimizing Spread of Influence in Social Networks via Partial Incentives 66
Fast and frugal targeting with incentives 66
Tighter Time Bounds on Broadcasting in Torus Networks in Presence of Dynamic Faults 64
Tight Bounds on Broadcasting with Dynamic Faults 63
Low-weight superimposed codes and related combinatorial structures: Bounds and applications 63
Evangelism in social networks: Algorithms and complexity 59
Whom to befriend to influence people 58
Fast Collective Communication by Packets in the Postal Model 57
Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks 56
Vertex-Disjoint Spanning Trees on the Star Network with Applications to Fault-Tolerance and Security 55
Minimum Time Broadcast in Faulty Star Networks 51
Optimally Balanced Spanning Tree of the Star Network 49
Low-weight superimposed codes and their applications 48
Dual domination problems in graphs 47
Fast Gossiping by Short Messages 46
Dual domination 45
Bounds and algorithms for generalized superimposed codes 39
Groups Burning: Analyzing Spreading Processes in Community-Based Networks 36
Parameterized Complexity of Immunization in the Threshold Model 35
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures 32
Time-Bounded Influence Diffusion with Incentives 30
Improved Algorithms and Bounds for List Union-Free Families 25
Vertex Separation in Networks 24
An efficient algorithm for group testing with runlength constraints 24
Pervasive Domination 21
Parameterized complexity for iterated type partitions and modular-width 17
Combinatorial Algorithms 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1–3, 2024, Proceedings 16
Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity 16
Immunization in the Threshold Model: A Parameterized Complexity Study 16
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width 16
Iterated Type Partitions 16
Speeding up networks mining via neighborhood diversity 15
Getting linear time in graphs of bounded neighborhood diversity 12
(t, r)-Broadcast Domination in Networks 8
Graph Burning in Community-based Networks 1
Parameterized Complexity of (d, r)-Domination via Modular Decomposition 1
Distance Vector Domination 1
Preface 1
Totale 4.521
Salva come PNG Salva come JPEG
Categoria #
all - tutte 15.688
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 15.688
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/202077 0 0 0 0 0 0 0 0 0 0 64 13
2020/2021343 4 33 36 0 44 13 48 3 58 6 53 45
2021/2022389 0 0 0 5 5 9 10 6 50 54 90 160
2022/2023630 60 45 5 83 65 127 0 71 116 6 34 18
2023/2024352 26 54 25 12 30 72 18 8 15 24 9 59
2024/2025656 40 28 24 44 42 100 126 87 109 53 3 0
Totale 4.521