Laura A. Sanchis

Publication Activity (10 Years)

Years Active: 1989-2004
Publications (10 Years): 0

Publications

Laura A. Sanchis
Relating the size of a connected graph to its total and restricted domination numbers. Discret. Math. 283 (1-3) (2004)
Laura A. Sanchis
On the number of edges in graphs with a given weakly connected domination number. Discret. Math. 257 (1) (2002)
Laura A. Sanchis
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem. Algorithmica 33 (1) (2002)
Arun Jagota, Laura A. Sanchis
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique. J. Heuristics 7 (6) (2001)
Laura A. Sanchis
On the number of edges in graphs with a given connected domination number. Discret. Math. 214 (1-3) (2000)
Laura A. Sanchis
Bounds related to domination in graphs with minimum degree two. J. Graph Theory 25 (2) (1997)
Laura A. Sanchis, Arun Jagota
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem. INFORMS J. Comput. 8 (2) (1996)
Laura A. Sanchis, Matthew B. Squire
Parallel Algorithms for Counting and Randomly Generating Integer Partitions. J. Parallel Distributed Comput. 34 (1) (1996)
Laura A. Sanchis
Some results on characterizing the edges of connected graphs with a given domination number. Discret. Math. 140 (1-3) (1995)
Laura A. Sanchis
Generating Hard and Diverse Test Sets for NP-hard Graph Problems. Discret. Appl. Math. 58 (1) (1995)
Laura A. Sanchis
Constructing Language Instances Based on Partial Information. Int. J. Found. Comput. Sci. 5 (2) (1994)
Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan
Approximately solving Maximum Clique using neural network and related heuristics. Cliques, Coloring, and Satisfiability (1993)
Laura A. Sanchis
Multiple-Way Network Partitioning with Different Cost Functions. IEEE Trans. Computers 42 (12) (1993)
Laura A. Sanchis
On the Effective Generation of Set Elements Within Specified Ranges. Math. Syst. Theory 26 (4) (1993)
Laura A. Sanchis
Test Case Construction for the Vertex Cover Problem. Computational Support for Discrete Mathematics (1992)
Laura A. Sanchis
Counting and Generating Integer Partitions in Parallel. ICCI (1992)
Laura A. Sanchis
Maximum number of edges in connected graphs with a given domination number. Discret. Math. 87 (1) (1991)
Laura A. Sanchis, Mark A. Fulk
On the Efficient Generation of Language Instances. SIAM J. Comput. 19 (2) (1990)
Laura A. Sanchis
On the Complexity of Test Case Generation for NP-Hard Problems. Inf. Process. Lett. 36 (3) (1990)
Laura A. Sanchis
Multiple-Way Network Partitioning. IEEE Trans. Computers 38 (1) (1989)