My main research area is in design of experiments, with an emphasis on orthogonal arrays. However, I have developed an interest in graph theory and combinatorics as well. I have worked on projects concerning multipartite tournaments and permutation polynomials for Latin squares of prime or prime-power order.
Publications and work in progress:
1. Wiebke S. Diestelkamp. The decomposability of simple orthogonal arrays on 3 symbols having t+1 rows and strength t, Journal of Combinatorial Designs, Vol. 8 (2000), 442-458. pdf file
2. Wiebke S. Diestelkamp and Jay H. Beder. On the decomposition of orthogonal arrays, Utilitas Mathematica, Vol. 61 (2002), 65-86. pdf file
3. Wiebke S. Diestelkamp. Parameter inequalities for orthogonal arrays with mixed levels. Designs, Codes and Cryptography, Vol. 33 (2004), 187-197. pdf file
4. Wiebke S. Diestelkamp, Stephen G. Hartke and Rachael H. Kenney. On the degree of local permutation polynomials. Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 50 (2004), 129-140. pdf file
5. Atif Abueida, Wiebke S. Diestelkamp, Stephanie P. Edwards and Darren B. Parker. Determining properties of a multipartite tournament from its lattice of convex subsets. Australasian Journal of Combinatorics, Vol. 31 (2005), 217-230. pdf file
6. Atif Abueida, Mike Daven, Wiebke S. Diestelkamp, Stephanie P. Edwards and Darren B. Parker. Multidesigns for graph triples of order 6. Congressus Numerantium, 183 (2006), 139-160.
7. Jay H. Beder and Wiebke S. Diestelkamp. Box-Hunter
resolution in nonregular fractional factorial designs. Submitted.