Overview
Availability
- Dr James Lefevre is:
- Available for supervision
Qualifications
- Doctor of Philosophy, The University of Queensland
Works
Search Professor James Lefevre’s works on UQ eSpace
2009
Journal Article
On defining sets of full designs with block size three
Donovan, D., Lefevre, J., Waterhouse, M. and Yazici, E. S. (2009). On defining sets of full designs with block size three. Graphs and Combinatorics, 25 (6), 825-839. doi: 10.1007/s00373-010-0882-4
2009
Journal Article
A constraint on the biembedding of Latin squares
Lefevre, J. G., Donovan, D. M., Grannell, M. J. and Griggs, T. S. (2009). A constraint on the biembedding of Latin squares. European Journal of Combinatorics, 30 (2), 380-386. doi: 10.1016/j.ejc.2008.05.007
2009
Journal Article
Some results on 2-perfect cube decompositions
Adams, Peter, Lefevre, James and Waterhouse, Mary (2009). Some results on 2-perfect cube decompositions. Australasian Journal of Combinatorics, 44, 95-103.
2008
Journal Article
The volume and foundation of star trades
Lefevre, James G. (2008). The volume and foundation of star trades. Discrete Mathematics, 308 (11), 2059-2066. doi: 10.1016/j.disc.2007.04.054
2008
Journal Article
Some 2-coloured 5-cycle decompositions
Waterhouse, Mary and Lefevre, James (2008). Some 2-coloured 5-cycle decompositions. The Journal of Combinatorial Mathematics and Combinatorial Computing, 64, 187-202.
2008
Conference Publication
Permutation Representation of 3 and 4-Homogenous Latin Bitrades
Lefevre, J. G., Donovan, D. M. and Drapal, A. (2008). Permutation Representation of 3 and 4-Homogenous Latin Bitrades. Netherlands: IOS Press.
2008
Journal Article
On the spectrum of critical sets in latin squares of order 2n
Donovan, D. M., Lefevre, J. G. and Van Rees, G. H. J. (2008). On the spectrum of critical sets in latin squares of order 2n. Journal of Combinatorial Designs, 16 (1), 25-43. doi: 10.1002/jcd.20144
2008
Conference Publication
A discussion of constrained binary embeddings with applications to cryptanalysis of irregularly clocked stream ciphers
Donovan, D. M., Lefevre, J. G. and Simpson, L. (2008). A discussion of constrained binary embeddings with applications to cryptanalysis of irregularly clocked stream ciphers. International Conference on Discrete Mathematics (ICDM 2006), Bangalore, India, 15-18 December 2006. Bangalore, India: Ramanujan Mathematical Society.
2007
Journal Article
Six-cycle trades and a lower bound on the trade volumes of weakly connected graphs
Lefevre, James G. (2007). Six-cycle trades and a lower bound on the trade volumes of weakly connected graphs. Utilitas Mathematica, 72, 251-266.
2007
Journal Article
Minimal and minimum size latin bitrades of each genus
Lefevre, J. G., Donovan, D. M., Cavenagh, N. and Drapal, A. (2007). Minimal and minimum size latin bitrades of each genus. Commentationes Mathematicae Universitatis Carolinae, 48 (2), 189-203.
2006
Journal Article
Graphical trades
Lefevre, James (2006). Graphical trades. Bulletin of The Australian Mathematical Society, 73 (3), 477-478. doi: 10.1017/S0004972700035486
2006
Conference Publication
A discussion of constrained binary embeddings with applications to cryptanalysis of irregularly clocked stream ciphers
Donovan, D M, Lefevre, J G and Simpson, L (2006). A discussion of constrained binary embeddings with applications to cryptanalysis of irregularly clocked stream ciphers. International Conference on Discrete Mathematics 2006 (ICDM 2006), Banglaore, India, 15-18 December 2006. Bangalore: Indian Institute of Science.
2006
Journal Article
Maximal triangle trades with foundation 5 (mod 6) - the final case
Lefevre, JG (2006). Maximal triangle trades with foundation 5 (mod 6) - the final case. Ars Combinatoria, 81 (-), 325-342.
2005
Journal Article
Some equitably 3-colourable cycle decompositions of complete equipartite graphs
Lefevre, J and Waterhouse, M (2005). Some equitably 3-colourable cycle decompositions of complete equipartite graphs. Discrete Mathematics, 297 (-), 60-77. doi: 10.1016/j.disc.2005.03.021
2005
Journal Article
Trade spectrum of K4-e
Lefevre, JG (2005). Trade spectrum of K4-e. Graphs And Combinatorics, 21 (4), 475-488. doi: 10.1007/s00373-005-0633-0
2005
Other Outputs
Graphical trades
Lefevre, James (2005). Graphical trades. PhD Thesis, School of Physical Sciences, The University of Queensland. doi: 10.14264/2c5082b
2004
Journal Article
Steiner trade spectra of complete partite graphs
Lefevre, J. G. (2004). Steiner trade spectra of complete partite graphs. Discrete Mathematics, 288 (1-3), 89-98. doi: 10.1016/j.disc.2004.06.021
2004
Journal Article
Some equitably 3-colourable cycle decompositions
Adams, P, Bryant, D, Lefevre, J and Waterhouse, M (2004). Some equitably 3-colourable cycle decompositions. Discrete Mathematics, 284 (1-3), 21-35. doi: 10.1016/j.disc.2003.11.019
Supervision
Availability
- Dr James Lefevre is:
- Available for supervision
Before you email them, read our advice on how to contact a supervisor.
Supervision history
Current supervision
-
Doctor Philosophy
A study of combinatorial problems and their applications
Principal Advisor
Other advisors: Professor Diane Donovan
-
Doctor Philosophy
Assessment of machine learning methods to discover novel models of gene networks to improve genomic prediction for plant breeding
Associate Advisor
Other advisors: Dr Owen Powell, Professor Mark Cooper
-
Doctor Philosophy
Modelling Biological Systems using Mathematical Networks
Associate Advisor
Other advisors: Professor Diane Donovan
-
Doctor Philosophy
Pure and Applied Applications of Combinatorial Mathematics
Associate Advisor
Other advisors: Professor Daniel Ortiz-Barrientos, Professor Diane Donovan
Completed supervision
-
2022
Doctor Philosophy
Deep Learning Methods For The Characterisation of Non-Melanoma Skin Cancer
Associate Advisor
-
2010
Doctor Philosophy
On defining sets in latin squares and two intersection problems, one for latin squares and one for Steiner triple systems
Associate Advisor
Other advisors: Professor Diane Donovan
Media
Enquiries
For media enquiries about Dr James Lefevre's areas of expertise, story ideas and help finding experts, contact our Media team: