default search action
Ian M. Wanless
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j70]Michael J. Gill
, Ian M. Wanless:
Pairs of MOLS of order ten satisfying non-trivial relations. Des. Codes Cryptogr. 91(4): 1293-1313 (2023) - 2022
- [j69]Ian M. Wanless
A General Framework for Hypergraph Coloring. SIAM J. Discret. Math. 36(3): 1663-1677 (2022) - 2021
- [j68]Pu Gao, Reshma Ramadurai, Ian M. Wanless, Nick Wormald:
Full rainbow matchings in graphs and hypergraphs. Comb. Probab. Comput. 30(5): 762-780 (2021) - [j67]Nicholas J. Cavenagh, Adam Mammoliti, Ian M. Wanless
Maximal sets of mutually orthogonal frequency squares. Des. Codes Cryptogr. 89(3): 525-558 (2021) - [j66]Jack Allsop, Ian M. Wanless:
Degree of orthomorphism polynomials over finite fields. Finite Fields Their Appl. 75: 101893 (2021) - [j65]Anthony B. Evans, Adam Mammoliti, Ian M. Wanless:
Latin squares with maximal partial transversals of many lengths. J. Comb. Theory A 180: 105403 (2021) - [j64]Saieed Akbari
Induced path factors of regular graphs. J. Graph Theory 97(2): 260-280 (2021) - 2020
- [j63]Thomas Britz
Mutually Orthogonal Binary Frequency Squares. Electron. J. Comb. 27(3): 3 (2020) - [j62]Carly Bodkin
Most binary matrices have no small defining set. Discret. Math. 343(10): 112035 (2020) - [j61]Saieed Akbari
Zero-sum flows for Steiner systems. Discret. Math. 343(11): 112074 (2020) - [j60]Kevin Hendrey, Ian M. Wanless
Covering radius in the Hamming permutation space. Eur. J. Comb. 84 (2020)
2010 – 2019
- 2019
- [j59]Darcy Best, Trent G. Marbach
Covers and partial transversals of Latin squares. Des. Codes Cryptogr. 87(5): 1109-1136 (2019) - 2018
- [j58]Nevena Francetic, Sarada Herke
Parity of sets of mutually orthogonal Latin squares. J. Comb. Theory A 155: 67-99 (2018) - [j57]Heiko Dietrich
Small partial Latin squares that embed in an infinite group but not into any finite group. J. Symb. Comput. 86: 142-152 (2018) - 2017
- [j56]Ian M. Wanless, Bridget S. Webb:
Small partial Latin squares that cannot be embedded in a Cayley table. Australas. J Comb. 67: 352-363 (2017) - [j55]Jeffrey H. Dinitz, Ian M. Wanless:
The existence of square integer Heffter arrays. Ars Math. Contemp. 13(1): 81-93 (2017) - [j54]Nicholas J. Cavenagh, Ian M. Wanless:
Latin Squares with No Transversals. Electron. J. Comb. 24(2): 2 (2017) - [j53]Nevena Francetic, Sarada Herke
On Ryser's conjecture for linear intersecting multipartite hypergraphs. Eur. J. Comb. 61: 91-105 (2017) - [j52]Darryn E. Bryant
Steiner Triple Systems with High Chromatic Index. SIAM J. Discret. Math. 31(4): 2603-2611 (2017) - 2016
- [j51]Ron Aharoni, János Barát
Multipartite Hypergraphs Achieving Equality in Ryser's Conjecture. Graphs Comb. 32(1): 1-15 (2016) - [j50]Judith Egan, Ian M. Wanless:
Enumeration of MOLS of small order. Math. Comput. 85(298): 799-824 (2016) - 2015
- [j49]Marsha Minchenko, Ian M. Wanless:
Quartic integral Cayley graphs. Ars Math. Contemp. 8(2): 381-408 (2015) - [j48]Michael Kinyon
Loops with exponent three in all isotopes. Int. J. Algebra Comput. 25(7): 1159-1177 (2015) - 2014
- [j47]János Barát, Ian M. Wanless:
Rainbow matchings and transversals. Australas. J Comb. 59: 211-217 (2014) - [j46]Petteri Kaski, André de Souza Medeiros, Patric R. J. Östergård, Ian M. Wanless:
Switching in One-Factorisations of Complete Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j45]Tony Grubman, Ian M. Wanless:
Growth rate of canonical and minimal group embeddings of spherical latin trades. J. Comb. Theory A 123(1): 57-72 (2014) - [j44]Joshua Browning, Peter J. Cameron
Bounds on the number of small Latin subsquares. J. Comb. Theory A 124: 41-56 (2014) - 2013
- [j43]Joshua Browning, Douglas S. Stones, Ian M. Wanless:
Bounds on the number of autotopisms and subsquares of a Latin square. Comb. 33(1): 11-22 (2013) - [j42]Ian M. Wanless, Xiande Zhang:
On the existence of retransmission permutation arrays. Discret. Appl. Math. 161(16-17): 2772-2777 (2013) - [j41]Ian M. Wanless, Xiande Zhang:
Transversals of Latin squares and covering radius of sets of permutations. Eur. J. Comb. 34(7): 1130-1143 (2013) - [j40]Christopher J. Shallue, Ian M. Wanless:
Permutation polynomials and orthomorphism polynomials of degree six. Finite Fields Their Appl. 20: 84-92 (2013) - 2012
- [j39]Darryn E. Bryant
Nonextendible Latin Cuboids. SIAM J. Discret. Math. 26(1): 239-249 (2012) - [i1]Ian M. Wanless, Xiande Zhang:
On the Existence of Retransmission Permutation Arrays. CoRR abs/1210.8223 (2012) - 2011
- [j38]Peter Danziger, Ian M. Wanless, Bridget S. Webb:
Monogamous latin squares. J. Comb. Theory A 118(3): 796-807 (2011) - [j37]Ljiljana Brankovic
Graceful Labelling: State of the Art, Applications and Future Directions. Math. Comput. Sci. 5(1): 11-20 (2011) - 2010
- [j36]Ian M. Wanless:
Counting Matchings and Tree-Like Walks in Regular Graphs. Comb. Probab. Comput. 19(3): 463-480 (2010) - [j35]Nicholas J. Cavenagh, Ian M. Wanless:
On the number of transversals in Cayley tables of cyclic groups. Discret. Appl. Math. 158(2): 136-146 (2010) - [j34]Douglas S. Stones, Ian M. Wanless:
Compound orthomorphisms of the cyclic group. Finite Fields Their Appl. 16(4): 277-289 (2010) - [j33]Douglas S. Stones, Ian M. Wanless:
Divisors of the number of Latin rectangles. J. Comb. Theory A 117(2): 204-215 (2010)
2000 – 2009
- 2009
- [j32]Paulette Lieby, Brendan D. McKay
Subgraphs of Random k-Edge-Coloured k-Regular Graphs. Comb. Probab. Comput. 18(4): 533-549 (2009) - [j31]Darryn E. Bryant
Indivisible plexes in latin squares. Des. Codes Cryptogr. 52(1): 93-105 (2009) - [j30]Darryn E. Bryant
The spectrum for quasigroups with cyclic automorphisms and additional symmetries. Discret. Math. 309(4): 821-833 (2009) - 2008
- [j29]Nicholas J. Cavenagh, Catherine S. Greenhill, Ian M. Wanless:
The cycle structure of two rows in a random Latin square. Random Struct. Algorithms 33(3): 286-309 (2008) - [j28]Brendan D. McKay
A Census of Small Latin Hypercubes. SIAM J. Discret. Math. 22(2): 719-736 (2008) - 2007
- [j27]Ian M. Wanless:
A computer enumeration of small latin trades. Australas. J Comb. 39: 247-258 (2007) - [j26]Gi-Sang Cheon
An interpretation of the Dittert conjecture in terms of semi-matchings. Discret. Math. 307(21): 2501-2507 (2007) - [j25]Barbara M. Maenhaut, Ian M. Wanless, Bridget S. Webb:
Subsquare-free Latin squares of odd order. Eur. J. Comb. 28(1): 322-336 (2007) - 2006
- [j24]Stephen Taylor, Ian M. Wanless, Natashia L. Boland:
Distance domination and amplifier placement problems. Australas. J Comb. 34: 117-136 (2006) - [j23]Ian M. Wanless:
Addendum To Schrijver's Work On Minimum Permanents. Comb. 26(6): 743-745 (2006) - [j22]Ian M. Wanless, Bridget S. Webb:
The Existence of Latin Squares without Orthogonal Mates. Des. Codes Cryptogr. 40(1): 131-135 (2006) - [j21]Brendan D. McKay
The number of transversals in a Latin square. Des. Codes Cryptogr. 40(3): 269-284 (2006) - [j20]Darryn E. Bryant
New families of atomic Latin squares and perfect 1-factorisations. J. Comb. Theory A 113(4): 608-624 (2006) - 2005
- [j19]Ian M. Wanless:
Atomic Latin Squares based on Cyclotomic Orthomorphisms. Electron. J. Comb. 12 (2005) - [j18]Peter J. Cameron
Covering radius for sets of permutations. Discret. Math. 293(1-3): 91-109 (2005) - 2004
- [j17]Ian M. Wanless:
Diagonally cyclic latin squares. Eur. J. Comb. 25(3): 393-413 (2004) - [j16]Ian M. Wanless:
Cycle Switches in Latin Squares. Graphs Comb. 20(4): 545-570 (2004) - 2002
- [j15]Ian M. Wanless:
A Generalisation of Transversals for Latin Squares. Electron. J. Comb. 9(1) (2002) - [j14]Brendan D. McKay
Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. Comb. Probab. Comput. 11(4): 373-392 (2002) - [j13]Darryn E. Bryant
A Family of Perfect Factorisations of Complete Bipartite Graphs. J. Comb. Theory A 98(2): 328-342 (2002) - 2001
- [j12]Ian M. Wanless:
Path achievement games. Australas. J Comb. 23: 9-18 (2001) - [j11]Ian M. Wanless:
McLeish's construction for Latin squares without intercalates. Ars Comb. 58 (2001) - [j10]Ian M. Wanless:
Answers to Questions by Dénes on Latin Power Sets. Eur. J. Comb. 22(7): 1009-1020 (2001) - [j9]Ian M. Wanless, Nicholas C. Wormald:
Regular Graphs with No Homomorphisms onto Cycles. J. Comb. Theory B 82(1): 155-160 (2001) - [j8]Zhicheng Gao, Ian M. Wanless, Nicholas C. Wormald:
Counting 5-connected planar triangulations. J. Graph Theory 38(1): 18-35 (2001) - 2000
- [j7]Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald:
The asymptotic number of graphs with a restriction on the maximum degree. Electron. Notes Discret. Math. 5: 228-230 (2000)
1990 – 1999
- 1999
- [j6]Ian M. Wanless:
Perfect Factorisations of Bipartite Graphs and Latin Squares Without Proper Subrectangles. Electron. J. Comb. 6 (1999) - [j5]Ian M. Wanless:
Maximising the permanent and complementary permanent of (0, 1)-matrices with constant line sum. Discret. Math. 205(1-3): 191-205 (1999) - [j4]Brendan D. McKay
Most Latin Squares Have Many Subsquares. J. Comb. Theory A 86(2): 323-347 (1999) - 1998
- [j3]Brendan D. McKay, Ian M. Wanless:
Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles. Electron. J. Comb. 5 (1998) - 1997
- [j2]Ian M. Wanless:
On the periodicity of graph games. Australas. J Comb. 16: 113-124 (1997) - [j1]W. P. Galvin, Ian M. Wanless:
A bound for the total tardiness problem on a single machine. Australas. J Comb. 16: 155-164 (1997)
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-08-05 20:23 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: