Search the dblp DataBase

Publications of Author

1. Lucia Moura
   A Polyhedral Algorithm for Packings and Designs. [Citation Graph (0, 0)][DBLP]
   ESA, 1999, pp:462-475 [Conf]
   
2. Lucia Moura
   Rank Inequalities for Packing Designs and Sparse Triple Systems. [Citation Graph (0, 0)][DBLP]
   LATIN, 2000, pp:105-114 [Conf]
   
3. Brett Stevens, Lucia Moura, Eric Mendelsohn
   Lower Bounds for Transversal Covers. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 1998, v:15, n:3, pp:279-299 [Journal]
   
4. Lucia Moura
   Maximal s-Wise t-Intersecting Families of Sets: Kernels, Generating Sets, and Enumeration. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1999, v:87, n:1, pp:52-73 [Journal]
   
5. Lucia Moura
   Rank inequalities and separation algorithms for packing designs and sparse triple systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:367-384 [Journal]
   
6. Michael Dewar, Lucia Moura, Daniel Panario, Brett Stevens, Qiang Wang
   Division of trinomials by pentanomials and orthogonal arrays. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2007, v:45, n:1, pp:1-17 [Journal]
   
7. 
   Algorithms to Locate Errors Using Covering Arrays. [Citation Graph (, )][DBLP]
   
   
8. 
   Finding the Best CAFE Is NP-Hard. [Citation Graph (, )][DBLP]
   
   
9. 
   Covering Arrays Avoiding Forbidden Edges. [Citation Graph (, )][DBLP]
   
   
10. 
    A Sperner-Type Theorem for Set-Partition Systems. [Citation Graph (, )][DBLP]
    
    
11. 
    Erdos-Ko-Rado theorems for uniform set-partition systems. [Citation Graph (, )][DBLP]