Daniel Horsley

Douglas R. Stinson

Des. Codes Cryptogr., October, 2024

Minimising the total number of subsets and supersets.

[BibT_eX]

[DOI]

Adam Gowty

Adam Mammoliti

Eur. J. Comb., 2024

2023

Smaller Embeddings of Partial $k$-Star Decompositions.

[BibT_eX]

[DOI]

Ajani De Vas Gunasekara

Electron. J. Comb., 2023

2022

An Evans-Style Result for Block Designs.

[BibT_eX]

[DOI]

Ajani De Vas Gunasekara

SIAM J. Discret. Math., 2022

Block avoiding point sequencings of partial Steiner systems.

[BibT_eX]

[DOI]

Padraig Ó Catháin

Des. Codes Cryptogr., 2022

2021

The cyclic matching sequenceability of regular graphs.

[BibT_eX]

[DOI]

Adam Mammoliti

J. Graph Theory, 2021

Induced path factors of regular graphs.

[BibT_eX]

[DOI]

Saieed Akbari

Ian M. Wanless

J. Graph Theory, 2021

Countable homogeneous Steiner triple systems avoiding specified subsystems.

[BibT_eX]

[DOI]

Bridget S. Webb

J. Comb. Theory A, 2021

Novák's conjecture on cyclic Steiner triple systems and its generalization.

[BibT_eX]

[DOI]

Tao Feng

Xiaomiao Wang

J. Comb. Theory A, 2021

2020

On the Minimum Degree Required for a Triangle Decomposition.

[BibT_eX]

[DOI]

Peter J. Dukes

SIAM J. Discret. Math., 2020

Decompositions of complete multigraphs into stars of varying sizes.

[BibT_eX]

[DOI]

Rosalind A. Cameron

J. Comb. Theory B, 2020

New bounds on the maximum size of Sperner partition systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

2019

Distributing hash families with few rows.

[BibT_eX]

[DOI]

Ryan E. Dougherty

Theor. Comput. Sci., 2019

MAX for k-independence in multigraphs.

[BibT_eX]

[DOI]

Nevena Francetic

Sarada Herke

Discret. Appl. Math., 2019

2018

Decompositions of complete multigraphs into cycles of varying lengths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

A hierarchical framework for recovery in compressive sensing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Compressed Sensing With Combinatorial Designs: Theory and Simulations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Steiner Triple Systems with High Chromatic Index.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Decomposing K<sub>u+w</sub>-K<sub>u</sub> into cycles of prescribed lengths.

[BibT_eX]

[DOI]

Rosalind A. Hoyte

Discret. Math., 2017

Generalising Fisher's inequality to coverings and packings.

[BibT_eX]

[DOI]

Comb., 2017

Switching techniques for edge decompositions of graphs.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2017

2016

Disjoint Spread Systems and Fault Location.

[BibT_eX]

[DOI]

Bingli Fan

SIAM J. Discret. Math., 2016

On factorisations of complete graphs into circulant graphs and the Oberwolfach problem.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2016

2015

Steiner Triple Systems without Parallel Classes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Compressed sensing and designs: theory and simulations.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Embedding Partial Steiner Triple Systems with Few Triples.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

On balanced incomplete block designs with specified weak chromatic number.

[BibT_eX]

[DOI]

David A. Pike

J. Comb. Theory A, 2014

Resolvability of infinite designs.

[BibT_eX]

[DOI]

Peter Danziger

Bridget S. Webb

J. Comb. Theory A, 2014

Hierarchical Recovery in Compressive Sensing.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Sequence Covering Arrays.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

A second infinite family of Steiner triple systems without almost parallel classes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

2012

Strengthening hash families and compressive sensing.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Trails of triples in partial triple systems.

[BibT_eX]

[DOI]

Chengmin Wang

Des. Codes Cryptogr., 2012

2011

Compressive Sensing Matrices and Hash Families.

[BibT_eX]

[DOI]

Christopher McLean

IEEE Trans. Commun., 2011

Maximum packings of the complete graph with uniform length cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

On the non-existence of pair covering designs with at least as many points as blocks.

[BibT_eX]

[DOI]

Comb., 2011

2010

On cycle systems with specified weak chromatic number.

[BibT_eX]

[DOI]

David A. Pike

J. Comb. Theory A, 2010

An asymptotic solution to the cycle decomposition problem for complete graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2010

Frameproof codes and compressive sensing.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2008

Packing cycles in complete graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

2005

Decompositions into 2-regular subgraph and equitable partial cycle decompositions.

[BibT_eX]

[DOI]