Daniel Horsley

Assoc Professor

Accepting PhD Students

20052021
If you made any changes in Pure these will be visible here soon.

Personal profile

Biography

Daniel works in the School of Mathematical Sciences at Monash University as an ARC Future Fellow.

 

Homepage: http://users.monash.edu.au/~dhorsley/

Research interests

combinatorial designs, edge decomposition of graphs

Keywords

  • combinatorial designs
  • edge decomposition of graphs

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Projects 2012 2021

Research Output 2005 2018

A hierarchical framework for recovery in compressive sensing

Colbourn, C. J., Horsley, D. & Syrotiuk, V. R., 19 Feb 2018, In : Discrete Applied Mathematics. 236, p. 96-107 12 p.

Research output: Contribution to journalArticleResearchpeer-review

Decompositions of complete multigraphs into cycles of varying lengths

Bryant, D., Horsley, D., Maenhaut, B. & Smith, B. R., Mar 2018, In : Journal of Combinatorial Theory. Series B. 129, p. 79–106 28 p.

Research output: Contribution to journalArticleResearchpeer-review

New lower bounds for t-coverings

Horsley, D. & Singh, R., 1 Aug 2018, In : Journal of Combinatorial Designs. 26, 8, p. 369-386 18 p.

Research output: Contribution to journalArticleResearchpeer-review

Pseudo generalized Youden designs

Das, A., Horsley, D. & Singh, R., Sep 2018, In : Journal of Combinatorial Designs. 26, 9, p. 439-454 16 p.

Research output: Contribution to journalArticleResearchpeer-review

Compressed Sensing with Combinatorial Designs: Theory and Simulations

Bryant, D., Colbourn, C. J., Horsley, D. & Cathain, P. O., Aug 2017, In : IEEE Transactions on Information Theory. 63, 8, p. 4850-4859 10 p.

Research output: Contribution to journalArticleResearchpeer-review