default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Adams 0001
Person information
- affiliation: University of Queensland, Department of Mathematics, Brisbane, Australia
Other persons with the same name
- Peter Adams — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j42]Peter Adams, Ryan C. Bunge, Roger B. Eggleton, Saad I. El-Zanati, Ugur Odabasi, Wannasiri Wannasit:
Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12. Bull. ICA 92: 50-61 (2021)- [j41]Peter Adams, Saad I. El-Zanati, Ugur Odabasi, Wannasiri Wannasit:
The spectrum problem for the connected cubic graphs of order 10. Discuss. Math. Graph Theory 41(4): 963-980 (2021) - 2020
- [j40]Peter Adams, Saad I. El-Zanati, Peter Florido, William F. Turner:
On 2- and 3-factorizations of complete 3-uniform hypergraphs of order up to 9. Australas. J Comb. 78: 100-113 (2020)
2010 – 2019
- 2018
- [j39]Peter Adams, Saad I. El-Zanati, Wannasiri Wannasit:
The Spectrum Problem for the Cubic Graphs of Order 8. Ars Comb. 137: 345-354 (2018) - 2011
- [j38]Stephen M. Long, Tran Trung Tran, Peter Adams, Paul J. Darwen
, Mark L. Smythe:
Conformational searching using a population-based incremental learning algorithm. J. Comput. Chem. 32(8): 1541-1549 (2011) - 2010
- [j37]Peter Adams, Elizabeth J. Billington, Dean G. Hoffman, Charles Curtis Lindner:
The generalized almost resolvable cycle system problem. Comb. 30(6): 617-625 (2010) - [j36]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)
2000 – 2009
- 2009
- [j35]Peter Adams, James G. Lefevre, Mary Waterhouse:
On 2-perfect cube decompositions. Australas. J Comb. 44: 95-104 (2009) - [j34]Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho:
Spanning cubic graph designs. Discret. Math. 309(18): 5781-5788 (2009) - 2008
- [j33]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) - [j32]Jonathan M. Keith, Peter Adams, Stuart Stephen, John S. Mattick:
Delineating Slowly and Rapidly Evolving Fractions of the Drosophila Genome. J. Comput. Biol. 15(4): 407-430 (2008) - 2007
- [j31]Peter Adams, Darryn E. Bryant, Mary Waterhouse:
Some equitably 2-colourable cycle decompositions. Ars Comb. 85 (2007) - 2006
- [j30]Peter Adams, Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs:
Diagonally switchable 4-cycle systems. Australas. J Comb. 34: 145-152 (2006) - [j29]Peter Adams, Darryn E. Bryant:
Two-factorisations of complete graphs of orders fifteen and seventeen. Australas. J Comb. 35: 113-118 (2006) - 2004
- [j28]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) - [j27]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) - [j26]Peter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian:
On the forced matching numbers of bipartite graphs. Discret. Math. 281(1-3): 1-12 (2004) - [j25]Peter Adams, Darryn E. Bryant, James G. Lefevre, Mary Waterhouse:
Some equitably 3-colourable cycle decompositions. Discret. Math. 284(1-3): 21-35 (2004) - 2003
- [j24]Peter Adams, Richard Bean, Abdollah Khodkar:
A census of critical sets in the Latin squares of order at most six. Ars Comb. 68 (2003) - [j23]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) - [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 - 2002
- [j22]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) - [j21]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) - [j20]Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Saad I. El-Zanati:
On the Hamilton-Waterloo Problem. Graphs Comb. 18(1): 31-51 (2002) - 2001
- [j19]Peter Adams, Darryn E. Bryant:
The μ-way intersection problem for cubes. Australas. J Comb. 23: 87-100 (2001) - [j18]Peter Adams, Abdollah Khodkar:
Smallest weak and smallest totally weak critical set in the latin squares of order at most seven. Ars Comb. 61 (2001) - [j17]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) - 2000
- [j16]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) - [j15]Peter Adams, Darryn E. Bryant, Abdollah Khodkar:
The fine structure of (v, 3) directed triple systems: v = 2 (mod 3). Ars Comb. 57 (2000) - [j14]Peter Adams, Elizabeth J. Billington, Italo J. Dejter, Charles Curtis Lindner:
The number of 4-cycles in 2-factorizations of K2n minus a 1-factor. Discret. Math. 220(1-3): 1-11 (2000) - [j13]Peter Adams, Darryn E. Bryant, Abdollah Khodkar:
On Alspach's conjecture with two even cycle lengths. Discret. Math. 223(1-3): 1-12 (2000)
1990 – 1999
- 1999
- [j12]Peter Adams, Darryn E. Bryant, Saad I. El-Zanati:
Packing and covering the complete graph with cubes. Australas. J Comb. 20: 267- (1999) - 1997
- [j11]Peter Adams, Darryn E. Bryant, Abdollah Khodkar, Saad I. El-Zanati:
The intersection problem for cubes. Australas. J Comb. 15: 127-134 (1997) - [j10]Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
d-Cube decompositions ofKn/Km. Graphs Comb. 13(1): 1-7 (1997) - 1996
- [j9]Peter Adams, Elizabeth J. Billington:
Lambda-fold 3-perfect 9-cycle systems. Ars Comb. 44 (1996) - [j8]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) - [j7]Peter Adams, Darryn E. Bryant:
The spectrum problem for the Petersen graph. J. Graph Theory 22(2): 175-180 (1996) - 1995
- [j6]Peter Adams, Darryn E. Bryant, Saad I. El-Zanati:
Lambda-fold cube decompositions. Australas. J Comb. 11: 197-210 (1995) - [j5]Darryn E. Bryant, Peter Adams:
Decomposing the complete graph into cycles of many lengths. Graphs Comb. 11(2): 97-102 (1995) - 1993
- [j4]Peter Adams, Elizabeth J. Billington:
Completing some spectra for 2-perfect cycle systems. Australas. J Comb. 7: 175-188 (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) - [j2]Peter Adams, Elizabeth J. Billington, Charles C. Lindner:
Corrigendum: The spectrum for 3-perfect 9-cycle systems. Australas. J Comb. 8: 277-278 (1993) - 1992
- [j1]Peter Adams, Elizabeth J. Billington, Charles C. Lindner:
The spectrum for 3-perfect 9-cycle systems. Australas. J Comb. 5: 103-108 (1992)
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-04-25 05:54 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:
