Lucia Moura - Publications

• SEBASTIAN RAAPHORST, LUCIA MOURA, BRETT STEVENS, A construction for strength-3 covering arrays using linear feedback shift registers, submitted, April 2012.
• SEBASTIAN RAAPHORST, LUCIA MOURA, BRETT STEVENS, A density-based greedy algorithm for variable strength covering arrays, submitted, December 2011.
• ELIZABETH MALTAIS, LUCIA MOURA, Hardness results for covering arrays avoiding forbidden edges and error-locating arrays, Theoretical Computer Science 412 (2011), pp 6517-6530. http://dx.doi.org/10.1016/j.tcs.2011.07.010
• PETER DANZIGER, ERIC MENDELSOHN, LUCIA MOURA, BRETT STEVENS, Covering arrays avoiding forbidden edges, Theoretical Computer Science 410 (2009), 5403-5414. http://dx.doi.org/10.1016/j.tcs.2009.07.057
• CONRADO MARTINEZ, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, Locating errors using ELAs, covering arrays and adaptive testing algorithms, SIAM Journal on Discrete Mathematics 23 (2009), 1776-1799. http://dx.doi.org/10.1137/080730706
• ARIANE MASUDA, LUCIA MOURA, DANIEL PANARIO, DAVID THOMSON, Low complexity of normal elements over finite fields of characteristic two, IEEE Transactions on Computers 57 (2008), 990-1001.
• MICHAEL DEWAR, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, STEVEN WANG, Division of trinomials by pentanomials and orthogonal arrays, Designs, Codes and Cryptography 45 (2007), 1-17.
• KAREN MEAGHER, LUCIA MOURA, LATIFA ZEKAOUI, Mixed covering arrays on graphs, Journal of Combinatorial Designs 15 (2007), 393-404.
• GUNES KARABULUT, LUCIA MOURA, DANIEL PANARIO, ABAS YONGACOGLU, Integrating flexible tree searches to orthogonal matching pursuit algorithm, IEE Proc. Vision, Image & Signal Processing 153(2006), 538-548.
• LUCIA MOURA, SEBASTIAN RAAPHORST, Distributed isomorph-free exhaustive generation of certain triple systems, Journal of Combinatorial Mathematics and Combinatorial Computing 56 (2006), 101-121.
• KAREN MEAGHER, LUCIA MOURA, BRETT STEVENS, A Sperner-type theorem for set-partition systems, Electronic Journal of Combinatorics 12 (2005) N20, 6 pages.
• KAREN MEAGHER, LUCIA MOURA, Erdos-Ko-Rado theorems for uniform set-partition systems, Electronic Journal of Combinatorics 12 (2005) R40, 12 pages.
• LUCIA MOURA, JOHN STARDOM, BRETT STEVENS, ALAN WILLIAMS, Covering arrays with mixed alphabet sizes, Journal of Combinatorial Designs 11 (2003), 413-432.
• LUCIA MOURA, Rank inequalities and separation algorithms for packing designs and sparse triple systems, Theoretical Computer Science 297 (2003), 367-384.
• LUCIA MOURA, Maximal s-wise t-intersecting families of sets: kernels, generating sets, and enumeration, Journal of Combinatorial Theory, Ser.A 87 (1999), 52-73.
• BRETT STEVENS, LUCIA MOURA, ERIC MENDELSOHN, Lower bounds for transversal covers, Designs, Codes and Cryptography 15 (1998), 279-299.

• ELIZABETH MALTAIS, LUCIA MOURA, Finding the best CAFE is NP-hard, LATIN 2010 9th Latin American Theoretical Informatics, Lecture Notes in Computer Science 6034, Oaxaca, Mexico, April 2010, 356-371. http://dx.doi.org/10.1007/978-3-642-12200-2_32
• PETER DANZIGER, ERIC MENDELSOHN, LUCIA MOURA, BRETT STEVENS, Covering arrays avoiding forbidden edges, COCOA 2008 - 2nd Annual International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science 5165, St Johns, Canda, August 2008, 296-308.
• CONRADO MARTINEZ, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, Algorithms to locate errors using covering arrays, LATIN 2008 8th Latin American Theoretical Informatics, Lecture Notes in Computer Science 4957, Buzios, Brazil, April 2008, 504-519.
• GUNES KARABULUT, LUCIA MOURA, DANIEL PANARIO, ABBAS YONGACOGLU, Flexible Tree-Search based Orthogonal Matching Pursuit, Int. Conf. on Acoustics Speech, and Signal Processing (ICASSP), vol. 4, 2005, 673-676.
• LUCIA MOURA, Rank inequalities for packing designs and sparse triple systems, LATIN 2000: Theoretical Informatics - 4th Latin American Theoretical Informatics, Lecture Notes in Computer Science 1776, G.H. Gonnet , D. Panario and A. Viola (eds.), Springer, Punta del Este, Uruguay, April 2000, 105--114.
• LUCIA MOURA, A polyhedral algorithm for packings and designs, ESA'99 - 7th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 1643, J. Nesetril (ed.), Springer, Prague, Czech Rep., July 1999, 462-475.

• LUCIA MOURA, IVAN STOJMENOVIC, Backtracking and isomorph-free generation of polyhexes, in Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems, Nayak and Stojmenovic, eds., John Wiley & Sons, New York , 2007, In Press.
• LUCIA MOURA, Polyhedral methods in design theory, Computational and Constructive Design Theory, 227-254, W.D. Wallis (ed.), Math. Appl. 368, Kluwer, 1996.

Theses

• LUCIA MOURA, Polyhedral Aspects of Combinatorial Designs (abstract, postscript), PhD thesis, University of Toronto, Canada, January 1999.
• LUCIA MOURA, Outer linearizations and interior-point methods in convex programming, master's thesis (in portuguese), University of São Paulo, Brazil, August 1992.