default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert F. Bailey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Robert F. Bailey, Keenan B. Nicholson:
Decoding twisted permutation codes. Australas. J Comb. 88: 144-159 (2024)- 2023
- [j16]Robert F. Bailey, Iren Darijani:
Block colourings of star systems. Discret. Math. 346(8): 113404 (2023) - [j15]Robert F. Bailey, Daniel R. Hawtin
:
On the classification of binary completely transitive codes with almost-simple top-group. Eur. J. Comb. 107: 103604 (2023) - [i1]Robert F. Bailey, Keenan B. Nicholson:
Decoding twisted permutation codes. CoRR abs/2304.07126 (2023) - 2020
- [j14]Robert F. Bailey, Daniel R. Hawtin:
On the 486-Vertex Distance-Regular Graphs of Koolen-Riebeek and Soicher. Electron. J. Comb. 27(3): 3 (2020)
2010 – 2019
- 2018
- [j13]Robert F. Bailey:
On the metric dimension of incidence graphs. Discret. Math. 341(6): 1613-1619 (2018) - 2016
- [j12]R. Julian R. Abel, Robert F. Bailey, Andrea C. Burgess, Peter Danziger, Eric Mendelsohn:
On generalized Howell designs with block size three. Des. Codes Cryptogr. 81(2): 365-391 (2016) - 2015
- [j11]Robert F. Bailey:
The metric dimension of small distance-regular and strongly regular graphs. Australas. J Comb. 62: 18-34 (2015) - 2014
- [j10]Robert F. Bailey, Mike Newman, Brett Stevens:
A note on packing spanning trees in graphs and bases in matroids. Australas. J Comb. 59: 24-38 (2014) - 2013
- [j9]Robert F. Bailey, Andrea C. Burgess:
Generalized packing designs. Discret. Math. 313(11): 1167-1190 (2013) - [j8]Robert F. Bailey, José Cáceres, Delia Garijo, Antonio González Herrera, Alberto Márquez, Karen Meagher, María Luz Puertas:
Resolving sets for Johnson and Kneser graphs. Eur. J. Comb. 34(4): 736-751 (2013) - 2012
- [j7]Robert F. Bailey, Thomas Prellberg:
Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns. Contributions Discret. Math. 7(1) (2012) - 2011
- [j6]Robert F. Bailey, Brett Stevens:
Uncoverings on graphs and network reliability. Australas. J Comb. 50: 219-232 (2011) - [j5]Robert F. Bailey, Karen Meagher:
On the metric dimension of Grassmann graphs. Discret. Math. Theor. Comput. Sci. 13(4): 97-104 (2011) - 2010
- [j4]Robert F. Bailey, Brett Stevens:
Hamiltonian decompositions of complete k-uniform hypergraphs. Discret. Math. 310(22): 3088-3095 (2010)
2000 – 2009
- 2009
- [j3]Robert F. Bailey:
Error-correcting codes from permutation groups. Discret. Math. 309(13): 4253-4265 (2009) - 2007
- [j2]Robert F. Bailey, John Bray:
Decoding the Mathieu group M12. Adv. Math. Commun. 1(4): 477-487 (2007) - 2006
- [j1]Robert F. Bailey:
Uncoverings-by-bases for base-transitive permutation groups. Des. Codes Cryptogr. 41(2): 153-176 (2006)
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:59 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:
