List of Subject Classifications Records

Browse Results (228 results found)

Subscribe to the RSS feed for this result setSubscribe to the RSS feed for this result set

Page 1 of 5

Result Pages:    1 2 3 4 5  next › last »

 Browse by Research Fields, Courses and Disciplines The Research Fields, Courses and Disciplines (Australian Standard Research Classification) is published by the Australian Bureau of Statistics (ABS catalogue number 1297.0) 1998. ABS data is used with permission from the Australian Bureau of Statistics -> 230000 Mathematical Sciences -> 230100 Mathematics -> 230101 Mathematical Logic, Set Theory, Lattices And Combinatorics :

No further child subject classifications could be found.
  Abstract Views File Downloads Thomson Reuters Web of Science Citation Count Scopus Citation Count Altmetric Score
Billington, E. J. and Quattrocchi, G. (2002) (2, C)-ordered path designs P(v, 3, 1). Journal of Combinatorial Mathematics and Combinatorial Computing, 41 9-17. 53  
Khodkar, A., Shahabi, M. A. and Sheikholeslami, S. M. (2003) 2-critical sets for a class of groups. Congressus Numerantium: a conference journal on numerical themes, 164 53-64. 45  
Khodkar, A. and Zahrai, S. (2004) 2-perfect m-cycle systems can be defined by single laws. Bulletin of the Institute of Combinatorics and its Applications, 40 40-48. 52  
Cavenagh, N., Donovan, D. M. and Drapal, A. (2005) 3-Homogeneous latin trades. Discrete Mathematics, 300 1-3: 57-70. doi:10.1016/j.disc.2005.04.021 87   8 Cited 8 times in Scopus8 0
Cavenagh, N. J., Donovan, D. M. and Drapal, A. (2005) 4-homogeneous latin trades. Australasian Journal of Combinatorics, 32 285-303. 68  
Bryant, D. E. (2001) 5-cycle system of l (K v-K w). Journal of Combinatorial Mathematics and Combinatorial Computing, 38 161-175. 69  
Adams, 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. 96   2 Cited 3 times in Scopus3
Bryant, D (2002) A conjecture on small embeddings of partial Steiner triple systems. Journal of Combinatorial Designs, 10 5: 313-321. doi:10.1002/jcd.10017 72   6 Cited 5 times in Scopus5 0
Governatori, Guido, Nair, Vineet and Sattar, Abdul (2002). A Defeasible Logic of Policy-based Intention. In: B. McKay and J. Slaney, Advances in Artificial Intelligence, 15th Australian Joint Conference on Artificial Intelligence Proceedings. Australasian Workshop on Computational Logic 2002, Canberra, (9-20). 2-3 December, 2002. 241 476 7
Governatori, Guido (1996). A Duplication and Loop Checking Free System for S4. In: Miglioli, P., Moscato, U., Mundici, D. and Ornaghi, M., 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods (Short Papers), Terrassini, Italy, (19-32). . 251 480
Grannell, Mike J., Griggs, Terry S. and Street, Anne Penfold (2006) A flaw in the use of minimal defining sets for secret sharing schemes. Design, Codes and Cryptography, 40 2: 225-236. doi:10.1007/s10623-006-0009-3 54   0 Cited 1 times in Scopus1 0
Jonathan M. Keith, Peter Adams, Darryn Bryant, Duncan A. E. Cochran, Gita H. Lala and Keith R. Mitchelson (2004) Algorithms for sequence analysis via mutagenesis. Bioinformatics, 20 15: 2401-2410. doi:10.1093/bioinformatics/bth258 77   8 Cited 7 times in Scopus7 0
Ardal, H., Brown, T.C. and Pleasants, P. A. B. (2005) Almost disjoint families of 3-term arithmetic progressions. Journal of Combinatorial Theory, Series A 109: 75-90. doi:10.1016/j.jcta.2004.07.010 37   1 Cited 1 times in Scopus1 0
Cavenagh, NJ, Donovan, D and Gower, RAH (2005) A new class of critical sets in Latin squares. Utilitas Mathematica, 67 -: 285-300. 76   0 Cited 0 times in Scopus0
Ge, XY (2001) A new integrable model of strongly correlated electrons with Hubbard-like interaction. Modern Physics Letters B, 15 6-7: 213-218. doi:10.1142/S0217984901001574 38   0 0
Donovan, Diane, Fu, Chin-Mei and Khodkar, Abdollah (2004) An investigation of 2-critical sets in latin squares. Ars Combinatoria, 72 223-234. 58   0 Cited 1 times in Scopus1
Ma, RY and Thompson, B (2005) A note on bifurcation from an interval. Nonlinear Analysis-theory Methods & Applications, 62 4: 743-749. doi:10.1016/j.na.2005.04.006 45   7 Cited 8 times in Scopus8 0
Donovan, D. M., Khodkar, A., Sutinuntopas, S. and Thappia, S. (2002) A note on critical sets in latin squares of order 2n-1. Congressus Numerantium: a conference journal of numerical themes, 79 12: 215-219. 40  
Bryant, D. E. (2002) Another quick proof that K10 P + P + P. Bulletin of the Institute of Combinatorics and its Applications, 34 86-86. 41  
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. 278  
Cavenagh, N. J., Donovan, D. M. and Hamalainen, C. (2005). Are there three MOLS of Order 10?. In: J Ryan, P Manyem, K Sugeng and M Miller, Proceedings of the sisteenth Australasian Workshop on Combinatorial Algorithms. Australasian Workshop on Combinatorial Algorithms, Ballarat, (57-66). 18 - 21 September 2005. 205  
Tran, T. T., Bryant, D. E. and Smythe, M. L. (2002) A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries. Computers and Chemistry, 26 2: 113-117. doi:10.1016/S0097-8485(01)00087-0 55   2 Cited 2 times in Scopus2 0
Adams, P., Bryant, D. E. and Buchanan, M. J. (2008) A survey on the existence of G-designs. Journal of Combinatorial Designs, 16 5: 373-410. doi:10.1002/jcd.20170 161 1 29 Cited 43 times in Scopus43 0
Maenhaut, B. M. and Wanless, I. M. (2004) Atomic Latin squares of order eleven. Journal of Combinatorial Designs, 12 1: 12-34. doi:10.1002/jcd.10064 188   11 Cited 8 times in Scopus8 0
Australasian Journal of Combinatorics (2001) Volume 23 51  
Cavenagh, N. J. and Khodkar, A. (2003) Balanced critical sets in Latin squares. Utilitas Mathematica, 64 229-249. 36   2 Cited 2 times in Scopus2
Mar, Jessica C., Harlow, Timothy J . and Ragan, Mark A. (2005) Bayesian and maximum likelihood phylogenetic analyses of protein sequence data under relative branch-length differences and model violation. BMC Evolutionary Biology, 5 8.1-8.20. doi:10.1186/1471-2148-5-8 119   23 Cited 23 times in Scopus23 0
Street, D. J. and Street, A. P. (1999) But where are designs used?. Ars Combinatoria, 53 3-26. 28   0
Donovan, D. M., Loch, B., Thompson, H. B. and Thompson, J. (2007). Change detection through clustering and spectral analysis. In: Brankovic, L., Lin, Y. and Smyth, W. F., International Workshop on Combinatorial Algorithms. 18th International Workshop on Combinatorial Algorithms 2007, Lake MacQuarrie, New South Wales, (49-58). 5-9 November, 2007. 119  
Baake, M., Pleasants, P. and Rehmann, U. (2007) Coincidence site modules in 3-space. Discrete and Computational Geometry, 38 1: 111-138. doi:10.1007/s00454-007-1327-6 48   5 Cited 5 times in Scopus5 0
Waterhouse, M A (2005). Coloured Graph Decompositions PhD Thesis, School of Physical Sciences, The University of Queensland. 103  
Long, Stephen (2003). Combinatorial methods in drug design : towards modulating protein-protein interactions. PhD Thesis, School of Pharmacy, The University of Queensland. 135 2
Billington, E. J. (2003). Combinatorial trades: a survey of recent results. In W.D. Wallis (Ed.), Designs 2002: Further Computational and Constructive Design Theory (pp. 47-67) Massachusetts, USA: Kluwer Academic Press. 102  
Bryant, Darryn and Maenhaut, Barbara (2003) Common multiples of complete graphs. Proceedings of the London Mathematical Society, 86 302-326. doi:10.1112/S0024611502013771 99 13 1 Cited 1 times in Scopus1 0
Adams, P, Bryant, D and Maenhaut, B (2004) Common multiples of complete graphs and a 4-cycle. Discrete Mathematics, 275 1-3: 289-297. doi:10.1016/j.disc.2002.11.001 71   0 Cited 0 times in Scopus0 0
Bryant, D, Grannell, M, Griggs, T and Macaj, M (2004) Configurations in 4-cycle systems. Graphs And Combinatorics, 20 2: 161-179. doi:10.1007/s00373-004-0553-4 33   1 Cited 4 times in Scopus4 0
Gray, K. R. and Street, A. P. (2003). Constructing a class of designs with proportional balance. In W.D. Wallis (Ed.), Designs 2002: Further Computational and Constructive Design Theory (pp. 207-225) Massachusetts, USA: Kluwer Academic Press. 44  
Nicholas Cavenagh, Diane Donovan and Ales Drapal (2004) Constructing and Deconstructing Latin Trades. Discrete Mathematics, 284 1-3: 97-105. doi:10.1016/j.disc.2003.11.026 88   1 Cited 1 times in Scopus1 0
Adams, P., Eggleton, R., MacDougall, J. and Mahmoodian, E. (2003) Corrections to Steinbach's posets of graphs (Orders 5, 6, 7). Bulletin of the Institute of Combinatorics and its Applications, 37 29-34. 47  
Bean, Richard Winston (2001). Critical Sets in Latin Squares and Associated Structures PhD Thesis, School of Physical Sciences, The University of Queensland. 237 215
Adams, P, Bryant, D and Maenhaut, B (2004) Cube factorizations of complete graphs. Journal of Combinatorial Designs, 12 5: 381-388. doi:10.1002/jcd.20015 86   5 Cited 5 times in Scopus5 0
Bryant, D. E. and Rodger, C. (2007). Cycle decompositions. In Colbourn, C. J. and Dinitz, J. H. (Ed.), Handbook of Combinatorial Designs 2nd ed. (pp. 373-382) New York: Chapman & Hall/CRC. 54  
Bryant, D. E. (2007) Cycle decompositions of complete graphs. Surveys in Combinatorics 2007, London Mathematical Society Lecture Note Series, 346 67-97. 68  
Tonkes, E. J. (2002). Dartboard arrangements with a concave penalty function. In: G. Cohen and T. Langry, Proceedings of the Sixth Australian Conference on Mathematics and Computers in Sport. 6th Australian Conference on Mathematics and Computers in Sport, Bond University, Gold Coast, (236-244). 1-3 July 2002. 104  
Herbohn, John L. (2002). Data Collection Methods in Forestry Socio-Economic Research. In: Harrison, Steve R., Harrison, John L., Mangaoang, Eduardo O. and Vanclay, Jerome K., Socio-Economic Research Methods in Forestry: A Training Manual, Leyte State University, ViSCA, Baybay, The Philippines, (15-28). 4-10 February, 2002. 543 429
Gabbay, Dov M. and Governatori, Guido (1998). Dealing with Label Dependent Deontic Modalities. In McNamara, Paul and Prakken, Henry (Ed.), Norms, Logics and Information Systems. New Studies in Deontic Logic (pp. 311-330) : IOS Press. 155 632
Billington, Elizabeth J. and Cavenagh, Nicholas J. (2007) Decomposing complete tripartite graphs into closed trails of arbitrary lengths. Czechoslovak Mathematical Journal, 57 2: 523-551. doi:10.1007/s10587-007-0096-y 54   5 Cited 5 times in Scopus5 0
Billington, E. J. (1999) Decomposing complete tripartite graphs into cycles of lengths 3 and 4. Discrete Mathematics, 197/198 1-3: 123-135. doi:10.1016/S0012-365X(98)00227-1 92   8 0
Bryant, D, El-Zanati, SI, Maenhaut, B and Vanden Eynden, C (2006) Decomposition of complete graphs into 5-cubes. Journal of Combinatorial Designs, 14 2: 159-166. doi:10.1002/jcd.20066 66   1 Cited 2 times in Scopus2 0
Elizabeth J. Billington and D. G. Hoffman (2003) Decomposition of complete tripartite graphs into gregarious 4-cycles. Discrete Mathematics, 261 1-3: 87-111. doi:10.1016/S0012-365X(02)00462-4 67   5 Cited 7 times in Scopus7 0

Page 1 of 5

Result Pages:    1 2 3 4 5  next › last »