optimal Detection of a Counterfeit Coin with Multi-arms Balances. - Annalisa De Bonis; Luisa Gargano; Ugo Vaccaro (Discret. Appl. Math., 1995)

Group Testing with Unreliable Tests. - Annalisa De Bonis; Luisa Gargano; Ugo Vaccaro (Inf. Sci., 1997)

Improved Algorithms for Chemical Threshold Testing Problems. - Annalisa De Bonis; Luisa Gargano; Ugo Vaccaro (COCOON, 1998)

A Predetermined Algorithm for Detecting a Counterfeit Coin with a Multi-arms Balance. - Annalisa De Bonis (Discret. Appl. Math., 1998)

Improved Algorithms for Group Testing with Inhibitors. - Annalisa De Bonis; Ugo Vaccaro (Inf. Process. Lett., 1998)

Dynamic Multi-threshold Metering Schemes. - Carlo Blundo; Annalisa De Bonis; Barbara Masucci; Douglas R. Stinson (Selected Areas in Cryptography, 2000)

Randomness in Visual Cryptography. - Annalisa De Bonis; Alfredo De Santis (STACS, 2000)

Metering Schemes with Pricing. - Carlo Blundo; Annalisa De Bonis; Barbara Masucci (DISC, 2000)

Online Advertising: Secure E-coupons. - Stelvio Cimato; Annalisa De Bonis (ICTCS, 2001)

Secret Sharing and Visual Cryptography Schemes. - Annalisa De Bonis; Alfredo De Santis (SEC, 2001)

Improved Schemes for Visual Cryptography. - Carlo Blundo; Annalisa De Bonis; Alfredo De Santis (Des. Codes Cryptogr., 2001)

Efficient algorithms for chemical threshold testing problems. - Annalisa De Bonis; Luisa Gargano; Ugo Vaccaro (Theor. Comput. Sci., 2001)

Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels. - Annalisa De Bonis; Ugo Vaccaro (ESA, 2002)

A lightweight protocol for the generation and distribution of secure e-coupons. - Carlo Blundo; Stelvio Cimato; Annalisa De Bonis (WWW, 2002)

Bounds and constructions for metering schemes. - Carlo Blundo; Annalisa De Bonis; Barbara Masucci (Commun. Inf. Syst., 2002)

Generalized Framework for Selectors with Applications in Optimal Group Testing. - Annalisa De Bonis; Leszek Gasieniec; Ugo Vaccaro (ICALP, 2003)

Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. - Annalisa De Bonis; Ugo Vaccaro (Theor. Comput. Sci., 2003)

New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures. - Annalisa De Bonis; Ugo Vaccaro (ISIT, 2004)

Randomness in secret sharing and visual cryptography schemes. - Annalisa De Bonis; Alfredo De Santis (Theor. Comput. Sci., 2004)

Secure E-Coupons. - Carlo Blundo; Stelvio Cimato; Annalisa De Bonis (Electron. Commer. Res., 2005)

Largest family without A union B subset of C intersection D. - Annalisa De Bonis; Gyula O. H. Katona; Konrad J. Swanepoel (J. Comb. Theory A, 2005)

Optimal Two-Stage Algorithms for Group Testing Problems. - Annalisa De Bonis; Leszek Gasieniec; Ugo Vaccaro (SIAM J. Comput., 2005)

Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes. - Annalisa De Bonis; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2006)

A lower bound for generalized superimposed codes with application to group testing with inhibitors. - Annalisa De Bonis (ISIT, 2007)

Largest Families Without an r -Fork. - Annalisa De Bonis; Gyula O. H. Katona (Order, 2007)

New combinatorial structures with applications to efficient group testing with inhibitors. - Annalisa De Bonis (J. Comb. Optim., 2008)

Combinatorial Group Testing for Corruption Localizing Hashing. - Annalisa De Bonis; Giovanni Di Crescenzo (COCOON, 2011)

A Group Testing Approach to Improved Corruption Localizing Hashing. - Annalisa De Bonis; Giovanni Di Crescenzo (IACR Cryptol. ePrint Arch., 2011)

An Almost Optimal Algorithm for Generalized Threshold Group Testing with Inhibitors. - Hong-Bin Chen; Annalisa De Bonis (J. Comput. Biol., 2011)

Efficient Group Testing Algorithms with a Constrained Number of Positive Responses. - Annalisa De Bonis (COCOA, 2014)

ϵ-Almost Selectors and Their Applications. - Annalisa De Bonis; Ugo Vaccaro (FCT, 2015)

Generalized Selectors and Locally Thin Families with Applications to Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions. - Annalisa De Bonis (OPODIS, 2016)

Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions. - Annalisa De Bonis (CoRR, 2016)

Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing. - Annalisa De Bonis (J. Comb. Optim., 2016)

ε-Almost Selectors and Their Applications to Multiple-Access Communication. - Annalisa De Bonis; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2017)

Partial Covering Arrays: Algorithms and Asymptotics. - Kaushik Sarkar; Charles J. Colbourn; Annalisa De Bonis; Ugo Vaccaro (Theory Comput. Syst., 2018)

New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions. - Annalisa De Bonis (Theor. Comput. Sci., 2019)

A new kind of selectors and their applications to conflict resolution in wireless multichannels networks. - Annalisa De Bonis; Ugo Vaccaro (Theor. Comput. Sci., 2020)

Conflict Resolution in Arbitrary Hypergraphs. - Annalisa De Bonis (ALGOWIN, 2023)

Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures. - Annalisa De Bonis (SOFSEM, 2024)

Improved Bounds for Group Testing in Arbitrary Hypergraphs. - Annalisa De Bonis (CIAC (1), 2025)