RESCIGNO, Adele Anna
 Distribuzione geografica
Continente #
AS - Asia 4.760
NA - Nord America 2.962
EU - Europa 980
SA - Sud America 153
AF - Africa 10
OC - Oceania 5
Continente sconosciuto - Info sul continente non disponibili 3
Totale 8.873
Nazione #
HK - Hong Kong 4.072
US - Stati Uniti d'America 2.924
IT - Italia 365
SG - Singapore 275
CN - Cina 232
UA - Ucraina 183
BR - Brasile 142
RU - Federazione Russa 136
DE - Germania 83
IE - Irlanda 77
TR - Turchia 65
FI - Finlandia 42
VN - Vietnam 38
SE - Svezia 35
KR - Corea 29
CA - Canada 28
GB - Regno Unito 14
IN - India 14
AT - Austria 10
BD - Bangladesh 8
FR - Francia 8
MX - Messico 8
PL - Polonia 5
IL - Israele 4
IQ - Iraq 4
RO - Romania 4
CZ - Repubblica Ceca 3
ES - Italia 3
JP - Giappone 3
KZ - Kazakistan 3
NL - Olanda 3
PK - Pakistan 3
ZA - Sudafrica 3
AR - Argentina 2
AU - Australia 2
BY - Bielorussia 2
CH - Svizzera 2
CL - Cile 2
DZ - Algeria 2
EC - Ecuador 2
EU - Europa 2
IR - Iran 2
LT - Lituania 2
NZ - Nuova Zelanda 2
OM - Oman 2
PH - Filippine 2
SA - Arabia Saudita 2
A1 - Anonimo 1
BE - Belgio 1
BN - Brunei Darussalam 1
BO - Bolivia 1
BW - Botswana 1
CO - Colombia 1
DO - Repubblica Dominicana 1
HU - Ungheria 1
KE - Kenya 1
KI - Kiribati 1
MA - Marocco 1
MD - Moldavia 1
ML - Mali 1
PE - Perù 1
QA - Qatar 1
SO - Somalia 1
TT - Trinidad e Tobago 1
UY - Uruguay 1
VE - Venezuela 1
Totale 8.873
Città #
Hong Kong 4.066
Ann Arbor 601
Woodbridge 303
Chandler 257
Jacksonville 233
Wilmington 231
Princeton 204
Houston 168
Dallas 121
Ashburn 120
Singapore 89
Dublin 75
Salerno 70
Dearborn 68
Izmir 55
Andover 45
Nanjing 44
Beijing 41
Moscow 35
Dong Ket 33
Pellezzano 31
Boardman 30
Naples 19
The Dalles 18
Los Angeles 17
Mestre 17
Düsseldorf 16
Shenyang 16
Hebei 15
Nanchang 15
São Paulo 15
Ottawa 14
Ferrandina 13
Milan 13
Munich 13
Changsha 12
Columbus 12
Fairfield 12
Florence 12
Redwood City 12
Washington 12
Jiaxing 11
Santa Clara 11
Fisciano 9
North Bergen 9
San Diego 9
Council Bluffs 8
Florianópolis 8
Norwalk 8
Napoli 7
New York 7
Tianjin 7
Nuremberg 6
Pune 6
Rio de Janeiro 6
Toronto 6
Vienna 6
Ankara 5
Belo Horizonte 5
Boston 5
Jinan 5
London 5
Rome 5
Seattle 5
Berlin 4
Brooklyn 4
Cambridge 4
Chicago 4
Curitiba 4
Poggiomarino 4
Rescaldina 4
San Francisco 4
San Jose 4
Afragola 3
Almaty 3
Castrolibero 3
Chennai 3
Guangzhou 3
Helsinki 3
Ho Chi Minh City 3
Lappeenranta 3
Mercato San Severino 3
Monterrey 3
Nola 3
Sennori 3
Stockholm 3
Tokyo 3
Villenave-d'Ornon 3
Warsaw 3
West Jordan 3
Acerra 2
Augusta 2
Barcelona 2
Brasília 2
Brescia 2
Brno 2
Caruaru 2
Caserta 2
Catanduva 2
Denver 2
Totale 7.459
Nome #
Groups Burning: Analyzing Spreading Processes in Community-Based Networks 912
Coloring Circular Arcs with Applications 521
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width 441
Combinatorial Algorithms 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1–3, 2024, Proceedings 406
Active influence spreading in social networks 299
20th Structural Information and Communication Complexity (SIROCOCO 2013) 279
Fault Tolerant Routing in the Supercube 247
Evangelism in social networks: Algorithms and complexity 236
Optimally Balanced Spanning Tree of the Star Network 215
Evangelism in social networks 213
On k-strong conflict-free multicoloring 190
Getting linear time in graphs of bounded neighborhood diversity 185
Bounds and algorithms for generalized superimposed codes 152
Speeding up networks mining via neighborhood diversity 140
Complexity of conflict-free colorings of graphs 134
Efficient Collective Communication in Optical Networks 133
Active Spreading in Networks 149-162 125
Optimal Polling in Communication Networks 123
Strong Conflict-Free Coloring for Intervals 121
Strong Conflict-Free Coloring for Intervals 118
Special Issue on Structural Information and Communication Complexity 116
Communication Complexity of Gossiping by Packets 114
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 110
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas 108
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks 108
Tight Bounds on Broadcasting with Dynamic Faults 105
Influence Propagation over Large Scale Social Networks 104
Communication Complexity of Fault-Tolerant Information Diffusion 104
Efficient Collective Communication in Optical Networks. 102
Fast and frugal targeting with incentives 102
Brief announcement: Active information spread in networks 100
Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks 99
Fast Collective Communication by Packets in the Postal Model 98
On the Communication Complexity of Polling 98
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 98
Gathering with Minimum Delay in Tree Sensor Networks 98
Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas 96
Collision–Free Path Coloring with Application to Minimum–Delay Gathering in Sensor Networks 95
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 93
Immunization in the Threshold Model: A Parameterized Complexity Study 92
GATHERING WITH MINIMUM COMPLETION TIMEIN SENSOR TREE NETWORKS 92
Communication Complexity of Fault-Tolerant Information Diffusion 91
Fast Gossiping by Short Messages 90
On finding small sets that influence large networks 90
Threshold-bounded dominating set with incentives 87
Embedding Graphs onto the Supercube 80
Fault-Tolerance Properties of the Star Interconnection Network 80
Optimally Fast Data Gathering in Sensor Networks 76
Tighter Time Bounds on Broadcasting in Torus Networks in Presence of Dynamic Faults 70
Whom to befriend to influence people 70
Optimizing Spread of Influence in Social Networks via Partial Incentives 69
Low-weight superimposed codes and related combinatorial structures: Bounds and applications 68
An efficient algorithm for group testing with runlength constraints 67
Vertex-Disjoint Spanning Trees on the Star Network with Applications to Fault-Tolerance and Security 65
Minimum Time Broadcast in Faulty Star Networks 59
Low-weight superimposed codes and their applications 58
Dual domination problems in graphs 58
Fast Gossiping by Short Messages 52
Dual domination 51
Pervasive Domination 48
Parameterized Complexity of Immunization in the Threshold Model 47
Time-Bounded Influence Diffusion with Incentives 41
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures 40
Parameterized Complexity of (d, r)-Domination via Modular Decomposition 37
Improved Algorithms and Bounds for List Union-Free Families 29
Vertex Separation in Networks 29
Preface 29
Parameterized complexity for iterated type partitions and modular-width 24
(t, r)-Broadcast Domination in Networks 23
Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity 22
Distance Vector Domination 22
Iterated Type Partitions 22
Selected Algorithmic Papers from the International Workshop on Combinatorial Algorithms 2024 22
Graph Burning in Community-based Networks 15
Totale 9.053
Categoria #
all - tutte 22.573
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 22.573


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021339 0 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/2025963 40 28 24 44 42 100 126 87 109 53 92 218
2025/20264.225 1.074 3.151 0 0 0 0 0 0 0 0 0 0
Totale 9.053