Adele Anna Rescigno

Prof. Dr. Adele Anna Rescigno


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2019 in Theoretical Computer Science
Verified
Journal Article
Closed access
Gennaro CordascoGennaro Cordasco
Gennaro Cordasco
LGLuisa Gargano
Luisa Gargano
ARAdele Anna Rescigno
Adele Anna Rescigno

12 October 2016 in Social Network Analysis and Mining
Verified
Journal Article
Closed access
PDF file
Gennaro CordascoGennaro Cordasco
Gennaro Cordasco
LGLuisa Gargano
Luisa Gargano
ARAdele Anna Rescigno
Adele Anna Rescigno

2 April 2013 in Theoretical Computer Science
Verified
Journal Article
Closed access
PDF file
JBJean-Claude Bermond
Jean-Claude Bermond
LGLuisa Gargano
Luisa Gargano
SPStephane Perénnes
Stephane Perénnes
ARAdele Anna Rescigno
Adele Anna Rescigno
Ugo VaccaroUgo Vaccaro
Ugo Vaccaro

25 January 2023 in Information Processing Letters
Verified
Journal Article
Closed access
ARAdele Anna Rescigno
Adele Anna Rescigno
Ugo VaccaroUgo Vaccaro
Ugo Vaccaro

18 September 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ARAdele Anna Rescigno
Adele Anna Rescigno
Ugo VaccaroUgo Vaccaro
Ugo Vaccaro
List union-free families are basic combinatorial structures that appear in different application scenarios, most notably in one-bit compressed sensing. In this paper, we study algorithms for the construction of list union-free families and we provide bounds on the parameters of these families that substantially affect the complexity of the algorithms that utilize them.

7 April 2023 in Algorithmica
Verified
Journal Article
Open access
PDF file
Gennaro CordascoGennaro Cordasco
Gennaro Cordasco
LGLuisa Gargano
Luisa Gargano
ARAdele Anna Rescigno
Adele Anna Rescigno
We consider the problem of keeping under control the spread of harmful items in networks, such as the contagion proliferation of diseases or the diffusion of fake news. We assume the linear threshold model of diffusion where each node has a threshold that measures the node’s resistance to the contagion. We study the parameterized complexity of the problem: Given a network, a set of initially contaminated nodes, and two integers k and $$\ell $$ ℓ , is it possible to limit the diffusion to at most k other nodes of the network by immunizing at most $$\ell $$ ℓ nodes? We consider several parameters associated with the input, including the bounds k and $$\ell $$ ℓ , the maximum node degree $$\Delta $$ Δ , the number $$\zeta $$ ζ of initially contaminated nodes, the treewidth, and the neighborhood diversity of the network. We first give W[1] or W[2]-hardness results for each of the considered parameters. Then we give fixed-parameter algorithms for some parameter combinations.