Ahmed M. Assaf, Alan Hartman
Discrete Mathematics
Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution. © 2004 Elsevier B.V. All rights reserved.
Ahmed M. Assaf, Alan Hartman
Discrete Mathematics
Alan Hartman, Dean G. Hoffman
European Journal of Combinatorics
Ahmed M. Assaf, Alan Hartman
Discrete Mathematics
Alan Hartman
Journal of Combinatorial Theory, Series A