A bound for the total tardiness problem on a single machine. - W. P. Galvin; Ian M. Wanless (Australas. J Comb., 1997)

On the periodicity of graph games. - Ian M. Wanless (Australas. J Comb., 1997)

Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles. - Brendan D. McKay; Ian M. Wanless (Electron. J. Comb., 1998)

Perfect Factorisations of Bipartite Graphs and Latin Squares Without Proper Subrectangles. - Ian M. Wanless (Electron. J. Comb., 1999)

Maximising the permanent and complementary permanent of (0, 1)-matrices with constant line sum. - Ian M. Wanless (Discret. Math., 1999)

Most Latin Squares Have Many Subsquares. - Brendan D. McKay; Ian M. Wanless (J. Comb. Theory A, 1999)

The asymptotic number of graphs with a restriction on the maximum degree. - Brendan D. McKay; Ian M. Wanless; Nicholas C. Wormald (Electron. Notes Discret. Math., 2000)

Path achievement games. - Ian M. Wanless (Australas. J Comb., 2001)

McLeish's construction for Latin squares without intercalates. - Ian M. Wanless (Ars Comb., 2001)

Answers to Questions by Dénes on Latin Power Sets. - Ian M. Wanless (Eur. J. Comb., 2001)

Regular Graphs with No Homomorphisms onto Cycles. - Ian M. Wanless; Nicholas C. Wormald (J. Comb. Theory B, 2001)

Counting 5-connected planar triangulations. - Zhicheng Gao; Ian M. Wanless; Nicholas C. Wormald (J. Graph Theory, 2001)

A Generalisation of Transversals for Latin Squares. - Ian M. Wanless (Electron. J. Comb., 2002)

Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. - Brendan D. McKay; Ian M. Wanless; Nicholas C. Wormald (Comb. Probab. Comput., 2002)

A Family of Perfect Factorisations of Complete Bipartite Graphs. - Darryn E. Bryant; Barbara M. Maenhaut; Ian M. Wanless (J. Comb. Theory A, 2002)

Diagonally cyclic latin squares. - Ian M. Wanless (Eur. J. Comb., 2004)

Cycle Switches in Latin Squares. - Ian M. Wanless (Graphs Comb., 2004)

Atomic Latin Squares based on Cyclotomic Orthomorphisms. - Ian M. Wanless (Electron. J. Comb., 2005)

Covering radius for sets of permutations. - Peter J. Cameron; Ian M. Wanless (Discret. Math., 2005)

Distance domination and amplifier placement problems. - Stephen Taylor; Ian M. Wanless; Natashia L. Boland (Australas. J Comb., 2006)

Addendum To Schrijver's Work On Minimum Permanents. - Ian M. Wanless (Comb., 2006)

The number of transversals in a Latin square. - Brendan D. McKay; Jeanette C. McLeod; Ian M. Wanless (Des. Codes Cryptogr., 2006)

The Existence of Latin Squares without Orthogonal Mates. - Ian M. Wanless; Bridget S. Webb (Des. Codes Cryptogr., 2006)

New families of atomic Latin squares and perfect 1-factorisations. - Darryn E. Bryant; Barbara M. Maenhaut; Ian M. Wanless (J. Comb. Theory A, 2006)

A computer enumeration of small latin trades. - Ian M. Wanless (Australas. J Comb., 2007)

An interpretation of the Dittert conjecture in terms of semi-matchings. - Gi-Sang Cheon; Ian M. Wanless (Discret. Math., 2007)

Subsquare-free Latin squares of odd order. - Barbara M. Maenhaut; Ian M. Wanless; Bridget S. Webb (Eur. J. Comb., 2007)

The cycle structure of two rows in a random Latin square. - Nicholas J. Cavenagh; Catherine S. Greenhill; Ian M. Wanless (Random Struct. Algorithms, 2008)

A Census of Small Latin Hypercubes. - Brendan D. McKay; Ian M. Wanless (SIAM J. Discret. Math., 2008)

Subgraphs of Random k-Edge-Coloured k-Regular Graphs. - Paulette Lieby; Brendan D. McKay; Jeanette C. McLeod; Ian M. Wanless (Comb. Probab. Comput., 2009)

Indivisible plexes in latin squares. - Darryn E. Bryant; Judith Egan; Barbara M. Maenhaut; Ian M. Wanless (Des. Codes Cryptogr., 2009)

The spectrum for quasigroups with cyclic automorphisms and additional symmetries. - Darryn E. Bryant; Melinda Buchanan; Ian M. Wanless (Discret. Math., 2009)

Counting Matchings and Tree-Like Walks in Regular Graphs. - Ian M. Wanless (Comb. Probab. Comput., 2010)

On the number of transversals in Cayley tables of cyclic groups. - Nicholas J. Cavenagh; Ian M. Wanless (Discret. Appl. Math., 2010)

Compound orthomorphisms of the cyclic group. - Douglas S. Stones; Ian M. Wanless (Finite Fields Their Appl., 2010)

Divisors of the number of Latin rectangles. - Douglas S. Stones; Ian M. Wanless (J. Comb. Theory A, 2010)

Monogamous latin squares. - Peter Danziger; Ian M. Wanless; Bridget S. Webb (J. Comb. Theory A, 2011)

Graceful Labelling: State of the Art, Applications and Future Directions. - Ljiljana Brankovic; Ian M. Wanless (Math. Comput. Sci., 2011)

Nonextendible Latin Cuboids. - Darryn E. Bryant; Nicholas J. Cavenagh; Barbara M. Maenhaut; Kyle Pula; Ian M. Wanless (SIAM J. Discret. Math., 2012)

Bounds on the number of autotopisms and subsquares of a Latin square. - Joshua Browning; Douglas S. Stones; Ian M. Wanless (Comb., 2013)

On the existence of retransmission permutation arrays. - Ian M. Wanless; Xiande Zhang (Discret. Appl. Math., 2013)

Transversals of Latin squares and covering radius of sets of permutations. - Ian M. Wanless; Xiande Zhang (Eur. J. Comb., 2013)

Permutation polynomials and orthomorphism polynomials of degree six. - Christopher J. Shallue; Ian M. Wanless (Finite Fields Their Appl., 2013)

Rainbow matchings and transversals. - János Barát; Ian M. Wanless (Australas. J Comb., 2014)

Switching in One-Factorisations of Complete Graphs. - Petteri Kaski; André de Souza Medeiros; Patric R. J. Östergård; Ian M. Wanless (Electron. J. Comb., 2014)

Bounds on the number of small Latin subsquares. - Joshua Browning; Peter J. Cameron; Ian M. Wanless (J. Comb. Theory A, 2014)

Growth rate of canonical and minimal group embeddings of spherical latin trades. - Tony Grubman; Ian M. Wanless (J. Comb. Theory A, 2014)

Quartic integral Cayley graphs. - Marsha Minchenko; Ian M. Wanless (Ars Math. Contemp., 2015)

Loops with exponent three in all isotopes. - Michael Kinyon; Ian M. Wanless (Int. J. Algebra Comput., 2015)

Multipartite Hypergraphs Achieving Equality in Ryser's Conjecture. - Ron Aharoni; János Barát; Ian M. Wanless (Graphs Comb., 2016)

Enumeration of MOLS of small order. - Judith Egan; Ian M. Wanless (Math. Comput., 2016)

Small partial Latin squares that cannot be embedded in a Cayley table. - Ian M. Wanless; Bridget S. Webb (Australas. J Comb., 2017)

The existence of square integer Heffter arrays. - Jeffrey H. Dinitz; Ian M. Wanless (Ars Math. Contemp., 2017)

Latin Squares with No Transversals. - Nicholas J. Cavenagh; Ian M. Wanless (Electron. J. Comb., 2017)

On Ryser's conjecture for linear intersecting multipartite hypergraphs. - Nevena Francetic; Sarada Herke; Brendan D. McKay; Ian M. Wanless (Eur. J. Comb., 2017)

Steiner Triple Systems with High Chromatic Index. - Darryn E. Bryant; Charles J. Colbourn; Daniel Horsley; Ian M. Wanless (SIAM J. Discret. Math., 2017)

Parity of sets of mutually orthogonal Latin squares. - Nevena Francetic; Sarada Herke; Ian M. Wanless (J. Comb. Theory A, 2018)

Small partial Latin squares that embed in an infinite group but not into any finite group. - Heiko Dietrich; Ian M. Wanless (J. Symb. Comput., 2018)

Covers and partial transversals of Latin squares. - Darcy Best; Trent G. Marbach; Rebecca J. Stones; Ian M. Wanless (Des. Codes Cryptogr., 2019)

Mutually Orthogonal Binary Frequency Squares. - Thomas Britz; Nicholas J. Cavenagh; Adam Mammoliti; Ian M. Wanless (Electron. J. Comb., 2020)

Zero-sum flows for Steiner systems. - Saieed Akbari; Hamid Reza Maimani; Leila Parsaei-Majd; Ian M. Wanless (Discret. Math., 2020)

Most binary matrices have no small defining set. - Carly Bodkin; Anita Liebenau; Ian M. Wanless (Discret. Math., 2020)

Covering radius in the Hamming permutation space. - Kevin Hendrey; Ian M. Wanless (Eur. J. Comb., 2020)

Full rainbow matchings in graphs and hypergraphs. - Pu Gao; Reshma Ramadurai; Ian M. Wanless; Nick Wormald (Comb. Probab. Comput., 2021)

Maximal sets of mutually orthogonal frequency squares. - Nicholas J. Cavenagh; Adam Mammoliti; Ian M. Wanless (Des. Codes Cryptogr., 2021)

Degree of orthomorphism polynomials over finite fields. - Jack Allsop; Ian M. Wanless (Finite Fields Their Appl., 2021)

Latin squares with maximal partial transversals of many lengths. - Anthony B. Evans; Adam Mammoliti; Ian M. Wanless (J. Comb. Theory A, 2021)

Induced path factors of regular graphs. - Saieed Akbari; Daniel Horsley; Ian M. Wanless (J. Graph Theory, 2021)

A General Framework for Hypergraph Coloring. - Ian M. Wanless; David R. Wood (SIAM J. Discret. Math., 2022)

Pairs of MOLS of order ten satisfying non-trivial relations. - Michael J. Gill; Ian M. Wanless (Des. Codes Cryptogr., 2023)

Tensor network decompositions for absolutely maximally entangled states. - Balázs Pozsgay; Ian M. Wanless (Quantum, 2024)

Canonical Labeling of Latin Squares in Average-Case Polynomial Time. - Michael J. Gill; Adam Mammoliti; Ian M. Wanless (Random Struct. Algorithms, 2025)

Subsquares in Random Latin Rectangles. - Jack Allsop; Ian M. Wanless (Comb., 2025)