 | 2002 |
|---|
| 8 |       | Wayne M. Dymàcek,
Matthew Koerlin,
Jean-Guy Speton,
Tom Whaley,
Jennifer Yanulavich:
Disconnected Complements of Steinhaus graphs.
Electronic Notes in Discrete Mathematics 11: 218-232 (2002) |
| 1999 |
|---|
| 7 | | Gerard J. Chang,
Bhaskar DasGupta,
Wayne M. Dymàcek,
Martin Fürer,
Matthew Koerlin,
Yueh-Shin Lee,
Tom Whaley:
Characterizations of bipartite Steinhaus graphs.
Discrete Mathematics 199(1-3): 11-25 (1999) |
| 1998 |
|---|
| 6 | | Tom Whaley,
Anurag Chandra,
Noah Egorin,
Wayne M. Dymàcek:
Parallel searches for hereditary node properties in binary trees.
ACM Southeast Regional Conference 1998: 280-282 |
| 1995 |
|---|
| 5 | | Wayne M. Dymàcek,
Tom Whaley:
Generating strings for bipartite Steinhaus graphs.
Discrete Mathematics 141(1-3): 95-107 (1995) |
| 1986 |
|---|
| 4 | | Wayne M. Dymàcek:
Bipartite Steinhaus graphs.
Discrete Mathematics 59(1-2): 9-20 (1986) |
| 1981 |
|---|
| 3 | | Wayne M. Dymàcek:
Complements of Steinhaus graphs.
Discrete Mathematics 37(2-3): 167-180 (1981) |
| 1980 |
|---|
| 2 | | Wayne M. Dymàcek,
D. P. Roselle:
Cyclic Designs and Uniformly Deep Families.
J. Comb. Theory, Ser. A 28(2): 130-139 (1980) |
| 1978 |
|---|
| 1 | | Wayne M. Dymàcek,
D. P. Roselle:
Circular Permutations by Number of Rises and Successions.
J. Comb. Theory, Ser. A 25(2): 196-201 (1978) |
Data released under the ODC-BY 1.0 license — See also our legal information page