Decompositions into 2-regular subgraph and equitable partial cycle decompositions. - Darryn E. Bryant; Daniel Horsley; Barbara M. Maenhaut (J. Comb. Theory B, 2005)

Packing cycles in complete graphs. - Darryn E. Bryant; Daniel Horsley (J. Comb. Theory B, 2008)

Frameproof codes and compressive sensing. - Charles J. Colbourn; Daniel Horsley; Violet R. Syrotiuk (Allerton, 2010)

An asymptotic solution to the cycle decomposition problem for complete graphs. - Darryn E. Bryant; Daniel Horsley (J. Comb. Theory A, 2010)

On cycle systems with specified weak chromatic number. - Daniel Horsley; David A. Pike (J. Comb. Theory A, 2010)

On the non-existence of pair covering designs with at least as many points as blocks. - Darryn E. Bryant; Melinda Buchanan; Daniel Horsley; Barbara M. Maenhaut; Victor Scharaschkin (Comb., 2011)

Maximum packings of the complete graph with uniform length cycles. - Daniel Horsley (J. Graph Theory, 2011)

Compressive Sensing Matrices and Hash Families. - Charles J. Colbourn; Daniel Horsley; Christopher McLean (IEEE Trans. Commun., 2011)

Trails of triples in partial triple systems. - Charles J. Colbourn; Daniel Horsley; Chengmin Wang (Des. Codes Cryptogr., 2012)

Strengthening hash families and compressive sensing. - Charles J. Colbourn; Daniel Horsley; Violet R. Syrotiuk (J. Discrete Algorithms, 2012)

A second infinite family of Steiner triple systems without almost parallel classes. - Darryn E. Bryant; Daniel Horsley (J. Comb. Theory A, 2013)

Sequence Covering Arrays. - Yeow Meng Chee; Charles J. Colbourn; Daniel Horsley; Junling Zhou (SIAM J. Discret. Math., 2013)

Hierarchical Recovery in Compressive Sensing. - Charles J. Colbourn; Daniel Horsley; Violet R. Syrotiuk (CoRR, 2014)

Resolvability of infinite designs. - Peter Danziger; Daniel Horsley; Bridget S. Webb (J. Comb. Theory A, 2014)

On balanced incomplete block designs with specified weak chromatic number. - Daniel Horsley; David A. Pike (J. Comb. Theory A, 2014)

Embedding Partial Steiner Triple Systems with Few Triples. - Daniel Horsley (SIAM J. Discret. Math., 2014)

Compressed sensing and designs: theory and simulations. - Darryn E. Bryant; Charles J. Colbourn; Daniel Horsley; Padraig Ó Catháin (CoRR, 2015)

Steiner Triple Systems without Parallel Classes. - Darryn E. Bryant; Daniel Horsley (SIAM J. Discret. Math., 2015)

On factorisations of complete graphs into circulant graphs and the Oberwolfach problem. - Brian Alspach; Darryn E. Bryant; Daniel Horsley; Barbara M. Maenhaut; Victor Scharaschkin (Ars Math. Contemp., 2016)

Disjoint Spread Systems and Fault Location. - Charles J. Colbourn; Bingli Fan; Daniel Horsley (SIAM J. Discret. Math., 2016)

Switching techniques for edge decompositions of graphs. - Daniel Horsley (BCC, 2017)

Generalising Fisher's inequality to coverings and packings. - Daniel Horsley (Comb., 2017)

Decomposing Ku+w-Ku into cycles of prescribed lengths. - Daniel Horsley; Rosalind A. Hoyte (Discret. Math., 2017)

Steiner Triple Systems with High Chromatic Index. - Darryn E. Bryant; Charles J. Colbourn; Daniel Horsley; Ian M. Wanless (SIAM J. Discret. Math., 2017)

Compressed Sensing With Combinatorial Designs: Theory and Simulations. - Darryn E. Bryant; Charles J. Colbourn; Daniel Horsley; Padraig Ó Catháin (IEEE Trans. Inf. Theory, 2017)

A hierarchical framework for recovery in compressive sensing. - Charles J. Colbourn; Daniel Horsley; Violet R. Syrotiuk (Discret. Appl. Math., 2018)

Decompositions of complete multigraphs into cycles of varying lengths. - Darryn E. Bryant; Daniel Horsley; Barbara M. Maenhaut; Benjamin R. Smith (J. Comb. Theory B, 2018)

MAX for k-independence in multigraphs. - Nevena Francetic; Sarada Herke; Daniel Horsley (Discret. Appl. Math., 2019)

Distributing hash families with few rows. - Charles J. Colbourn; Ryan E. Dougherty; Daniel Horsley (Theor. Comput. Sci., 2019)

New bounds on the maximum size of Sperner partition systems. - Yanxun Chang; Charles J. Colbourn; Adam Gowty; Daniel Horsley; Junling Zhou (Eur. J. Comb., 2020)

Decompositions of complete multigraphs into stars of varying sizes. - Rosalind A. Cameron; Daniel Horsley (J. Comb. Theory B, 2020)

On the Minimum Degree Required for a Triangle Decomposition. - Peter J. Dukes; Daniel Horsley (SIAM J. Discret. Math., 2020)

Novák's conjecture on cyclic Steiner triple systems and its generalization. - Tao Feng 002; Daniel Horsley; Xiaomiao Wang (J. Comb. Theory A, 2021)

Countable homogeneous Steiner triple systems avoiding specified subsystems. - Daniel Horsley; Bridget S. Webb (J. Comb. Theory A, 2021)

Induced path factors of regular graphs. - Saieed Akbari; Daniel Horsley; Ian M. Wanless (J. Graph Theory, 2021)

The cyclic matching sequenceability of regular graphs. - Daniel Horsley; Adam Mammoliti (J. Graph Theory, 2021)

Block avoiding point sequencings of partial Steiner systems. - Daniel Horsley; Padraig Ó Catháin (Des. Codes Cryptogr., 2022)

An Evans-Style Result for Block Designs. - Ajani De Vas Gunasekara; Daniel Horsley (SIAM J. Discret. Math., 2022)

Smaller Embeddings of Partial $k$-Star Decompositions. - Ajani De Vas Gunasekara; Daniel Horsley (Electron. J. Comb., 2023)

Minimising the total number of subsets and supersets. - Adam Gowty; Daniel Horsley; Adam Mammoliti (Eur. J. Comb., 2024)

Exact values for some unbalanced Zarankiewicz numbers. - Guangzhou Chen; Daniel Horsley; Adam Mammoliti (J. Graph Theory, 2024)

Bounds on data limits for all-to-all comparison from combinatorial designs. - Joanne Hall; Daniel Horsley; Douglas R. Stinson (Des. Codes Cryptogr., 2024)