Diane M. Donovan

Orcid: 0000-0002-1329-3514

Affiliations:
  • University of Queensland, Department of Mathematics, Australia


According to our database1, Diane M. Donovan authored at least 55 papers between 1990 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On maximal partial Latin hypercubes.
Des. Codes Cryptogr., February, 2024

2023
QC-LDPC Codes From Difference Matrices and Difference Covering Arrays.
IEEE Access, 2023

2020
Embedding partial Latin squares in Latin squares with many mutually orthogonal mates.
Discret. Math., 2020

Globally simple Heffter arrays H(n;k) when k≡0, 3(mod4).
Discret. Math., 2020

2019
The existence of square non-integer Heffter arrays.
Ars Math. Contemp., 2019

2018
On the number of transversals in a class of Latin squares.
Discret. Appl. Math., 2018

On the number of additive permutations and Skolem-type sequences.
Ars Math. Contemp., 2018

2017
High Rate LDPC Codes from Difference Covering Arrays.
CoRR, 2017

Orthogonal Trades in Complete Sets of MOLS.
Electron. J. Comb., 2017

Combinatorial Questions: How Can Graph Labelling Help?
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
Orthogonal Trades and the Intersection Problem for Orthogonal Arrays.
Graphs Comb., 2016

Difference Covering Arrays and Pseudo-Orthogonal Latin Squares.
Graphs Comb., 2016

2015
Intersection Problem for Simple 2-fold (3n, n, 3) Group Divisible Designs.
Graphs Comb., 2015

Square integer Heffter arrays with empty cells.
Des. Codes Cryptogr., 2015

Further biembeddings of twofold triple systems.
Ars Math. Contemp., 2015

Populations of Models, Experimental Designs and Coverage of Parameter Space by Latin Hypercube and Orthogonal Sampling.
Proceedings of the International Conference on Computational Science, 2015

2014
A polynomial embedding of pairs of orthogonal partial Latin squares.
J. Comb. Theory, Ser. A, 2014

2013
On the number of transversal designs.
J. Comb. Theory, Ser. A, 2013

Simple 2-fold (3<i>n</i>, <i>n</i>, 3)(3n, n, 3) group divisible designs having a prescribed number of triples in common.
Electron. Notes Discret. Math., 2013

2012
On the existence of 3-way k-homogeneous Latin trades.
Discret. Math., 2012

On the number of designs with affine parameters.
Des. Codes Cryptogr., 2012

Identifying flaws in the security of critical sets in latin squares via triangulations.
Australas. J Comb., 2012

Planar difference functions.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Designs having the parameters of projective and affine spaces.
Des. Codes Cryptogr., 2011

The triangle intersection problem for nested Steiner triple systems.
Australas. J Comb., 2011

2010
On Parity Vectors of Latin Squares.
Graphs Comb., 2010

Quarter-regular biembeddings of Latin squares.
Discret. Math., 2010

Mutually orthogonal Latin squares and mutually unbiased bases in dimensions of odd prime power - MOLS and MUBs in odd prime power dimensions.
Cryptogr. Commun., 2010

2009
On Defining Sets of Full Designs with Block Size Three.
Graphs Comb., 2009

A constraint on the biembedding of Latin squares.
Eur. J. Comb., 2009

2008
Permutation Representation of 3 and 4-Homogenous Latin Bitrades.
Fundam. Informaticae, 2008

Minimal homogeneous Steiner 2-(v, 3) trades.
Discret. Math., 2008

When is a partial Latin square uniquely completable, but not its completable product?
Discret. Math., 2008

2007
On The Spectrum Of Critical Sets In Back Circulant Latin Squares.
Ars Comb., 2007

2006
Minimal homogeneous latin trades.
Discret. Math., 2006

2005
3-Homogeneous latin trades.
Discret. Math., 2005

4-homogeneous latin trades.
Australas. J Comb., 2005

2004
Constructing and deconstructing latin trades.
Discret. Math., 2004

An investigation of 2-critical sets in latin squares.
Ars Comb., 2004

Labelings of unions of up to four uniform cycles.
Australas. J Comb., 2004

2003
Editorial.
J. Autom. Lang. Comb., 2003

Doubling and Tripling Constructions for Defining Sets in Steiner Triple Systems.
Graphs Comb., 2003

2002
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges.
Int. J. Comput. Math., 2002

Latin Interchanges and Direct Products.
Ars Comb., 2002

2000
Towards the spectrum of critical sets.
Australas. J Comb., 2000

The completion of partial Latin squares.
Australas. J Comb., 2000

Closing a gap in the spectrum of critical sets.
Australas. J Comb., 2000

1997
Critical sets in a family of groups.
Australas. J Comb., 1997

1996
Quasigroups, isotopisms and authentication schemes.
Australas. J Comb., 1996

1994
The breadth of Shamir's secret-sharing scheme.
Comput. Secur., 1994

Some interesting constructions for secret sharing schemes.
Australas. J Comb., 1994

1993
Shamir's Scheme Says It all.
Proceedings of the Computer Security, 1993

1991
Single laws for sloops and squags.
Discret. Math., 1991

Latin squares and critical sets of minimal size.
Australas. J Comb., 1991

1990
The centre of a sloop.
Australas. J Comb., 1990


  Loading...