Annalisa De Bonis

most citedLargest family without A union B contained in C intersect D

56 citations · 56 across the 2 of their papers we have counts for

collaborators

4 papers

cs.DS2016

Constraining the Number of Positive Responses in Adaptive, Non-Adaptive, and Two-Stage Group Testing

Annalisa De Bonis

Group testing is a well known search problem that consists in detecting the defective members of a set of objects O by performing tests on properly chosen subsets (pools) of the gi…

cs.DS2016

Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions

Annalisa De Bonis

We consider the Conflict Resolution Problem in the context of a multiple-access system in which several stations can transmit their messages simultaneously to the channel. We assum…

math.CO2016

Partial Covering Arrays: Algorithms and Asymptotics

Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis +1

A covering array $CA (N; t, k, v)$ is an $N \times k$ array with entries in ${1, 2, \dots, v}$ , for which every $N \times t$ subarray contains each $t$ -tuple of $\{1, 2, \ld…

math.CO2004★ 56 cited

Largest family without A union B contained in C intersect D

Annalisa De Bonis, Gyula O. H. Katona, Konrad J. Swanepoel

Let F be a family of subsets of an n-element set not containing four distinct members such that A union B is contained in C intersect D. It is proved that the maximum size of F und…