Finding the Best CAFE Is NP-Hard. - Elizabeth Maltais; Lucia Moura (LATIN, 2010)

Hardness results for covering arrays avoiding forbidden edges and error-locating arrays. - Elizabeth Maltais; Lucia Moura (Theor. Comput. Sci., 2011)

Graph-intersecting set systems and LYM inequalities. - Elizabeth Maltais; Lucia Moura; Mike Newman (Discret. Math., 2017)

Binary Covering Arrays on Tournaments. - Elizabeth Maltais; Lucia Moura; Mike Newman (Electron. J. Comb., 2018)