Multiple-Way Network Partitioning. - Laura A. Sanchis (IEEE Trans. Computers, 1989)

On the Complexity of Test Case Generation for NP-Hard Problems. - Laura A. Sanchis (Inf. Process. Lett., 1990)

On the Efficient Generation of Language Instances. - Laura A. Sanchis; Mark A. Fulk (SIAM J. Comput., 1990)

Maximum number of edges in connected graphs with a given domination number. - Laura A. Sanchis (Discret. Math., 1991)

Test Case Construction for the Vertex Cover Problem. - Laura A. Sanchis (Computational Support for Discrete Mathematics, 1992)

Counting and Generating Integer Partitions in Parallel. - Laura A. Sanchis (ICCI, 1992)

Approximately solving Maximum Clique using neural network and related heuristics. - Arun Jagota; Laura A. Sanchis; Ravikanth Ganesan (Cliques, Coloring, and Satisfiability, 1993)

On the Effective Generation of Set Elements Within Specified Ranges. - Laura A. Sanchis (Math. Syst. Theory, 1993)

Multiple-Way Network Partitioning with Different Cost Functions. - Laura A. Sanchis (IEEE Trans. Computers, 1993)

Constructing Language Instances Based on Partial Information. - Laura A. Sanchis (Int. J. Found. Comput. Sci., 1994)

Generating Hard and Diverse Test Sets for NP-hard Graph Problems. - Laura A. Sanchis (Discret. Appl. Math., 1995)

Some results on characterizing the edges of connected graphs with a given domination number. - Laura A. Sanchis (Discret. Math., 1995)

Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem. - Laura A. Sanchis; Arun Jagota (INFORMS J. Comput., 1996)

Parallel Algorithms for Counting and Randomly Generating Integer Partitions. - Laura A. Sanchis; Matthew B. Squire (J. Parallel Distributed Comput., 1996)

Bounds related to domination in graphs with minimum degree two. - Laura A. Sanchis (J. Graph Theory, 1997)

On the number of edges in graphs with a given connected domination number. - Laura A. Sanchis (Discret. Math., 2000)

Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique. - Arun Jagota; Laura A. Sanchis (J. Heuristics, 2001)

Computer laboratories for the theory of computing course. - Laura A. Sanchis (J. Comput. Sci. Coll., 2001)

Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem. - Laura A. Sanchis (Algorithmica, 2002)

On the number of edges in graphs with a given weakly connected domination number. - Laura A. Sanchis (Discret. Math., 2002)

Relating the size of a connected graph to its total and restricted domination numbers. - Laura A. Sanchis (Discret. Math., 2004)