UniSa - IRIS Institutional Research Information System

RESCIGNO, Adele Anna
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 7.574
NA - Nord America 3.215
EU - Europa 1.016
SA - Sud America 243
AF - Africa 17
OC - Oceania 5
Continente sconosciuto - Info sul continente non disponibili 3
Totale 12.073
Salva come PNG Salva come JPEG
Nazione #
HK - Hong Kong 6.507
US - Stati Uniti d'America 3.157
SG - Singapore 506
IT - Italia 370
CN - Cina 295
BR - Brasile 214
UA - Ucraina 184
RU - Federazione Russa 137
VN - Vietnam 96
DE - Germania 83
IE - Irlanda 77
TR - Turchia 68
FI - Finlandia 42
CA - Canada 38
SE - Svezia 36
KR - Corea 31
GB - Regno Unito 22
IN - India 19
MX - Messico 14
AR - Argentina 10
AT - Austria 10
BD - Bangladesh 10
FR - Francia 9
PL - Polonia 9
ES - Italia 8
NL - Olanda 6
ZA - Sudafrica 6
IR - Iran 5
JP - Giappone 5
RO - Romania 5
CO - Colombia 4
ID - Indonesia 4
IL - Israele 4
IQ - Iraq 4
PK - Pakistan 4
CZ - Repubblica Ceca 3
DZ - Algeria 3
EC - Ecuador 3
KZ - Kazakistan 3
LT - Lituania 3
OM - Oman 3
SI - Slovenia 3
UY - Uruguay 3
AU - Australia 2
BE - Belgio 2
BY - Bielorussia 2
CH - Svizzera 2
CL - Cile 2
DO - Repubblica Dominicana 2
EU - Europa 2
KE - Kenya 2
NZ - Nuova Zelanda 2
PE - Perù 2
PH - Filippine 2
PY - Paraguay 2
SA - Arabia Saudita 2
VE - Venezuela 2
A1 - Anonimo 1
AE - Emirati Arabi Uniti 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BO - Bolivia 1
BW - Botswana 1
BZ - Belize 1
CR - Costa Rica 1
HN - Honduras 1
HU - Ungheria 1
IS - Islanda 1
KI - Kiribati 1
LB - Libano 1
MA - Marocco 1
MD - Moldavia 1
ML - Mali 1
QA - Qatar 1
SO - Somalia 1
TH - Thailandia 1
TN - Tunisia 1
TT - Trinidad e Tobago 1
TZ - Tanzania 1
Totale 12.073
Salva come PNG Salva come JPEG
Città #
Hong Kong 6.501
Ann Arbor 601
Woodbridge 303
Chandler 257
Dallas 252
Jacksonville 233
Wilmington 231
Princeton 204
Houston 168
Ashburn 146
Singapore 136
Dublin 75
Salerno 70
Dearborn 68
Izmir 55
Beijing 50
Andover 45
Nanjing 44
Moscow 35
Dong Ket 33
Pellezzano 31
Boardman 30
Los Angeles 30
Ho Chi Minh City 22
Naples 19
New York 18
The Dalles 18
Mestre 17
São Paulo 17
Düsseldorf 16
Shenyang 16
Hebei 15
Nanchang 15
Ottawa 14
Ferrandina 13
Milan 13
Munich 13
Changsha 12
Columbus 12
Fairfield 12
Florence 12
Hanoi 12
Redwood City 12
Santa Clara 12
Washington 12
Jiaxing 11
Fisciano 9
North Bergen 9
San Diego 9
Ankara 8
Belo Horizonte 8
Council Bluffs 8
Denver 8
Florianópolis 8
Norwalk 8
Toronto 8
Chicago 7
London 7
Montreal 7
Napoli 7
Rio de Janeiro 7
Tianjin 7
Warsaw 7
Boston 6
Chennai 6
Curitiba 6
Nuremberg 6
Pune 6
Seattle 6
Vienna 6
Jinan 5
Johannesburg 5
Phoenix 5
Rome 5
Tokyo 5
Amsterdam 4
Berlin 4
Brooklyn 4
Cambridge 4
Caserta 4
Da Nang 4
Poggiomarino 4
Poplar 4
Rescaldina 4
San Francisco 4
San Jose 4
Afragola 3
Almaty 3
Biên Hòa 3
Castrolibero 3
Guangzhou 3
Helsinki 3
Kranj 3
Lappeenranta 3
Manaus 3
Mercato San Severino 3
Mexico City 3
Monterrey 3
Nola 3
Sennori 3
Totale 10.216
Salva come PNG Salva come JPEG
Nome #
Groups Burning: Analyzing Spreading Processes in Community-Based Networks 920
Coloring Circular Arcs with Applications 796
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width 690
Combinatorial Algorithms 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1–3, 2024, Proceedings 665
Active influence spreading in social networks 490
20th Structural Information and Communication Complexity (SIROCOCO 2013) 452
Fault Tolerant Routing in the Supercube 422
Evangelism in social networks: Algorithms and complexity 415
Optimally Balanced Spanning Tree of the Star Network 393
Getting linear time in graphs of bounded neighborhood diversity 363
Bounds and algorithms for generalized superimposed codes 254
Evangelism in social networks 224
On k-strong conflict-free multicoloring 195
Optimal Polling in Communication Networks 174
Immunization in the Threshold Model: A Parameterized Complexity Study 165
Tight Bounds on Broadcasting with Dynamic Faults 160
Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks 157
Strong Conflict-Free Coloring for Intervals 153
Fast Collective Communication by Packets in the Postal Model 151
Speeding up networks mining via neighborhood diversity 148
Complexity of conflict-free colorings of graphs 144
Efficient Collective Communication in Optical Networks 141
Communication Complexity of Gossiping by Packets 141
Brief announcement: Active information spread in networks 138
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks 135
Active Spreading in Networks 149-162 135
Fast and frugal targeting with incentives 128
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 125
Strong Conflict-Free Coloring for Intervals 124
Special Issue on Structural Information and Communication Complexity 121
An efficient algorithm for group testing with runlength constraints 119
Communication Complexity of Fault-Tolerant Information Diffusion 116
Influence Propagation over Large Scale Social Networks 114
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas 113
Efficient Collective Communication in Optical Networks. 111
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 109
GATHERING WITH MINIMUM COMPLETION TIMEIN SENSOR TREE NETWORKS 108
Collision–Free Path Coloring with Application to Minimum–Delay Gathering in Sensor Networks 107
Gathering with Minimum Delay in Tree Sensor Networks 106
Communication Complexity of Fault-Tolerant Information Diffusion 105
On the Communication Complexity of Polling 104
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 104
Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas 101
Low-weight superimposed codes and related combinatorial structures: Bounds and applications 100
On finding small sets that influence large networks 96
Threshold-bounded dominating set with incentives 96
Fast Gossiping by Short Messages 94
Embedding Graphs onto the Supercube 88
Fault-Tolerance Properties of the Star Interconnection Network 85
Parameterized Complexity of (d, r)-Domination via Modular Decomposition 84
Vertex-Disjoint Spanning Trees on the Star Network with Applications to Fault-Tolerance and Security 82
Optimally Fast Data Gathering in Sensor Networks 82
Whom to befriend to influence people 82
Time-Bounded Influence Diffusion with Incentives 80
Low-weight superimposed codes and their applications 78
Tighter Time Bounds on Broadcasting in Torus Networks in Presence of Dynamic Faults 75
Selected Algorithmic Papers from the International Workshop on Combinatorial Algorithms 2024 74
Optimizing Spread of Influence in Social Networks via Partial Incentives 71
Dual domination 71
Minimum Time Broadcast in Faulty Star Networks 66
Dual domination problems in graphs 64
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures 62
Parameterized Complexity of Immunization in the Threshold Model 60
Fast Gossiping by Short Messages 59
Pervasive Domination 57
Spanning Trees Minimizing Branching Costs 54
Distance Vector Domination 45
(t, r)-Broadcast Domination in Networks 42
Graph Burning in Community-based Networks 39
Vertex Separation in Networks 38
Preface 38
Improved Algorithms and Bounds for List Union-Free Families 36
Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity 33
Parameterized complexity for iterated type partitions and modular-width 33
Iterated Type Partitions 31
Watching Systems with Bounded Probes 18
Red-Blue Unshared Dominators 7
Totale 12.256
Salva come PNG Salva come JPEG
Categoria #
all - tutte 28.704
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 28.704
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021270 0 0 0 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/2025963 40 28 24 44 42 100 126 87 109 53 92 218
2025/20267.428 1.074 3.353 2.481 277 243 0 0 0 0 0 0 0
Totale 12.256