| Publication | Date of Publication | Type |
|---|
The dimension of an orbitope based on a solution to the Legendre pair problem
Journal of Algebraic Combinatorics | 2025-01-16 | Paper |
On \(\mathrm{E}(s^2)\)-optimal and minimax-optimal supersaturated designs with 20 rows and 76 columns
Journal of Combinatorial Designs | 2024-04-30 | Paper |
Legendre pairs of lengths \(\ell \equiv 0 \pmod 5\)
Special Matrices | 2024-02-14 | Paper |
Legendre G‐array pairs and the theoretical unification of several G‐array families
Journal of Combinatorial Designs | 2024-02-01 | Paper |
| Decimation classes of nonnegative integer vectors using multisets | 2023-09-30 | Paper |
| The dimension of an orbitope based on a solution to the Legendre pair problem | 2023-01-04 | Paper |
| Classification of \(2\)-symbol orthogonal arrays of even strength \(t\) and \(t+2\) columns up to OD-equivalence | 2022-10-19 | Paper |
Finding the dimension of a non-empty orthogonal array polytope
Discrete Optimization | 2022-09-15 | Paper |
Counting the decimation classes of binary vectors with relatively prime length and density
Journal of Algebraic Combinatorics | 2022-03-15 | Paper |
A Legendre pair of length 77 using complementary binary matrices with fixed marginals
Designs, Codes and Cryptography | 2021-06-23 | Paper |
The maximum number of columns in supersaturated designs with \(s_{\max}=2\)
Journal of Combinatorial Designs | 2019-12-12 | Paper |
Finding the dimension of a non-empty orthogonal array polytope
(available as arXiv preprint) | 2019-09-04 | Paper |
Supersaturated designs with the maximum number of factors for a given resolution-rank
Journal of Statistical Theory and Practice | 2019-08-28 | Paper |
Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
Discrete Optimization | 2019-06-14 | Paper |
| Integer programming for classifying orthogonal arrays | 2018-04-10 | Paper |
Integer programming for classifying orthogonal arrays
(available as arXiv preprint) | 2018-04-10 | Paper |
The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program
LMS Journal of Computation and Mathematics | 2016-07-06 | Paper |
Algorithms for finding generalized minimum aberration designs
Journal of Complexity | 2015-06-16 | Paper |
The LP relaxation orthogonal array polytope and its permutation symmetries
(available as arXiv preprint) | 2015-01-26 | Paper |
Erratum to ``Improved WLP and GWP lower bounds based on exact integer programming
Journal of Statistical Planning and Inference | 2011-04-15 | Paper |
Improved WLP and GWP lower bounds based on exact integer programming
Journal of Statistical Planning and Inference | 2010-02-26 | Paper |
A counterexample to Beder's conjectures about Hadamard matrices
Journal of Statistical Planning and Inference | 2009-07-22 | Paper |
\(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V
Journal of Statistical Planning and Inference | 2008-11-06 | Paper |
E\((s^{2})\)-optimal supersaturated designs with good minimax properties when \(N\) is odd
Journal of Statistical Planning and Inference | 2008-03-28 | Paper |
Classification of orthogonal arrays by integer programming
Journal of Statistical Planning and Inference | 2008-03-11 | Paper |
| An algorithm for determining isomorphism using lexicographic sorting and the matrix inverse | 2008-02-20 | Paper |
\(E(s^{2})\)-optimal supersaturated designs with good minimax properties
Journal of Statistical Planning and Inference | 2007-10-26 | Paper |
Cyclicly constructed \(E(s^{2})\)-optimal supersaturated designs
Journal of Statistical Planning and Inference | 2007-10-26 | Paper |
Construction of \(E(s^2)\)-optimal supersaturated designs
The Annals of Statistics | 2004-09-15 | Paper |
Hidden projection properties of some nonregular fractional factorial designs and their applications
The Annals of Statistics | 2003-11-10 | Paper |
