|
2003 Journal Article A new bound on the size of the largest critical set in a Latin squareBean, Richard and Mahmoodian, E. S. (2003). A new bound on the size of the largest critical set in a Latin square. Discrete Mathematics, 267 (1-3), 13-21. doi: 10.1016/S0012-365X(02)00599-X |
|
2003 Journal Article Modelling High-Dimensional Data by Mixtures of Factor AnalyzersMcLachlan, G. J., Peel, D. and Bean, R. W. (2003). Modelling High-Dimensional Data by Mixtures of Factor Analyzers. Computational Statistics & Data Analysis, 41 (3-4), 379-388. doi: 10.1016/S0167-9473(02)00183-4 |
|
2003 Journal Article A census of critical sets in the Latin squares of order at most sixAdams, P, Bean, R and Khodkar, A (2003). A census of critical sets in the Latin squares of order at most six. Ars Combinatoria, 68 (1), 203-223. |
|
2002 Journal Article A mixture model-based approach to the clustering of microarray expression dataMcLachlan, GJ, Bean, RW and Peel, D (2002). A mixture model-based approach to the clustering of microarray expression data. Bioinformatics, 18 (3), 413-422. doi: 10.1093/bioinformatics/18.3.413 |
|
2002 Journal Article Steiner trades that give rise to completely decomposable latin interchangesBean, Richard, Donovan, Diane, Khodkar, Abdollah and Street, Anne Penfold (2002). Steiner trades that give rise to completely decomposable latin interchanges. International Journal of Computer Mathematics, 79 (12), 1273-1284. doi: 10.1080/00207160214654 |
|
2001 Other Outputs Critical sets in Latin squares and associated structuresBean, Richard Winston (2001). Critical sets in Latin squares and associated structures. PhD Thesis, School of Physical Sciences, The University of Queensland. doi: 10.14264/uql.2016.77 |
|
2001 Journal Article Disjoint critical sets in Latin squaresAdams, P., Bean, R. W. and Khodkar, A. (2001). Disjoint critical sets in Latin squares. Congressus Numerantium, 153, 33-48. |
|
2000 Conference Publication Steiner trades that give rise to completely decomposable latin interchangesBean, R., Donovan, D. M., Khodkar, A. and Street, A. P. (2000). Steiner trades that give rise to completely decomposable latin interchanges. Eleventh Australasian Workshop on Combinatorial Algorithms, Hunter Valley, NSW, Australia, 20th July - 1st August 2000. Newcastle, Australia: The University of Newcastle. |
|
2000 Journal Article Closing a gap in the spectrum of critical setsBean, R. and Donovan, D. M. (2000). Closing a gap in the spectrum of critical sets. Australasian Journal of Combinatorics, 22, 191-200. |
