Volgen
Daniel Horsley
Daniel Horsley
Associate Professor, Monash University
Geverifieerd e-mailadres voor monash.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
562009
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
522014
Sequence covering arrays
YM Chee, CJ Colbourn, D Horsley, J Zhou
SIAM Journal on Discrete Mathematics 27 (4), 1844-1861, 2013
422013
Cycle decompositions of complete multigraphs
D Bryant, D Horsley, B Maenhaut, BR Smith
Journal of Combinatorial Designs 19 (1), 42-69, 2011
402011
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
332005
Compressive sensing matrices and hash families
CJ Colbourn, D Horsley, C McLean
IEEE transactions on communications 59 (7), 1840-1845, 2011
272011
Packing cycles in complete graphs
D Bryant, D Horsley
Journal of Combinatorial Theory, Series B 98 (5), 1014-1037, 2008
272008
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
262018
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
222010
Decompositions of complete graphs into long cycles
D Bryant, D Horsley
Bulletin of the London Mathematical Society 41 (5), 927-934, 2009
222009
Disjoint spread systems and fault location
CJ Colbourn, B Fan, D Horsley
SIAM Journal on Discrete Mathematics 30 (4), 2011-2026, 2016
202016
Decomposing various graphs into short even-length cycles
D Horsley
Annals of Combinatorics 16, 571-589, 2012
162012
Maximum packings of the complete graph with uniform length cycles
D Horsley
Journal of Graph Theory 68 (1), 1-7, 2011
162011
Frameproof codes and compressive sensing
CJ Colbourn, D Horsley, VR Syrotiuk
2010 48th Annual Allerton Conference on Communication, Control, and …, 2010
132010
Compressed sensing with combinatorial designs: Theory and simulations
D Bryant, CJ Colbourn, D Horsley, PÓ Catháin
IEEE Transactions on Information Theory 63 (8), 4850-4859, 2017
122017
Generalising Fisher’s inequality to coverings and packings
D Horsley
Combinatorica 37 (4), 673-696, 2017
102017
Steiner triple systems without parallel classes
D Bryant, D Horsley
SIAM Journal on Discrete Mathematics 29 (1), 693-696, 2015
102015
Trails of triples in partial triple systems
CJ Colbourn, D Horsley, C Wang
Designs, Codes and Cryptography 65 (3), 199-212, 2012
102012
Colouring triples in every way: a conjecture
CJ Colbourn, D Horsley, C Wang
Quaderni di Matematica 28, 257-286, 2012
82012
Existential closure of block intersection graphs of infinite designs having infinite block size
D Horsley, DA Pike, A Sanaei
Journal of Combinatorial Designs 19 (4), 317-327, 2011
82011
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20