 | 2004 |
|---|
| 17 |       | Laura A. Sanchis:
Relating the size of a connected graph to its total and restricted domination numbers.
Discrete Mathematics 283(1-3): 205-216 (2004) |
| 2002 |
|---|
| 16 | | Laura A. Sanchis:
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem.
Algorithmica 33(1): 3-18 (2002) |
| 15 | | Laura A. Sanchis:
On the number of edges in graphs with a given weakly connected domination number.
Discrete Mathematics 257(1): 111-124 (2002) |
| 2001 |
|---|
| 14 |  | Arun Jagota,
Laura A. Sanchis:
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique.
J. Heuristics 7(6): 565-585 (2001) |
| 2000 |
|---|
| 13 | | Laura A. Sanchis:
On the number of edges in graphs with a given connected domination number.
Discrete Mathematics 214(1-3): 193-210 (2000) |
| 1996 |
|---|
| 12 | | Laura A. Sanchis,
Arun Jagota:
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem.
INFORMS Journal on Computing 8(2): 87-102 (1996) |
| 11 | | Laura A. Sanchis,
Matthew B. Squire:
Parallel Algorithms for Counting and Randomly Generating Integer Partitions.
J. Parallel Distrib. Comput. 34(1): 29-35 (1996) |
| 1995 |
|---|
| 10 | | Laura A. Sanchis:
Generating Hard and Diverse Test Sets for NP-hard Graph Problems.
Discrete Applied Mathematics 58(1): 35-66 (1995) |
| 9 | | Laura A. Sanchis:
Some results on characterizing the edges of connected graphs with a given domination number.
Discrete Mathematics 140(1-3): 149-166 (1995) |
| 1994 |
|---|
| 8 | | Laura A. Sanchis:
Constructing Language Instances Based on Partial Information.
Int. J. Found. Comput. Sci. 5(2): 209-229 (1994) |
| 1993 |
|---|
| 7 | | Laura A. Sanchis:
Multiple-Way Network Partitioning with Different Cost Functions.
IEEE Trans. Computers 42(12): 1500-1504 (1993) |
| 6 | | Laura A. Sanchis:
On the Effective Generation of Set Elements Within Specified Ranges.
Mathematical Systems Theory 26(4): 327-341 (1993) |
| 1992 |
|---|
| 5 | | Laura A. Sanchis:
Counting and Generating Integer Partitions in Parallel.
ICCI 1992: 54-57 |
| 1991 |
|---|
| 4 | | Laura A. Sanchis:
Maximum number of edges in connected graphs with a given domination number.
Discrete Mathematics 87(1): 65-72 (1991) |
| 1990 |
|---|
| 3 | | Laura A. Sanchis:
On the Complexity of Test Case Generation for NP-Hard Problems.
Inf. Process. Lett. 36(3): 135-140 (1990) |
| 2 | | Laura A. Sanchis,
Mark A. Fulk:
On the Efficient Generation of Language Instances.
SIAM J. Comput. 19(2): 281-296 (1990) |
| 1989 |
|---|
| 1 | | Laura A. Sanchis:
Multiple-Way Network Partitioning.
IEEE Trans. Computers 38(1): 62-81 (1989) |
