| Publication | Date of Publication | Type |
|---|
Row‐column factorial designs with multiple levels
Journal of Combinatorial Designs | 2024-02-05 | Paper |
Mutually orthogonal frequency rectangles
Discrete Mathematics | 2023-10-04 | Paper |
| Latin bitrades derived from quasigroup autoparatopisms | 2023-08-28 | Paper |
Row-column factorial designs with strength at least 2
Linear Algebra and its Applications | 2023-04-27 | Paper |
Mutually orthogonal cycle systems
Ars Mathematica Contemporanea | 2023-01-23 | Paper |
Row-column factorial designs with strength at least $2$
(available as arXiv preprint) | 2022-07-05 | Paper |
Maximal sets of mutually orthogonal frequency squares
Designs, Codes and Cryptography | 2021-03-17 | Paper |
Mutually orthogonal binary frequency squares
The Electronic Journal of Combinatorics | 2020-07-29 | Paper |
Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
Discrete Mathematics | 2020-03-20 | Paper |
The existence of square non-integer Heffter arrays
Ars Mathematica Contemporanea | 2020-02-21 | Paper |
The maximum, supremum, and spectrum for critical set sizes in \((0,1)\)-matrices
Journal of Combinatorial Designs | 2019-12-12 | Paper |
| Biembeddings of cycle systems using integer Heffter arrays | 2019-06-23 | Paper |
Lower bounds on the sizes of defining sets in full \(n\)-Latin squares and full designs
Graphs and Combinatorics | 2018-09-14 | Paper |
Balanced diagonals in frequency squares
Discrete Mathematics | 2018-06-07 | Paper |
Balanced diagonals in frequency squares
Discrete Mathematics | 2018-06-07 | Paper |
Constructing (0,1)-matrices with large minimal defining sets
Linear Algebra and its Applications | 2017-11-02 | Paper |
Orthogonal trades in complete sets of MOLS
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Orthogonal trades in complete sets of MOLS
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Subcubic trades in Steiner triple systems
Discrete Mathematics | 2017-08-29 | Paper |
Latin squares with no transversals
The Electronic Journal of Combinatorics | 2017-07-13 | Paper |
Latin squares with no transversals
The Electronic Journal of Combinatorics | 2017-07-13 | Paper |
On the distances between Latin squares and the smallest defining set size
Journal of Combinatorial Designs | 2017-05-26 | Paper |
There are asymptotically the same number of Latin squares of each parity
Bulletin of the Australian Mathematical Society | 2017-05-16 | Paper |
On the distances between Latin squares and the smallest defining set size
(available as arXiv preprint) | 2017-02-13 | Paper |
| On the distances between Latin squares and the smallest defining set size | 2017-02-13 | Paper |
Critical sets of 2-balanced Latin rectangles
Annals of Combinatorics | 2016-10-27 | Paper |
| On the chromatic index of Latin squares | 2016-07-26 | Paper |
Critical sets of full \(n\)-Latin squares
Graphs and Combinatorics | 2016-06-13 | Paper |
Decomposing graphs of high minimum degree into 4-cycles
Journal of Graph Theory | 2015-07-23 | Paper |
Maximal partial Latin cubes
The Electronic Journal of Combinatorics | 2015-04-22 | Paper |
Decomposing dense bipartite graphs into 4-cycles
The Electronic Journal of Combinatorics | 2015-03-11 | Paper |
Longest partial transversals in plexes
Annals of Combinatorics | 2014-09-04 | Paper |
| Near-homogeneous spherical Latin bitrades | 2014-02-19 | Paper |
Defining sets and critical sets in \((0,1)\)-matrices
Journal of Combinatorial Designs | 2013-06-13 | Paper |
Induced subarrays of Latin squares without repeated symbols
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
| Distinct equilateral triangle dissections of convex regions. | 2012-11-15 | Paper |
| Identifying flaws in the security of critical sets in Latin squares via triangulations | 2012-10-21 | Paper |
Super-simple twofold 4-cycle systems
Bulletin of the Institute of Combinatorics and its Applications | 2012-10-06 | Paper |
Nonextendible Latin cuboids
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems
Discrete Mathematics | 2012-08-10 | Paper |
Decomposing complete equipartite graphs into odd square-length cycles: number of parts even
Discrete Mathematics | 2012-05-30 | Paper |
| Avoidable partial Latin squares of order \(4m+1\). | 2012-02-20 | Paper |
Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
Aequationes Mathematicae | 2012-01-10 | Paper |
Near-automorphisms of Latin squares
Journal of Combinatorial Designs | 2011-11-21 | Paper |
Multi-Latin squares
Discrete Mathematics | 2011-05-31 | Paper |
Decomposing complete equipartite graphs into short even cycles
Journal of Combinatorial Designs | 2011-03-25 | Paper |
Decomposing complete equipartite graphs into short odd cycles
The Electronic Journal of Combinatorics | 2010-10-13 | Paper |
Decomposing complete equipartite graphs into short odd cycles
The Electronic Journal of Combinatorics | 2010-10-13 | Paper |
On the number of transversals in Cayley tables of cyclic groups
Discrete Applied Mathematics | 2010-05-05 | Paper |
Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
Discrete Mathematics | 2010-03-29 | Paper |
Latin trades in groups defined on planar triangulations
Journal of Algebraic Combinatorics | 2009-12-09 | Paper |
| Minimal and minimum size latin bitrades of each genus. | 2009-08-17 | Paper |
| Minimal and minimum size latin bitrades of each genus. | 2009-08-17 | Paper |
Path and cycle decompositions of complete equipartite graphs: Four parts
Discrete Mathematics | 2009-06-23 | Paper |
On completing three cyclically generated transversals to a Latin square
Finite Fields and their Applications | 2009-05-19 | Paper |
Sparse graphs which decompose into closed trails of arbitrary lengths
Graphs and Combinatorics | 2009-05-08 | Paper |
Decomposing complete tripartite graphs into closed trails of arbitrary lengths
Czechoslovak Mathematical Journal | 2009-03-31 | Paper |
Decomposing complete tripartite graphs into closed trails of arbitrary lengths
Czechoslovak Mathematical Journal | 2009-03-31 | Paper |
The cycle structure of two rows in a random Latin square
Random Structures & Algorithms | 2009-03-04 | Paper |
Latin bitrades derived from groups
Discrete Mathematics | 2009-01-28 | Paper |
The theory and application of latin bitrades: A survey
Mathematica Slovaca | 2008-12-16 | Paper |
| Minimal defining sets of 1-factorizations of complete graphs | 2008-11-03 | Paper |
When is a partial Latin square uniquely completable, but not its completable product?
Discrete Mathematics | 2008-05-29 | Paper |
| Transitive latin bitrades | 2008-04-29 | Paper |
Minimal homogeneous Steiner 2-\((v,3)\) trades
Discrete Mathematics | 2008-02-14 | Paper |
Planar Eulerian triangulations are equivalent to spherical Latin bitrades
Journal of Combinatorial Theory. Series A | 2008-02-04 | Paper |
| scientific article; zbMATH DE number 5194488 (Why is no real title available?) | 2007-09-21 | Paper |
A superlinear lower bound for the size of a critical set in a latin square
Journal of Combinatorial Designs | 2007-07-30 | Paper |
Concerning eight mutually orthogonal latin squares
Journal of Combinatorial Designs | 2007-06-11 | Paper |
Edge-magic group labellings of countable graphs
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Edge-magic group labellings of countable graphs
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
| A uniqueness result for \(3\)-homogeneous Latin trades. | 2007-01-30 | Paper |
| A uniqueness result for \(3\)-homogeneous Latin trades. | 2007-01-30 | Paper |
| scientific article; zbMATH DE number 5077167 (Why is no real title available?) | 2006-12-05 | Paper |
Minimal homogeneous Latin trades
Discrete Mathematics | 2006-09-14 | Paper |
| Embedding \(3\)-homogeneous Latin trades into abelian \(2\)-groups. | 2006-09-13 | Paper |
| Embedding \(3\)-homogeneous Latin trades into abelian \(2\)-groups. | 2006-09-13 | Paper |
3-homogeneous Latin trades
Discrete Mathematics | 2005-10-26 | Paper |
| scientific article; zbMATH DE number 2188625 (Why is no real title available?) | 2005-07-26 | Paper |
| scientific article; zbMATH DE number 2186994 (Why is no real title available?) | 2005-07-13 | Paper |
| scientific article; zbMATH DE number 2170410 (Why is no real title available?) | 2005-05-23 | Paper |
| scientific article; zbMATH DE number 2105036 (Why is no real title available?) | 2004-10-01 | Paper |
Constructing and deconstructing Latin trades
Discrete Mathematics | 2004-08-20 | Paper |
On a generalization of the Oberwolfach problem
Journal of Combinatorial Theory. Series A | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2076803 (Why is no real title available?) | 2004-06-22 | Paper |
| scientific article; zbMATH DE number 1833094 (Why is no real title available?) | 2003-06-26 | Paper |
| scientific article; zbMATH DE number 2028653 (Why is no real title available?) | 2003-01-01 | Paper |
| scientific article; zbMATH DE number 2024685 (Why is no real title available?) | 2003-01-01 | Paper |
Further decompositions of complete tripartite graphs into 5-cycles
Discrete Mathematics | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1556758 (Why is no real title available?) | 2001-08-02 | Paper |
Decompositions of complete multipartite graphs into cycles of even length
Graphs and Combinatorics | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1229616 (Why is no real title available?) | 1999-03-07 | Paper |
Weak colourings of Kirkman triple systems
(available as arXiv preprint) | N/A | Paper |
