Daniel Horsley

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 24

Top Topics

Compressed Sensing

Maximum Cardinality

Top Venues

SIAM J. Discret. Math.

J. Comb. Theory, Ser. A

J. Graph Theory

Publications

Adam Gowty, Daniel Horsley, Adam Mammoliti
Minimising the total number of subsets and supersets. Eur. J. Comb. 118 (2024)
Ajani De Vas Gunasekara, Daniel Horsley
Smaller Embeddings of Partial $k$-Star Decompositions. Electron. J. Comb. 30 (1) (2023)
Ajani De Vas Gunasekara, Daniel Horsley
An Evans-Style Result for Block Designs. SIAM J. Discret. Math. 36 (1) (2022)
Daniel Horsley, Padraig Ó Catháin
Block avoiding point sequencings of partial Steiner systems. Des. Codes Cryptogr. 90 (10) (2022)
Daniel Horsley, Adam Mammoliti
The cyclic matching sequenceability of regular graphs. J. Graph Theory 98 (2) (2021)
Daniel Horsley, Bridget S. Webb
Countable homogeneous Steiner triple systems avoiding specified subsystems. J. Comb. Theory, Ser. A 180 (2021)
Saieed Akbari, Daniel Horsley, Ian M. Wanless
Induced path factors of regular graphs. J. Graph Theory 97 (2) (2021)
Tao Feng, Daniel Horsley, Xiaomiao Wang
Novák's conjecture on cyclic Steiner triple systems and its generalization. J. Comb. Theory, Ser. A 184 (2021)
Peter J. Dukes, Daniel Horsley
On the Minimum Degree Required for a Triangle Decomposition. SIAM J. Discret. Math. 34 (1) (2020)
Yanxun Chang, Charles J. Colbourn, Adam Gowty, Daniel Horsley, Junling Zhou
New bounds on the maximum size of Sperner partition systems. Eur. J. Comb. 90 (2020)
Rosalind A. Cameron, Daniel Horsley
Decompositions of complete multigraphs into stars of varying sizes. J. Comb. Theory, Ser. B 145 (2020)
Nevena Francetic, Sarada Herke, Daniel Horsley
MAX for k-independence in multigraphs. Discret. Appl. Math. 265 (2019)
Charles J. Colbourn, Ryan E. Dougherty, Daniel Horsley
Distributing hash families with few rows. Theor. Comput. Sci. 800 (2019)
Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
A hierarchical framework for recovery in compressive sensing. Discret. Appl. Math. 236 (2018)
Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut, Benjamin R. Smith
Decompositions of complete multigraphs into cycles of varying lengths. J. Comb. Theory, Ser. B 129 (2018)
Daniel Horsley, Rosalind A. Hoyte
into cycles of prescribed lengths. Discret. Math. 340 (8) (2017)
Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin
Compressed Sensing With Combinatorial Designs: Theory and Simulations. IEEE Trans. Inf. Theory 63 (8) (2017)
Daniel Horsley
Switching techniques for edge decompositions of graphs. BCC (2017)
Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Ian M. Wanless
Steiner Triple Systems with High Chromatic Index. SIAM J. Discret. Math. 31 (4) (2017)
Daniel Horsley
Generalising Fisher's inequality to coverings and packings. Comb. 37 (4) (2017)
Brian Alspach, Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin
On factorisations of complete graphs into circulant graphs and the Oberwolfach problem. Ars Math. Contemp. 11 (1) (2016)
Charles J. Colbourn, Bingli Fan, Daniel Horsley
Disjoint Spread Systems and Fault Location. SIAM J. Discret. Math. 30 (4) (2016)
Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin
Compressed sensing and designs: theory and simulations. CoRR (2015)
Darryn E. Bryant, Daniel Horsley
Steiner Triple Systems without Parallel Classes. SIAM J. Discret. Math. 29 (1) (2015)
Daniel Horsley, David A. Pike
On balanced incomplete block designs with specified weak chromatic number. J. Comb. Theory, Ser. A 123 (1) (2014)
Daniel Horsley
Embedding Partial Steiner Triple Systems with Few Triples. SIAM J. Discret. Math. 28 (3) (2014)
Peter Danziger, Daniel Horsley, Bridget S. Webb
Resolvability of infinite designs. J. Comb. Theory, Ser. A 123 (1) (2014)
Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
Hierarchical Recovery in Compressive Sensing. CoRR (2014)
Yeow Meng Chee, Charles J. Colbourn, Daniel Horsley, Junling Zhou
Sequence Covering Arrays. SIAM J. Discret. Math. 27 (4) (2013)
Darryn E. Bryant, Daniel Horsley
A second infinite family of Steiner triple systems without almost parallel classes. J. Comb. Theory, Ser. A 120 (7) (2013)
Charles J. Colbourn, Daniel Horsley, Chengmin Wang
Trails of triples in partial triple systems. Des. Codes Cryptogr. 65 (3) (2012)
Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
Strengthening hash families and compressive sensing. J. Discrete Algorithms 16 (2012)
Charles J. Colbourn, Daniel Horsley, Christopher McLean
Compressive Sensing Matrices and Hash Families. IEEE Trans. Commun. 59 (7) (2011)
Darryn E. Bryant, Melinda Buchanan, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin
On the non-existence of pair covering designs with at least as many points as blocks. Comb. 31 (5) (2011)
Daniel Horsley
Maximum packings of the complete graph with uniform length cycles. J. Graph Theory 68 (1) (2011)
Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
Frameproof codes and compressive sensing. Allerton (2010)
Daniel Horsley, David A. Pike
On cycle systems with specified weak chromatic number. J. Comb. Theory, Ser. A 117 (8) (2010)
Darryn E. Bryant, Daniel Horsley
An asymptotic solution to the cycle decomposition problem for complete graphs. J. Comb. Theory, Ser. A 117 (8) (2010)
Darryn E. Bryant, Daniel Horsley
Packing cycles in complete graphs. J. Comb. Theory, Ser. B 98 (5) (2008)
Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut
Decompositions into 2-regular subgraph and equitable partial cycle decompositions. J. Comb. Theory, Ser. B 93 (1) (2005)