default search action
Daniel Horsley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j37]Joanne Hall, Daniel Horsley
, Douglas R. Stinson:
Bounds on data limits for all-to-all comparison from combinatorial designs. Des. Codes Cryptogr. 92(10): 2863-2879 (2024) - [j36]Adam Gowty, Daniel Horsley, Adam Mammoliti:
Minimising the total number of subsets and supersets. Eur. J. Comb. 118: 103882 (2024) - 2023
- [j35]Ajani De Vas Gunasekara, Daniel Horsley
Smaller Embeddings of Partial $k$-Star Decompositions. Electron. J. Comb. 30(1) (2023) - 2022
- [j34]Daniel Horsley
Block avoiding point sequencings of partial Steiner systems. Des. Codes Cryptogr. 90(10): 2375-2383 (2022) - [j33]Ajani De Vas Gunasekara
An Evans-Style Result for Block Designs. SIAM J. Discret. Math. 36(1): 47-63 (2022) - 2021
- [j32]Daniel Horsley, Bridget S. Webb:
Countable homogeneous Steiner triple systems avoiding specified subsystems. J. Comb. Theory A 180: 105434 (2021) - [j31]Tao Feng
Novák's conjecture on cyclic Steiner triple systems and its generalization. J. Comb. Theory A 184: 105515 (2021) - [j30]Saieed Akbari
Induced path factors of regular graphs. J. Graph Theory 97(2): 260-280 (2021) - [j29]Daniel Horsley
The cyclic matching sequenceability of regular graphs. J. Graph Theory 98(2): 342-366 (2021) - 2020
- [j28]Yanxun Chang, Charles J. Colbourn, Adam Gowty, Daniel Horsley
New bounds on the maximum size of Sperner partition systems. Eur. J. Comb. 90: 103165 (2020) - [j27]Rosalind A. Cameron, Daniel Horsley
Decompositions of complete multigraphs into stars of varying sizes. J. Comb. Theory B 145: 32-64 (2020) - [j26]Peter J. Dukes
On the Minimum Degree Required for a Triangle Decomposition. SIAM J. Discret. Math. 34(1): 597-610 (2020)
2010 – 2019
- 2019
- [j25]Nevena Francetic, Sarada Herke
MAX for k-independence in multigraphs. Discret. Appl. Math. 265: 56-68 (2019) - [j24]Charles J. Colbourn, Ryan E. Dougherty
Distributing hash families with few rows. Theor. Comput. Sci. 800: 31-41 (2019) - 2018
- [j23]Charles J. Colbourn, Daniel Horsley
A hierarchical framework for recovery in compressive sensing. Discret. Appl. Math. 236: 96-107 (2018) - [j22]Darryn E. Bryant
Decompositions of complete multigraphs into cycles of varying lengths. J. Comb. Theory B 129: 79-106 (2018) - 2017
- [j21]Daniel Horsley
Generalising Fisher's inequality to coverings and packings. Comb. 37(4): 673-696 (2017) - [j20]Daniel Horsley
Decomposing Ku+w-Ku into cycles of prescribed lengths. Discret. Math. 340(8): 1818-1843 (2017) - [j19]Darryn E. Bryant
Steiner Triple Systems with High Chromatic Index. SIAM J. Discret. Math. 31(4): 2603-2611 (2017) - [j18]Darryn E. Bryant
Compressed Sensing With Combinatorial Designs: Theory and Simulations. IEEE Trans. Inf. Theory 63(8): 4850-4859 (2017) - [c2]Daniel Horsley
Switching techniques for edge decompositions of graphs. BCC 2017: 238-271 - 2016
- [j17]Brian Alspach, Darryn E. Bryant
On factorisations of complete graphs into circulant graphs and the Oberwolfach problem. Ars Math. Contemp. 11(1): 157-173 (2016) - [j16]Charles J. Colbourn, Bingli Fan, Daniel Horsley
Disjoint Spread Systems and Fault Location. SIAM J. Discret. Math. 30(4): 2011-2026 (2016) - 2015
- [j15]Darryn E. Bryant
Steiner Triple Systems without Parallel Classes. SIAM J. Discret. Math. 29(1): 693-696 (2015) - [i2]Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin:
Compressed sensing and designs: theory and simulations. CoRR abs/1503.07424 (2015) - 2014
- [j14]Peter Danziger, Daniel Horsley
Resolvability of infinite designs. J. Comb. Theory A 123(1): 73-85 (2014) - [j13]Daniel Horsley
On balanced incomplete block designs with specified weak chromatic number. J. Comb. Theory A 123(1): 123-153 (2014) - [j12]Daniel Horsley
Embedding Partial Steiner Triple Systems with Few Triples. SIAM J. Discret. Math. 28(3): 1199-1213 (2014) - [i1]Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk:
Hierarchical Recovery in Compressive Sensing. CoRR abs/1403.1835 (2014) - 2013
- [j11]Darryn E. Bryant
A second infinite family of Steiner triple systems without almost parallel classes. J. Comb. Theory A 120(7): 1851-1854 (2013) - [j10]Yeow Meng Chee
Sequence Covering Arrays. SIAM J. Discret. Math. 27(4): 1844-1861 (2013) - 2012
- [j9]Charles J. Colbourn, Daniel Horsley
Trails of triples in partial triple systems. Des. Codes Cryptogr. 65(3): 199-212 (2012) - [j8]Charles J. Colbourn, Daniel Horsley
Strengthening hash families and compressive sensing. J. Discrete Algorithms 16: 170-186 (2012) - 2011
- [j7]Darryn E. Bryant
On the non-existence of pair covering designs with at least as many points as blocks. Comb. 31(5): 507-528 (2011) - [j6]Daniel Horsley
Maximum packings of the complete graph with uniform length cycles. J. Graph Theory 68(1): 1-7 (2011) - [j5]Charles J. Colbourn, Daniel Horsley
Compressive Sensing Matrices and Hash Families. IEEE Trans. Commun. 59(7): 1840-1845 (2011) - 2010
- [j4]Daniel Horsley
On cycle systems with specified weak chromatic number. J. Comb. Theory A 117(8): 1195-1206 (2010) - [j3]Darryn E. Bryant
An asymptotic solution to the cycle decomposition problem for complete graphs. J. Comb. Theory A 117(8): 1258-1284 (2010) - [c1]Charles J. Colbourn, Daniel Horsley
Frameproof codes and compressive sensing. Allerton 2010: 985-990
2000 – 2009
- 2008
- [j2]Darryn E. Bryant
Packing cycles in complete graphs. J. Comb. Theory B 98(5): 1014-1037 (2008) - 2005
- [j1]Darryn E. Bryant
Decompositions into 2-regular subgraph and equitable partial cycle decompositions. J. Comb. Theory B 93(1): 67-72 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: