The spectrum for 3-perfect 9-cycle systems. - Peter Adams 001; Elizabeth J. Billington; Charles C. Lindner (Australas. J Comb., 1992)

Completing some spectra for 2-perfect cycle systems. - Peter Adams 001; Elizabeth J. Billington (Australas. J Comb., 1993)

Corrigendum: The spectrum for 3-perfect 9-cycle systems. - Peter Adams 001; Elizabeth J. Billington; Charles C. Lindner (Australas. J Comb., 1993)

2-perfect closed m-trail systems of the complete directed graph with loops. - Darryn E. Bryant; Peter Adams 001 (Australas. J Comb., 1993)

Lambda-fold cube decompositions. - Peter Adams 001; Darryn E. Bryant; Saad I. El-Zanati (Australas. J Comb., 1995)

Decomposing the complete graph into cycles of many lengths. - Darryn E. Bryant; Peter Adams 001 (Graphs Comb., 1995)

Lambda-fold 3-perfect 9-cycle systems. - Peter Adams 001; Elizabeth J. Billington (Ars Comb., 1996)

Partitionable perfect cycle systems with cycle lengths 6 and 8. - Peter Adams 001; Elizabeth J. Billington; Darryn E. Bryant (Discret. Math., 1996)

The spectrum problem for the Petersen graph. - Peter Adams 001; Darryn E. Bryant (J. Graph Theory, 1996)

The intersection problem for cubes. - Peter Adams 001; Darryn E. Bryant; Abdollah Khodkar; Saad I. El-Zanati (Australas. J Comb., 1997)

d-Cube decompositions ofKn/Km. - Peter Adams 001; Darryn E. Bryant; Saad I. El-Zanati; Charles Vanden Eynden (Graphs Comb., 1997)

Packing and covering the complete graph with cubes. - Peter Adams 001; Darryn E. Bryant; Saad I. El-Zanati (Australas. J Comb., 1999)

The fine structure of balanced ternary designs with block size three, index three and rho2 = 1, 2. - Peter Adams 001; Darryn E. Bryant; Abdollah Khodkar (Ars Comb., 2000)

The fine structure of (v, 3) directed triple systems: v = 2 (mod 3). - Peter Adams 001; Darryn E. Bryant; Abdollah Khodkar (Ars Comb., 2000)

The number of 4-cycles in 2-factorizations of K2n minus a 1-factor. - Peter Adams 001; Elizabeth J. Billington; Italo J. Dejter; Charles Curtis Lindner (Discret. Math., 2000)

On Alspach's conjecture with two even cycle lengths. - Peter Adams 001; Darryn E. Bryant; Abdollah Khodkar (Discret. Math., 2000)

The μ-way intersection problem for cubes. - Peter Adams 001; Darryn E. Bryant (Australas. J Comb., 2001)

Smallest weak and smallest totally weak critical set in the latin squares of order at most seven. - Peter Adams 001; Abdollah Khodkar (Ars Comb., 2001)

The mu-way intersection problem for m-cycle systems. - Peter Adams 001; Elizabeth J. Billington; Darryn E. Bryant; Abdollah Khodkar (Discret. Math., 2001)

A simulated annealing algorithm for finding consensus sequences. - Jonathan M. Keith; Peter Adams 001; Darryn E. Bryant; Dirk P. Kroese; Keith R. Mitchelson; Duncan A. E. Cochran; Gita H. Lala (Bioinform., 2002)

The three-way intersection problem for latin squares. - Peter Adams 001; Elizabeth J. Billington; Darryn E. Bryant; Ebadollah S. Mahmoodian (Discret. Math., 2002)

On the Hamilton-Waterloo Problem. - Peter Adams 001; Elizabeth J. Billington; Darryn E. Bryant; Saad I. El-Zanati (Graphs Comb., 2002)

Inferring an Original Sequence from Erroneous Copies : A Bayesian Approach. - Jonathan M. Keith; Peter Adams 001; Darryn E. Bryant; Keith R. Mitchelson; Duncan A. E. Cochran; Gita H. Lala (APBC, 2003)

A census of critical sets in the Latin squares of order at most six. - Peter Adams 001; Richard Bean 001; Abdollah Khodkar (Ars Comb., 2003)

Factorizations of the Complete Graph into C 5-Factors and 1-Factors. - Peter Adams 001; Darryn E. Bryant; Saad I. El-Zanati; Heather Gavlas (Graphs Comb., 2003)

Algorithms for sequence analysis via mutagenesis. - Jonathan M. Keith; Peter Adams 001; Darryn E. Bryant; Duncan A. E. Cochran; Gita H. Lala; Keith R. Mitchelson (Bioinform., 2004)

Some equitably 3-colourable cycle decompositions. - Peter Adams 001; Darryn E. Bryant; James G. Lefevre; Mary Waterhouse (Discret. Math., 2004)

Common multiples of complete graphs and a 4-cycle. - Peter Adams 001; Darryn E. Bryant; Barbara M. Maenhaut (Discret. Math., 2004)

On the forced matching numbers of bipartite graphs. - Peter Adams 001; Mohammad Mahdian; Ebadollah S. Mahmoodian (Discret. Math., 2004)

Two-factorisations of complete graphs of orders fifteen and seventeen. - Peter Adams 001; Darryn E. Bryant (Australas. J Comb., 2006)

Diagonally switchable 4-cycle systems. - Peter Adams 001; Darryn E. Bryant; Mike J. Grannell; Terry S. Griggs (Australas. J Comb., 2006)

Some equitably 2-colourable cycle decompositions. - Peter Adams 001; Darryn E. Bryant; Mary Waterhouse (Ars Comb., 2007)

Completing Partial Latin Squares with Two Filled Rows and Two Filled Columns. - Peter Adams 001; Darryn E. Bryant; Melinda Buchanan (Electron. J. Comb., 2008)

Delineating Slowly and Rapidly Evolving Fractions of the Drosophila Genome. - Jonathan M. Keith; Peter Adams 001; Stuart Stephen; John S. Mattick (J. Comput. Biol., 2008)

On 2-perfect cube decompositions. - Peter Adams 001; James G. Lefevre; Mary Waterhouse (Australas. J Comb., 2009)

Spanning cubic graph designs. - Peter Adams 001; Hayri Ardal; Ján Manuch; Vu Dinh Hoa; Moshe Rosenfeld 001; Ladislav Stacho (Discret. Math., 2009)

The generalized almost resolvable cycle system problem. - Peter Adams 001; Elizabeth J. Billington; Dean G. Hoffman; Charles Curtis Lindner (Comb., 2010)

Defining scaffold geometries for interacting with proteins: geometrical classification of secondary structure linking regions. - Tran Trung Tran; Christina Kulis; Steven M. Long; Darryn E. Bryant; Peter Adams 001; Mark L. Smythe (J. Comput. Aided Mol. Des., 2010)

Conformational searching using a population-based incremental learning algorithm. - Stephen M. Long; Tran Trung Tran; Peter Adams 001; Paul J. Darwen; Mark L. Smythe (J. Comput. Chem., 2011)

The Spectrum Problem for the Cubic Graphs of Order 8. - Peter Adams 001; Saad I. El-Zanati; Wannasiri Wannasit (Ars Comb., 2018)

On 2- and 3-factorizations of complete 3-uniform hypergraphs of order up to 9. - Peter Adams 001; Saad I. El-Zanati; Peter Florido; William F. Turner (Australas. J Comb., 2020)

Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12. - Peter Adams 001; Ryan C. Bunge; Roger B. Eggleton; Saad I. El-Zanati; Ugur Odabasi; Wannasiri Wannasit (Bull. ICA, 2021)

The spectrum problem for the connected cubic graphs of order 10. - Peter Adams 001; Saad I. El-Zanati; Ugur Odabasi; Wannasiri Wannasit (Discuss. Math. Graph Theory, 2021)