| Publication | Date of Publication | Type |
|---|
| The \(q\)-analogue of zero forcing for certain families of graphs | 2024-03-27 | Paper |
| An extension of a construction of covering arrays | 2024-02-01 | Paper |
| On the structure of small strength‐2 covering arrays | 2024-01-29 | Paper |
| Linear and circular single‐change covering designs revisited | 2023-11-09 | Paper |
| Ordered covering arrays and upper bounds on covering codes | 2023-11-09 | Paper |
| On the minisymposium problem | 2023-07-20 | Paper |
| Comparing balanced sequences obtained from ElGamal function to random balanced sequences | 2023-07-03 | Paper |
| An extension of the Erdős-Ko-Rado theorem to uniform set partitions | 2023-05-31 | Paper |
| Some complementary Gray codes | 2022-10-25 | Paper |
| Sets of mutually orthogoval projective and affine planes | 2022-10-21 | Paper |
| Nonexistence Certificates for Ovals in a Projective Plane of Order Ten | 2022-10-13 | Paper |
| Difference Methods for Double Change Covering Designs | 2022-09-25 | Paper |
| Ordered Orthogonal Array Construction Using LFSR Sequences | 2022-07-30 | Paper |
| Bounds on Covering Codes in RT spaces using Ordered Covering Arrays | 2022-07-30 | Paper |
| The combinatorial game nofil played on Steiner Triple Systems | 2021-03-24 | Paper |
| A SAT-based Resolution of Lam's Problem | 2020-12-08 | Paper |
| A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes | 2020-08-26 | Paper |
| A nonexistence certificate for projective planes of order ten with weight 15 codewords | 2020-07-15 | Paper |
| Bounds on covering codes in RT spaces using ordered covering arrays | 2020-04-29 | Paper |
| Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem | 2020-01-31 | Paper |
| Non-uniform covering array with symmetric forbidden edge constraints | 2019-12-19 | Paper |
| Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma | 2019-11-13 | Paper |
| A General Construction of Ordered Orthogonal Arrays Using LFSRs | 2019-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3119334 | 2019-03-11 | Paper |
| Variable strength covering arrays | 2018-11-23 | Paper |
| Number of \(t\)-tuples in arrays from LFSRs | 2018-04-12 | Paper |
| The Lovász local lemma and variable strength covering arrays | 2018-04-12 | Paper |
| On the algorithmic complexity of decomposing graphs into regular/irregular structures | 2018-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4594195 | 2017-11-17 | Paper |
| Covering arrays from \(m\)-sequences and character sums | 2017-10-27 | Paper |
| Asymptotic Size of Covering Arrays: An Application of Entropy Compression | 2017-08-24 | Paper |
| Two New Measures for Permutations: Ambiguity and Deficiency | 2017-07-12 | Paper |
| Ordered Orthogonal Array Construction Using LFSR Sequences | 2017-06-08 | Paper |
| Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map | 2017-06-08 | Paper |
| Sudoku-like arrays, codes and orthogonality | 2017-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2953097 | 2017-01-03 | Paper |
| A note on Beckett-Gray codes and the relationship of Gray codes to data structures | 2016-08-21 | Paper |
| Cube Designs | 2016-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2808535 | 2016-05-24 | Paper |
| Locating patterns in the de Bruijn torus | 2016-01-21 | Paper |
| Constructing new covering arrays from LFSR sequences over finite fields | 2015-12-17 | Paper |
| Orthogonally Resolvable Cycle Decompositions | 2015-10-09 | Paper |
| The coolest way to generate binary strings | 2015-01-21 | Paper |
| A construction for strength-3 covering arrays from linear feedback shift register sequences | 2014-09-04 | Paper |
| A note on packing spanning trees in graphs and bases in matroids | 2014-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403011 | 2014-03-25 | Paper |
| Sequence variations of the 1-2-3 Conjecture and irregularity strength | 2014-02-14 | Paper |
| Hamilton Cycles in Restricted and Incomplete Rotator Graphs | 2012-12-07 | Paper |
| Spanning trees with specified differences in Cayley graphs | 2012-08-10 | Paper |
| Ordering block designs. Gray codes, universal cycles and configuration orderings | 2012-06-11 | Paper |
| Divisibility of polynomials over finite fields and combinatorial applications | 2012-04-04 | Paper |
| Cover starters for covering arrays of strength two | 2012-03-16 | Paper |
| Hamilton Cycles in Restricted Rotator Graphs | 2012-01-13 | Paper |
| Sets of orthogonal hypercubes of class \(r\) | 2011-12-23 | Paper |
| Uncoverings on graphs and network reliability | 2011-11-22 | Paper |
| Geometrical constructions of class-uniformly resolvable structure | 2011-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999986 | 2011-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3085966 | 2011-04-01 | Paper |
| De Bruijn Sequences for the Binary Strings with Maximum Density | 2011-02-20 | Paper |
| Digraphs are 2-weight choosable | 2011-02-17 | Paper |
| Packing spanning trees and the $k$-tree protocol | 2010-12-11 | Paper |
| Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms | 2010-12-03 | Paper |
| Octahedral designs | 2010-11-24 | Paper |
| Hamiltonian decompositions of complete \(k\)-uniform hypergraphs | 2010-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581684 | 2010-09-02 | Paper |
| The Hamilton-Waterloo problem for cycle sizes 3 and 4 | 2010-07-13 | Paper |
| Ambiguity and Deficiency in Costas Arrays and APN Permutations | 2010-04-27 | Paper |
| Universal cycles of \((n - 1)\)-partitions of an \(n\)-set | 2009-12-15 | Paper |
| Research problems on Gray codes and universal cycles | 2009-12-15 | Paper |
| Covering arrays avoiding forbidden edges | 2009-11-25 | Paper |
| A survey of known results and research areas for \(n\)-queens | 2009-01-28 | Paper |
| Covering Arrays Avoiding Forbidden Edges | 2009-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5503340 | 2009-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3514486 | 2008-07-21 | Paper |
| Algorithms to Locate Errors Using Covering Arrays | 2008-04-15 | Paper |
| Division of trinomials by pentanomials and orthogonal arrays | 2007-09-20 | Paper |
| Constructing orthogonal pandiagonal Latin squares and panmagic squares from modularn-queens solutions | 2007-06-11 | Paper |
| A Sperner-type theorem for set-partition systems | 2005-11-01 | Paper |
| Pancomponented 2-factorizations of complete graphs | 2005-10-10 | Paper |
| Covering arrays on graphs | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466058 | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461518 | 2005-07-26 | Paper |
| Group construction of covering arrays | 2005-02-23 | Paper |
| Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs | 2004-10-13 | Paper |
| Class-uniformly resolvable group divisible structures. II: Frames | 2004-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044334 | 2004-08-11 | Paper |
| Packing arrays | 2004-08-10 | Paper |
| The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs. | 2003-08-17 | Paper |
| Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\) | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529257 | 2002-10-15 | Paper |
| Packing arrays and packing designs | 2002-09-17 | Paper |
| The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order | 2002-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2713358 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2771902 | 2002-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508368 | 2001-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242741 | 1999-07-07 | Paper |
| Lower bounds for transversal covers | 1999-06-20 | Paper |
