18 citations · 20 across the 14 of their papers we have counts for
15 papers
Identifying Codes Kernelization Limitations
Aritra Banik, Praneet Kumar Patra, Adele Anna Rescigno +1
The Identifying Code (IC) problem seeks a vertex subset whose intersection with every vertex's closed neighborhood is unique, enabling fault detection in multiprocessor systems and…
Distance Vector Domination
Gennaro Cordasco, Luisa Garagano, Adele A. Rescigno
Identifying and mitigating the spread of fake information is a challenging issue that has become dominant with the rise of social media. We consider a generalization of the Dominat…
Parameterized Complexity of (d,r)-Domination via Modular Decomposition
Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno
With the rise of social media, misinformation has significant negative effects on the decision-making of individuals, organizations and communities within society. Identifying and…
An Efficient Algorithm for Group Testing with Runlength Constraints
Marco Dalai, Stefano Della Fiore, Adele A. Rescigno +1
In this paper, we provide an efficient algorithm to construct almost optimal -superimposed codes with runlength constraints. A -superimposed code of length is…
Spanning Trees Minimizing Branching Costs
Luisa Gargano, Adele A. Rescigno
The Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree in a given graph with the fewest branch vertices, defined as vertices with a degree three or…
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures
Marco Dalai, Stefano Della Fiore, Adele A. Rescigno +1
In this paper, we study upper bounds on the minimum length of frameproof codes introduced by Boneh and Shaw to protect copyrighted materials. A -ary -frameproof code of l…