| Cycle decompositions V: Complete graphs into cycles of arbitrary lengths D Bryant, D Horsley, W Pettersson Proceedings of the London Mathematical Society 108 (5), 1153-1192, 2014 | 63 | 2014 |
| A proof of Lindner's conjecture on embeddings of partial Steiner triple systems D Bryant, D Horsley Journal of Combinatorial Designs 17 (1), 63-89, 2009 | 59 | 2009 |
| Cycle decompositions of complete multigraphs D Bryant, D Horsley, B Maenhaut, BR Smith Journal of Combinatorial Designs 19 (1), 42-69, 2011 | 47 | 2011 |
| Sequence covering arrays YM Chee, CJ Colbourn, D Horsley, J Zhou SIAM Journal on Discrete Mathematics 27 (4), 1844-1861, 2013 | 46 | 2013 |
| Decompositions into 2-regular subgraphs and equitable partial cycle decompositions D Bryant, D Horsley, B Maenhaut Journal of Combinatorial Theory, Series B 93 (1), 67-72, 2005 | 36 | 2005 |
| Decompositions of complete multigraphs into cycles of varying lengths D Bryant, D Horsley, B Maenhaut, BR Smith Journal of Combinatorial Theory, Series B 129, 79-106, 2018 | 30 | 2018 |
| Packing cycles in complete graphs D Bryant, D Horsley Journal of Combinatorial Theory, Series B 98 (5), 1014-1037, 2008 | 28 | 2008 |
| Compressive sensing matrices and hash families CJ Colbourn, D Horsley, C McLean IEEE transactions on communications 59 (7), 1840-1845, 2011 | 26 | 2011 |
| An asymptotic solution to the cycle decomposition problem for complete graphs D Bryant, D Horsley Journal of Combinatorial Theory, Series A 117 (8), 1258-1284, 2010 | 24 | 2010 |
| Decompositions of complete graphs into long cycles D Bryant, D Horsley Bulletin of the London Mathematical Society 41 (5), 927-934, 2009 | 24 | 2009 |
| Disjoint spread systems and fault location CJ Colbourn, B Fan, D Horsley SIAM Journal on Discrete Mathematics 30 (4), 2011-2026, 2016 | 23 | 2016 |
| Decomposing various graphs into short even-length cycles D Horsley Annals of Combinatorics 16, 571-589, 2012 | 18 | 2012 |
| Maximum packings of the complete graph with uniform length cycles D Horsley Journal of Graph Theory 68 (1), 1-7, 2011 | 18 | 2011 |
| Compressed sensing with combinatorial designs: Theory and simulations D Bryant, CJ Colbourn, D Horsley, PO Cathain IEEE Transactions on Information Theory 63 (8), 4850-4859, 2017 | 14 | 2017 |
| Frameproof codes and compressive sensing CJ Colbourn, D Horsley, VR Syrotiuk 2010 48th Annual Allerton Conference on Communication, Control, and …, 2010 | 14 | 2010 |
| Generalising Fisher’s inequality to coverings and packings D Horsley Combinatorica 37 (4), 673-696, 2017 | 11 | 2017 |
| Steiner triple systems without parallel classes D Bryant, D Horsley SIAM Journal on Discrete Mathematics 29 (1), 693-696, 2015 | 11 | 2015 |
| On factorisations of complete graphs into circulant graphs and the Oberwolfach problem B Alspach, D Bryant, D Horsley, B Maenhaut, V Scharaschkin arXiv preprint arXiv:1411.6047, 2014 | 11 | 2014 |
| Trails of triples in partial triple systems CJ Colbourn, D Horsley, C Wang Designs, Codes and Cryptography 65 (3), 199-212, 2012 | 11 | 2012 |
| A second infinite family of Steiner triple systems without almost parallel classes D Bryant, D Horsley Journal of Combinatorial Theory, Series A 120 (7), 1851-1854, 2013 | 9 | 2013 |
Barbara MaenhautSchool of Mathematics and Physics, The University of QueenslandE-mail megerősítve itt: maths.uq.edu.au
