| Maximal Sets Of Mutually Orthogonal Frequency Squares | 0 | 0.34 | 2021 |
| Globally simple Heffter arrays H(n;k) when k≡0, 3(mod4). | 0 | 0.34 | 2020 |
| The existence of square non-integer Heffter arrays. | 0 | 0.34 | 2019 |
| Lower Bounds on the Sizes of Defining Sets in Full n-Latin Squares and Full Designs | 0 | 0.34 | 2018 |
| Balanced diagonals in frequency squares. | 0 | 0.34 | 2018 |
| Latin Squares with No Transversals. | 0 | 0.34 | 2017 |
| Subcubic trades in Steiner triple systems. | 0 | 0.34 | 2017 |
| Orthogonal Trades in Complete Sets of MOLS. | 0 | 0.34 | 2017 |
| On the distances between Latin squares and the smallest defining set size. | 0 | 0.34 | 2016 |
| Critical Sets of Full n-Latin Squares | 0 | 0.34 | 2016 |
| On the chromatic index of Latin squares. | 1 | 0.37 | 2015 |
| Induced Subarrays of Latin Squares Without Repeated Symbols. | 0 | 0.34 | 2013 |
| Identifying Flaws In The Security Of Critical Sets In Latin Squares Via Triangulations | 1 | 0.37 | 2012 |
| Nonextendible Latin Cuboids | 3 | 0.48 | 2012 |
| Decomposing complete equipartite graphs into odd square-length cycles: Number of parts even | 0 | 0.34 | 2012 |
| Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems. | 0 | 0.34 | 2012 |
| Avoidable Partial Latin Squares Of Order 4m+1. | 7 | 0.80 | 2010 |
| Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts | 5 | 0.73 | 2010 |
| On the number of transversals in Cayley tables of cyclic groups | 7 | 0.89 | 2010 |
| Decomposing Complete Equipartite Graphs into Short Odd Cycles. | 2 | 0.60 | 2010 |
| On completing three cyclically generated transversals to a latin square | 6 | 0.73 | 2009 |
| Path and cycle decompositions of complete equipartite graphs: Four parts | 1 | 0.39 | 2009 |
| Minimal homogeneous Steiner 2-(v,3) trades | 2 | 0.58 | 2008 |
| When is a partial Latin square uniquely completable, but not its completable product? | 0 | 0.34 | 2008 |
| The cycle structure of two rows in a random Latin square | 10 | 0.84 | 2008 |
| Planar Eulerian triangulations are equivalent to spherical Latin bitrades | 7 | 0.84 | 2008 |
| Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths | 1 | 0.45 | 2008 |
| Latin bitrades derived from groups | 1 | 0.40 | 2008 |
| On The Spectrum Of Critical Sets In Back Circulant Latin Squares | 1 | 0.42 | 2007 |
| Edge-Magic Group Labellings of Countable Graphs | 3 | 0.57 | 2006 |
| A lower bound for the size of a critical set in the back circulant latin square. | 0 | 0.34 | 2006 |
| Minimal homogeneous latin trades | 2 | 0.58 | 2006 |
| 3-Homogeneous latin trades | 5 | 0.68 | 2005 |
| 4-Homogeneous Latin Trades | 5 | 0.77 | 2005 |
| Constructing and deconstructing latin trades | 1 | 0.41 | 2004 |
| Latin trade algorithms and the smallest critical set in a latin square | 2 | 0.48 | 2003 |
| A new bound on the size of the largest 2-critical set in a latin square | 0 | 0.34 | 2002 |
| Decompositions of Complete Multipartite Graphs into Cycles of Even Length | 19 | 2.76 | 2000 |
| Decompositions of complete tripartite graphs into k-cycles. | 0 | 0.34 | 1998 |
