| Publication | Date of Publication | Type |
|---|
On the minisymposium problem
Ars Mathematica Contemporanea | 2024-10-10 | Paper |
Sets of mutually orthogoval projective and affine planes
Combinatorial Theory | 2024-10-08 | Paper |
The combinatorial game \textsc{Nofil} played on Steiner triple systems
Journal of Combinatorial Designs | 2024-06-26 | Paper |
The \(q\)-analogue of zero forcing for certain families of graphs
Discrete Applied Mathematics | 2024-03-27 | Paper |
An extension of a construction of covering arrays
Journal of Combinatorial Designs | 2024-02-01 | Paper |
On the structure of small strength‐2 covering arrays
Journal of Combinatorial Designs | 2024-01-29 | Paper |
Linear and circular single‐change covering designs revisited
Journal of Combinatorial Designs | 2023-11-09 | Paper |
Ordered covering arrays and upper bounds on covering codes
Journal of Combinatorial Designs | 2023-11-09 | Paper |
On the minisymposium problem
| 2023-07-20 | Paper |
Comparing balanced sequences obtained from ElGamal function to random balanced sequences
Cryptography and Communications | 2023-07-03 | Paper |
An extension of the Erdős-Ko-Rado theorem to uniform set partitions
Ars Mathematica Contemporanea | 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
Lecture Notes in Computer Science | 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
Advances in Mathematics of Communications | 2020-08-26 | Paper |
A nonexistence certificate for projective planes of order ten with weight 15 codewords
Applicable Algebra in Engineering, Communication and Computing | 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
Theoretical Computer Science | 2019-11-13 | Paper |
A General Construction of Ordered Orthogonal Arrays Using LFSRs
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Some complementary Gray codes
| 2019-03-11 | Paper |
Variable strength covering arrays
Journal of Combinatorial Designs | 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 |
Bipartite edge partitions and the former Alon-Saks-Seymour conjecture
| 2017-11-17 | Paper |
Covering arrays from \(m\)-sequences and character sums
Designs, Codes and Cryptography | 2017-10-27 | Paper |
Asymptotic size of covering arrays: an application of entropy compression
Journal of Combinatorial Designs | 2017-08-24 | Paper |
Two New Measures for Permutations: Ambiguity and Deficiency
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Ordered Orthogonal Array Construction Using LFSR Sequences
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Sudoku-like arrays, codes and orthogonality
Designs, Codes and Cryptography | 2017-02-17 | Paper |
Polynomial time graph families for Arc Kayles
| 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
Journal of Combinatorial Designs | 2016-06-16 | Paper |
Edge-partitioning graphs into regular and locally irregular components
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-05-24 | Paper |
Locating patterns in the de Bruijn torus
Discrete Mathematics | 2016-01-21 | Paper |
Constructing new covering arrays from LFSR sequences over finite fields
Discrete Mathematics | 2015-12-17 | Paper |
Orthogonally resolvable cycle decompositions
Journal of Combinatorial Designs | 2015-10-09 | Paper |
The coolest way to generate binary strings
Theory of Computing Systems | 2015-01-21 | Paper |
A construction for strength-3 covering arrays from linear feedback shift register sequences
Designs, Codes and Cryptography | 2014-09-04 | Paper |
A note on packing spanning trees in graphs and bases in matroids
The Australasian Journal of Combinatorics | 2014-08-15 | Paper |
Vertex-colouring edge-weightings with two edge weights
| 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
Journal of Graph Algorithms and Applications | 2012-12-07 | Paper |
Spanning trees with specified differences in Cayley graphs
Discrete Mathematics | 2012-08-10 | Paper |
Ordering block designs. Gray codes, universal cycles and configuration orderings
CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC | 2012-06-11 | Paper |
Divisibility of polynomials over finite fields and combinatorial applications
Designs, Codes and Cryptography | 2012-04-04 | Paper |
Cover starters for covering arrays of strength two
Discrete Mathematics | 2012-03-16 | Paper |
Hamilton cycles in restricted rotator graphs
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Sets of orthogonal hypercubes of class \(r\)
Journal of Combinatorial Theory. Series A | 2011-12-23 | Paper |
Uncoverings on graphs and network reliability
| 2011-11-22 | Paper |
Geometrical constructions of class-uniformly resolvable structure
Journal of Combinatorial Designs | 2011-11-21 | Paper |
Steiner triple systems on symmetry classes of matrices
| 2011-05-18 | Paper |
Recursive construction of maximum number of non-overlapping Klein 4-groups inside an elementary Abelian 2-group.
| 2011-04-01 | Paper |
De Bruijn sequences for the binary strings with maximum density
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Digraphs are 2-weight choosable
The Electronic Journal of Combinatorics | 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
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Octahedral designs
Journal of Combinatorial Designs | 2010-11-24 | Paper |
Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
Discrete Mathematics | 2010-10-28 | Paper |
On partitions of \(\{1,\dots,2m+1,L\}\) into differences \(d,\dots,d+m\): stretched Langford sequences
| 2010-09-02 | Paper |
The Hamilton-Waterloo problem for cycle sizes 3 and 4
Journal of Combinatorial Designs | 2010-07-13 | Paper |
Ambiguity and Deficiency in Costas Arrays and APN Permutations
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
Discrete Mathematics | 2009-12-15 | Paper |
Research problems on Gray codes and universal cycles
Discrete Mathematics | 2009-12-15 | Paper |
Covering arrays avoiding forbidden edges
Theoretical Computer Science | 2009-11-25 | Paper |
A survey of known results and research areas for \(n\)-queens
Discrete Mathematics | 2009-01-28 | Paper |
Covering Arrays Avoiding Forbidden Edges
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Results for the \(n\)-queens problem on the Möbius board
| 2009-01-15 | Paper |
Maximally pair separated round robin tournaments: ordering the blocks of a design
| 2008-07-21 | Paper |
Algorithms to Locate Errors Using Covering Arrays
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Division of trinomials by pentanomials and orthogonal arrays
Designs, Codes and Cryptography | 2007-09-20 | Paper |
Constructing orthogonal pandiagonal Latin squares and panmagic squares from modularn-queens solutions
Journal of Combinatorial Designs | 2007-06-11 | Paper |
A Sperner-type theorem for set-partition systems
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
Pancomponented 2-factorizations of complete graphs
Discrete Mathematics | 2005-10-10 | Paper |
Covering arrays on graphs
Journal of Combinatorial Theory. Series B | 2005-09-28 | Paper |
scientific article; zbMATH DE number 2197915 (Why is no real title available?)
| 2005-08-23 | Paper |
scientific article; zbMATH DE number 2188416 (Why is no real title available?)
| 2005-07-26 | Paper |
Group construction of covering arrays
Journal of Combinatorial Designs | 2005-02-23 | Paper |
Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
Class-uniformly resolvable group divisible structures. II: Frames
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
scientific article; zbMATH DE number 2086236 (Why is no real title available?)
| 2004-08-11 | Paper |
Packing arrays
Theoretical Computer Science | 2004-08-10 | Paper |
The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
Theoretical Computer Science | 2003-08-17 | Paper |
Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
Discrete Mathematics | 2002-12-02 | Paper |
scientific article; zbMATH DE number 1743764 (Why is no real title available?)
| 2002-10-15 | Paper |
Packing arrays and packing designs
Designs, Codes and Cryptography | 2002-09-17 | Paper |
The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order
The Electronic Journal of Combinatorics | 2002-04-25 | Paper |
Class-uniformly resolvable designs
Journal of Combinatorial Designs | 2002-03-21 | Paper |
scientific article; zbMATH DE number 1706410 (Why is no real title available?)
| 2002-02-18 | Paper |
scientific article; zbMATH DE number 1512681 (Why is no real title available?)
| 2001-02-05 | Paper |
scientific article; zbMATH DE number 1286223 (Why is no real title available?)
| 1999-07-07 | Paper |
Lower bounds for transversal covers
Designs, Codes and Cryptography | 1999-06-20 | Paper |
