Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDarryn E. Bryant
Person information
- affiliation: University of Queensland, Brisbane, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2021
[j93]Robert Brier, Darryn E. Bryant:
On the Steiner Quadruple System with Ten Points. Bull. ICA 91: 115-127 (2021)- 2019
- [j92]Darryn E. Bryant
, Hao Chuien Hang, Sarada Herke:
Hamilton path decompositions of complete multipartite graphs. J. Comb. Theory, Ser. B 135: 1-15 (2019) - 2018
- [j91]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: 79-106 (2018) - [j90]Darryn E. Bryant, Sarada Herke, Barbara M. Maenhaut, Bridget S. Webb:
On Hamilton decompositions of infinite circulant graphs. J. Graph Theory 88(3): 434-448 (2018) - 2017
- [j89]Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Ian M. Wanless:
Steiner Triple Systems with High Chromatic Index. SIAM J. Discret. Math. 31(4): 2603-2611 (2017) - [j88]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): 4850-4859 (2017) - 2016
- [j87]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): 157-173 (2016) - [j86]Darryn E. Bryant, Andrea C. Burgess, Peter Danziger:
Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs. Electron. J. Comb. 23(2): 2 (2016) - [j85]Darryn E. Bryant:
On Almost-Regular Edge Colourings of Hypergraphs. Electron. J. Comb. 23(4): 4 (2016) - 2015
- [j84]Darryn E. Bryant, Matthew Dean:
Vertex-transitive graphs that have no Hamilton decomposition. J. Comb. Theory, Ser. B 114: 237-246 (2015) - [j83]Darryn E. Bryant, Peter Danziger, William Pettersson:
Bipartite 2-Factorizations of Complete Multipartite Graphs. J. Graph Theory 78(4): 287-294 (2015) - [j82]Darryn E. Bryant, Nicholas J. Cavenagh:
Decomposing Graphs of High Minimum Degree into 4-Cycles. J. Graph Theory 79(3): 167-177 (2015) - [j81]Darryn E. Bryant, Daniel Horsley:
Steiner Triple Systems without Parallel Classes. SIAM J. Discret. Math. 29(1): 693-696 (2015) - 2014
- [j80]Darryn E. Bryant, Sarada Herke, Barbara M. Maenhaut, Wannasiri Wannasit:
Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs. Australas. J Comb. 60: 227-254 (2014) - [j79]Darryn E. Bryant, Nevena Francetic, Przemyslaw Gordinowicz, David A. Pike, Pawel Pralat:
Brushing without capacity restrictions. Discret. Appl. Math. 170: 33-45 (2014) - 2013
- [j78]Darryn E. Bryant, Daniel Horsley:
A second infinite family of Steiner triple systems without almost parallel classes. J. Comb. Theory, Ser. A 120(7): 1851-1854 (2013) - 2012
- [j77]Brian Alspach, Darryn E. Bryant, Danny Dyer:
Paley graphs have Hamilton decompositions. Discret. Math. 312(1): 113-118 (2012) - [j76]Darryn E. Bryant, Geoffrey Martin:
Small embeddings for partial triple systems of odd index. J. Comb. Theory, Ser. A 119(2): 283-309 (2012) - [j75]Darryn E. Bryant, Nicholas J. Cavenagh, Barbara M. Maenhaut, Kyle Pula, Ian M. Wanless:
Nonextendible Latin Cuboids. SIAM J. Discret. Math. 26(1): 239-249 (2012) - 2011
- [j74]Robert Brier, Darryn E. Bryant:
On the existence and embedding of edge-coloured graph decompositions. Ars Comb. 99: 445-459 (2011) - [j73]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): 507-528 (2011) - [j72]Darryn E. Bryant, Peter Danziger:
On bipartite 2-factorizations of kn - I and the Oberwolfach problem. J. Graph Theory 68(1): 22-37 (2011) - 2010
- [j71]Tran Trung Tran, Christina Kulis, Steven M. Long, Darryn E. Bryant, Peter Adams, Mark L. Smythe:
Defining scaffold geometries for interacting with proteins: geometrical classification of secondary structure linking regions. J. Comput. Aided Mol. Des. 24(11): 917-934 (2010) - [j70]Darryn E. Bryant:
Packing paths in complete graphs. J. Comb. Theory, Ser. B 100(2): 206-215 (2010) - [j69]Darryn E. Bryant, Daniel Horsley:
An asymptotic solution to the cycle decomposition problem for complete graphs. J. Comb. Theory, Ser. A 117(8): 1258-1284 (2010) - 2009
- [j68]Darryn E. Bryant, Geoffrey Martin:
Some results on decompositions of low degree circulant graphs. Australas. J Comb. 45: 251-262 (2009) - [j67]Darryn E. Bryant, Judith Egan, Barbara M. Maenhaut, Ian M. Wanless:
Indivisible plexes in latin squares. Des. Codes Cryptogr. 52(1): 93-105 (2009) - [j66]Darryn E. Bryant, Melinda Buchanan, Ian M. Wanless:
The spectrum for quasigroups with cyclic automorphisms and additional symmetries. Discret. Math. 309(4): 821-833 (2009) - [j65]Darryn E. Bryant:
Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete. Discret. Math. 309(14): 4700-4704 (2009) - [j64]Robert Brier, Darryn E. Bryant:
Perpendicular Rectangular Latin Arrays. Graphs Comb. 25(1): 15-25 (2009) - [j63]Darryn E. Bryant, Victor Scharaschkin:
Complete solutions to the Oberwolfach problem for an infinite set of orders. J. Comb. Theory, Ser. B 99(6): 904-918 (2009) - 2008
- [j62]Peter Adams, Darryn E. Bryant, Melinda Buchanan:
Completing Partial Latin Squares with Two Filled Rows and Two Filled Columns. Electron. J. Comb. 15(1) (2008) - [j61]Darryn E. Bryant, Daniel Horsley:
Packing cycles in complete graphs. J. Comb. Theory, Ser. B 98(5): 1014-1037 (2008) - 2007
- [j60]Peter Adams, Darryn E. Bryant, Mary Waterhouse:
Some equitably 2-colourable cycle decompositions. Ars Comb. 85 (2007) - [j59]Darryn E. Bryant, Melinda Buchanan:
Embedding partial totally symmetric quasigroups. J. Comb. Theory, Ser. A 114(6): 1046-1088 (2007) - [j58]Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
Erratum to: "Star factorizations of graph products". J. Graph Theory 54(1): 88-89 (2007) - 2006
- [j57]Peter Adams, Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs:
Diagonally switchable 4-cycle systems. Australas. J Comb. 34: 145-152 (2006) - [j56]Peter Adams, Darryn E. Bryant:
Two-factorisations of complete graphs of orders fifteen and seventeen. Australas. J Comb. 35: 113-118 (2006) - [j55]Robert Brier, Darryn E. Bryant:
Varieties of algebras arising from K-perfect m-cycle systems. Discret. Math. 306(17): 2038-2046 (2006) - [j54]Darryn E. Bryant, Barbara M. Maenhaut, Ian M. Wanless:
New families of atomic Latin squares and perfect 1-factorisations. J. Comb. Theory, Ser. A 113(4): 608-624 (2006) - 2005
- [j53]Darryn E. Bryant, C. David Leach, Christopher A. Rodger:
Hamilton decompositions of complete bipartite graphs with a 3-factor leave. Australas. J Comb. 31: 331-336 (2005) - [j52]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): 67-72 (2005) - 2004
- [j51]Jonathan M. Keith, Peter Adams, Darryn E. Bryant, Duncan A. E. Cochran, Gita H. Lala, Keith R. Mitchelson:
Algorithms for sequence analysis via mutagenesis. Bioinform. 20(15): 2401-2410 (2004) - [j50]Peter Adams, Darryn E. Bryant, Barbara M. Maenhaut:
Common multiples of complete graphs and a 4-cycle. Discret. Math. 275(1-3): 289-297 (2004) - [j49]Peter Adams, Darryn E. Bryant, James G. Lefevre, Mary Waterhouse:
Some equitably 3-colourable cycle decompositions. Discret. Math. 284(1-3): 21-35 (2004) - [j48]Darryn E. Bryant, Barbara M. Maenhaut, Kathleen A. S. Quinn, Bridget S. Webb:
Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves. Discret. Math. 284(1-3): 83-95 (2004) - [j47]Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Martin Macaj:
Configurations in 4-Cycle Systems. Graphs Comb. 20(2): 161-179 (2004) - [j46]Darryn E. Bryant:
Embeddings of partial Steiner triple systems. J. Comb. Theory, Ser. A 106(1): 77-108 (2004) - 2003
- [j45]Darryn E. Bryant, Heather Gavlas, Alan C. H. Ling:
Skolem-type Difference Sets for Cycle Systems. Electron. J. Comb. 10 (2003) - [j44]Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Barbara M. Maenhaut:
On the Volume of 4-Cycle Trades. Graphs Comb. 19(1): 53-63 (2003) - [j43]Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Heather Gavlas:
Factorizations of the Complete Graph into C 5-Factors and 1-Factors. Graphs Comb. 19(3): 289-296 (2003) - 2002
- [j42]Jonathan M. Keith, Peter Adams, Darryn E. Bryant, Dirk P. Kroese, Keith R. Mitchelson, Duncan A. E. Cochran, Gita H. Lala:
A simulated annealing algorithm for finding consensus sequences. Bioinform. 18(11): 1494-1499 (2002) - [j41]Tran Trung Tran, Darryn E. Bryant, Mark L. Smythe:
A Subset-orientated Algorithm for Minimizing the Number of Steps Required for Synthesis of Cyclic-peptide Libraries. Comput. Chem. 26(2): 113-117 (2002) - [j40]Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian:
The three-way intersection problem for latin squares. Discret. Math. 243(1-3): 1-19 (2002) - [j39]Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
Factorizations of and by powers of complete graphs. Discret. Math. 243(1-3): 201-205 (2002) - [j38]Darryn E. Bryant, Hung-Lin Fu:
C4-saturated bipartite graphs. Discret. Math. 259(1-3): 263-268 (2002) - [j37]Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Saad I. El-Zanati:
On the Hamilton-Waterloo Problem. Graphs Comb. 18(1): 31-51 (2002) - [j36]Darryn E. Bryant, Barbara M. Maenhaut, Ian M. Wanless:
A Family of Perfect Factorisations of Complete Bipartite Graphs. J. Comb. Theory, Ser. A 98(2): 328-342 (2002) - 2001
- [j35]Peter Adams, Darryn E. Bryant:
The μ-way intersection problem for cubes. Australas. J Comb. 23: 87-100 (2001) - [j34]Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Abdollah Khodkar:
The mu-way intersection problem for m-cycle systems. Discret. Math. 231(1-3): 27-56 (2001) - [j33]Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden, Dean G. Hoffman:
Star Decompositions of Cubes. Graphs Comb. 17(1): 55-59 (2001) - [j32]Darryn E. Bryant:
On the Oberwolfach Problem with Two Similar Length Cycles. Graphs Comb. 17(2): 199-206 (2001) - [j31]Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
Star factorizations of graph products. J. Graph Theory 36(2): 59-66 (2001) - 2000
- [j30]Darryn E. Bryant, Abdollah Khodkar:
Maximum packings of Kv - Ku with triples. Ars Comb. 55 (2000) - [j29]Peter Adams, Darryn E. Bryant, Abdollah Khodkar:
The fine structure of balanced ternary designs with block size three, index three and rho2 = 1, 2. Ars Comb. 56 (2000) - [j28]Peter Adams, Darryn E. Bryant, Abdollah Khodkar:
The fine structure of (v, 3) directed triple systems: v = 2 (mod 3). Ars Comb. 57 (2000) - [j27]Peter Adams, Darryn E. Bryant, Abdollah Khodkar:
On Alspach's conjecture with two even cycle lengths. Discret. Math. 223(1-3): 1-12 (2000) - [j26]Darryn E. Bryant, Saad I. El-Zanati, Christopher A. Rodger:
Maximal sets of Hamilton cycles in Kn, n. J. Graph Theory 33(1): 25-31 (2000) - 1999
- [j25]Darryn E. Bryant, Sheila Oates-Williams:
Strongly 2-perfect trail systems and related quasigroups. Australas. J Comb. 20: 101-110 (1999) - [j24]Peter Adams, Darryn E. Bryant, Saad I. El-Zanati:
Packing and covering the complete graph with cubes. Australas. J Comb. 20: 267- (1999) - [j23]Elizabeth J. Billington, Darryn E. Bryant:
The possible number of cycles in cycle systems. Ars Comb. 52 (1999) - 1998
- [j22]Darryn E. Bryant, Barbara M. Maenhaut:
Defining sets of G-designs. Australas. J Comb. 17: 257-266 (1998) - [j21]Darryn E. Bryant, Abdollah Khodkar:
On Orthogonal Double Covers of Graphs. Des. Codes Cryptogr. 13(2): 103-105 (1998) - 1997
- [j20]Peter Adams, Darryn E. Bryant, Abdollah Khodkar, Saad I. El-Zanati:
The intersection problem for cubes. Australas. J Comb. 15: 127-134 (1997) - [j19]Darryn E. Bryant:
On the volume of trades in triple systems. Australas. J Comb. 15: 161-176 (1997) - [j18]B. J. Battersby, Darryn E. Bryant, Christopher A. Rodger:
Factorizations of complete multigraphs. Australas. J Comb. 16: 35-44 (1997) - [j17]Darryn E. Bryant, Sheila Oates-Williams:
Strongly 2-perfect cycle systems and their quasigroups. Discret. Math. 167-168: 167-174 (1997) - [j16]Darryn E. Bryant, Christopher A. Rodger, Erin R. Spicer:
Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14. Discret. Math. 171(1-3): 55-75 (1997) - [j15]Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
d-Cube decompositions ofKn/Km. Graphs Comb. 13(1): 1-7 (1997) - [j14]Darryn E. Bryant:
2m-Cycle Systems of K 2m+1\C m. Graphs Comb. 13(3): 227-229 (1997) - 1996
- [j13]Darryn E. Bryant, Dean G. Hoffman, Christopher A. Rodger:
5-Cycle Systems with Holes. Des. Codes Cryptogr. 8(1-2): 103-108 (1996) - [j12]Peter Adams, Elizabeth J. Billington, Darryn E. Bryant:
Partitionable perfect cycle systems with cycle lengths 6 and 8. Discret. Math. 149(1-3): 1-9 (1996) - [j11]Darryn E. Bryant:
A special class of nested Steiner triple systems. Discret. Math. 152(1-3): 315-320 (1996) - [j10]Peter Adams, Darryn E. Bryant:
The spectrum problem for the Petersen graph. J. Graph Theory 22(2): 175-180 (1996) - 1995
- [j9]Peter Adams, Darryn E. Bryant, Saad I. El-Zanati:
Lambda-fold cube decompositions. Australas. J Comb. 11: 197-210 (1995) - [j8]Darryn E. Bryant, Sheila Oates-Williams:
Mendelsohn designs associated with a class of idempotent quasigroups. Discret. Math. 138(1-3): 161-167 (1995) - [j7]Darryn E. Bryant, Peter Adams:
Decomposing the complete graph into cycles of many lengths. Graphs Comb. 11(2): 97-102 (1995) - 1994
- [j6]Darryn E. Bryant, Saad I. El-Zanati, Robert B. Gardner:
Decompositions of Km, n and Kn into cubes. Australas. J Comb. 9: 285-290 (1994) - [j5]Darryn E. Bryant, Christopher A. Rodger:
The Doyen-Wilson Theorem Extended to 5-Cycles. J. Comb. Theory, Ser. A 68(1): 218-225 (1994) - 1993
- [j4]Alan Rahilly, Cheryl E. Praeger, Anne Penfold Street, Darryn E. Bryant:
Half-regular symmetric designs. Australas. J Comb. 8: 1-26 (1993) - [j3]Darryn E. Bryant, Peter Adams:
2-perfect closed m-trail systems of the complete directed graph with loops. Australas. J Comb. 8: 127-142 (1993) - 1992
- [j2]Darryn E. Bryant:
Varieties of P-quasigroups. Australas. J Comb. 6: 229-244 (1992) - [j1]Darryn E. Bryant:
Varieties of Quasigroups Arising from 2-Perfect m-Cycle Systems. Des. Codes Cryptogr. 2(2): 159-168 (1992)
Conference and Workshop Papers
- 2003
- [c1]Jonathan M. Keith, Peter Adams, Darryn E. Bryant, Keith R. Mitchelson, Duncan A. E. Cochran, Gita H. Lala:
Inferring an Original Sequence from Erroneous Copies : A Bayesian Approach. APBC 2003: 23-28
Informal and Other Publications
- 2015
- [i1]Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin:
Compressed sensing and designs: theory and simulations. CoRR abs/1503.07424 (2015)
Coauthor Index
a service of 
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 2023-10-22 22:07 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:
