Skip to menu Skip to content Skip to footer

2002

Journal Article

Orthogonal quasigroups associated with m-cycle systems

Bryant, D. E. and Khodkar, A. (2002). Orthogonal quasigroups associated with m-cycle systems. Bulletin of the Institute of Combinatorics and its Applications, 36, 109-112.

Orthogonal quasigroups associated with m-cycle systems

2002

Journal Article

Two-dimensional balanced sampling plans excluding contiguous units

Bryant, D. E., Chang, Y. X., Rodger, C. A. and Wei, R. (2002). Two-dimensional balanced sampling plans excluding contiguous units. Communications In Statistics-theory And Methods, 31 (8), 1441-1455. doi: 10.1081/STA-120006078

Two-dimensional balanced sampling plans excluding contiguous units

2002

Journal Article

A simulated annealing algorithm for finding consensus sequences

Keith, Jonathan M., Adams, Peter, Bryant, Darryn, Kroese, Dirk P., Mitchelson, Keith R., Cochran, Duncan A. E. and Lala, Gita H. (2002). A simulated annealing algorithm for finding consensus sequences. Bioinformatics, 18 (11), 1494-1499. doi: 10.1093/bioinformatics/18.11.1494

A simulated annealing algorithm for finding consensus sequences

2001

Journal Article

Star decompositions of cubes

Bryant, Darryn E., El-Zanati, Saad, Vanden Eynden, Charles and Hoffman, Dean G. (2001). Star decompositions of cubes. Graphs Combin, 17 (1), 55-59. doi: 10.1007/s003730170054

Star decompositions of cubes

2001

Conference Publication

Colloidal barcoding in combinatorial chemistry

Battersby, B. J., Bryant, D. E., Meutermans, W. and Smythe, M. L. (2001). Colloidal barcoding in combinatorial chemistry. Innovation & Perspectives in Solid Phase Synthesis & Combinatl, York, England, 31 Aug - 4 Sept, 1999. UK: Mayflower.

Colloidal barcoding in combinatorial chemistry

2001

Journal Article

5-cycle system of l (K v-K w)

Bryant, D. E. (2001). 5-cycle system of l (K v-K w). Journal of Combinatorial Mathematics and Combinatorial Computing, 38, 161-175.

5-cycle system of l (K v-K w)

2001

Journal Article

The m-way intersection problem for cubes

Adams, P. and Bryant, D. E. (2001). The m-way intersection problem for cubes. Australas. J. Combin., 23, 87-100.

The m-way intersection problem for cubes

2001

Journal Article

Star factorizations of graph products

Bryant, DE, El-Zanati, SI and Vanden Eynden, C (2001). Star factorizations of graph products. Journal of Graph Theory, 36 (2), 59-66. doi: 10.1002/1097-0118(200102)36:23.0.CO;2-A

Star factorizations of graph products

2001

Journal Article

Applications of graph theory in DNA sequencing by hybridization

Adams, P., Bryant, D. E. and Byrnes, S. (2001). Applications of graph theory in DNA sequencing by hybridization. Bulletin of the Institute of Combinatorics and its Applications, 31, 13-20.

Applications of graph theory in DNA sequencing by hybridization

2001

Journal Article

On the Oberwolfach problem with two similar length cycles

Bryant, DE (2001). On the Oberwolfach problem with two similar length cycles. Graphs And Combinatorics, 17 (2), 199-206. doi: 10.1007/s003730170033

On the Oberwolfach problem with two similar length cycles

2001

Journal Article

The mu-way intersection problem for m-cycle systems

Adams, P, Billington, EJ, Bryant, DE and Khodkar, A (2001). The mu-way intersection problem for m-cycle systems. Discrete Mathematics, 231 (1-3), 27-56. doi: 10.1016/S0012-365X(00)00303-4

The mu-way intersection problem for m-cycle systems

2001

Journal Article

On the intersection problem for 1-factorizations and near 1-factorizations of K-v

Bryant, DE and Khodkar, A (2001). On the intersection problem for 1-factorizations and near 1-factorizations of K-v. Utilitas Mathematica, 60, 209-218.

On the intersection problem for 1-factorizations and near 1-factorizations of K-v

2000

Journal Article

Encoding combinatorial libraries: A novel application of fluorescent silica colloids

Grondahl, Lisbeth, Battersby, Bronwyn J., Bryant, Darryn and Trau, Matt (2000). Encoding combinatorial libraries: A novel application of fluorescent silica colloids. Langmuir, 16 (25), 9709-9715. doi: 10.1021/la000995z

Encoding combinatorial libraries: A novel application of fluorescent silica colloids

2000

Journal Article

The line structure of balanced ternary designs with block size three, index three and rho(2) = 1, 2

Adams, P., Bryant, D. E. and Khodkar, A. (2000). The line structure of balanced ternary designs with block size three, index three and rho(2) = 1, 2. Ars Combinatoria, LVI, 299-308.

The line structure of balanced ternary designs with block size three, index three and rho(2) = 1, 2

2000

Journal Article

Maximum packings of K-v-K-u with triples

Bryant, D. E. and Khodkar, A. (2000). Maximum packings of K-v-K-u with triples. Ars Combinatoria, 55, 259-270.

Maximum packings of K-v-K-u with triples

2000

Journal Article

Toward larger chemical libraries: Encoding with fluorescent colloids in combinatorial chemistry

Battersby, Bronwyn J., Bryant, Darryn, Meutermans, Wim, Matthews, Daniel, Smythe, Mark L. and Trau, Matt (2000). Toward larger chemical libraries: Encoding with fluorescent colloids in combinatorial chemistry. Journal of the American Chemical Society, 122 (9), 2138-2139. doi: 10.1021/ja993634i

Toward larger chemical libraries: Encoding with fluorescent colloids in combinatorial chemistry

2000

Journal Article

The spectrum problem for close m- trails, m 10

Adams, P., Bryant, D. E. and Khodkar, A. (2000). The spectrum problem for close m- trails, m 10. Journal of Combinatorial Mathematics and Combinatorial Computing, 34, 223-240.

The spectrum problem for close m- trails, m 10

2000

Journal Article

The fine structure of (v, 3) directed triple systems: v equivalent to 2 (mod 3)

Adams, P, Bryant, DE and Khodkar, A (2000). The fine structure of (v, 3) directed triple systems: v equivalent to 2 (mod 3). Ars Combinatoria, 57, 3-11.

The fine structure of (v, 3) directed triple systems: v equivalent to 2 (mod 3)

2000

Journal Article

The spectrum problem for lambda-fold Petersen graph designs

Adams, P., Bryant, D. E. and Khodkar, A. (2000). The spectrum problem for lambda-fold Petersen graph designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 34, 159-176.

The spectrum problem for lambda-fold Petersen graph designs

2000

Journal Article

Maximal sets of Hamilton cycles in Kn,n

Bryant, DE, El-Zanati, S and Rodger, CA (2000). Maximal sets of Hamilton cycles in Kn,n. Journal of Graph Theory, 33 (1), 25-31. doi: 10.1002/(SICI)1097-0118(200001)33:13.0.CO;2-T

Maximal sets of Hamilton cycles in Kn,n