Journal of Combinatorial Designs

Papers
(The TQCC of Journal of Combinatorial Designs is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-03-01 to 2024-03-01.)
ArticleCitations
Biembeddings of cycle systems using integer Heffter arrays7
The localization number of designs6
Constructions of pairs of orthogonal latin cubes6
Evasive subspaces6
Perfect 2‐colorings of Hamming graphs5
Graph decompositions in projective geometries5
The extended binary quadratic residue code of length 42 holds a 3‐design5
On flag‐transitive imprimitive 2‐designs5
Some new group divisible designs with block size 4 and two or three group sizes5
Partitionable sets, almost partitionable sets, and their applications4
Plateaued functions on finite abelian groups and partial geometric difference sets4
On an Assmus–Mattson type theorem for type I and even formally self‐dual codes4
A note on tight projective 2‐designs3
Decomposable super‐simple BIBDs with block size 4 and index 4, 63
Further results on large sets of partitioned incomplete Latin squares3
Symmetric designs and projective special linear groups of dimension at most four3
Quasigroups constructed from perfect Mendelsohn designs with block size 43
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions3
An improved recursive construction for disjoint Steiner quadruple systems3
On split graphs with three or four distinct (normalized) Laplacian eigenvalues3
Reconfiguration of subspace partitions2
Sparse Steiner triple systems of order 212
Group divisible designs with block size 4 and group sizes 2 and 52
Row‐column factorial designs with multiple levels2
Moufang sets generated by translations in unitals2
Colourings of star systems2
Deza graphs with parameters (v,k,k−2,a)2
Reduction for flag‐transitive 2‐(v,k,λ) designs with (r,λ)=22
Legendre pairs of lengths ℓ≡0(mod3)2
Exceptions and characterization results for type‐1 λ‐designs2
On flag‐transitive 2‐(k2,k,λ) $({k}^{2},k,\lambda )$ designs with λ∣k $\lambda | k$2
Combinatorial designs for deep learning2
Enumeration of Latin squares with conjugate symmetry2
Quasimagic rectangles2
Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length2
Difference matrices with four rows over generalized dihedral groups2
Classification of minimal blocking sets in small Desarguesian projective planes2
Extended near Skolem sequences Part II2
Extended near Skolem sequences Part I2
Legendre G‐array pairs and the theoretical unification of several G‐array families2
Block‐avoiding point sequencings2
Existence of strong difference families and constructions for eight new 2‐designs2
Partial geometric designs with block sizes three and four1
Weak sequenceability in cyclic groups1
A note on magic rectangle set MRSΓ(2k+1,4;4l+2)1
On a relation between bipartite biregular cages, block designs and generalized polygons1
Infinite families of 2‐designs derived from affine‐invariant codes1
Extended near Skolem sequences, Part III1
Algorithms and complexity for counting configurations in Steiner triple systems1
Tight globally simple nonzero sum Heffter arrays and biembeddings1
The existence of irrational most perfect magic squares1
Classification of divisible design graphs with at most 39 vertices1
Self‐dual association schemes, fusions of Hamming schemes, and partial geometric designs1
An extension of a construction of covering arrays1
Quaternary complex Hadamard matrices of order 181
On the maximum double independence number of Steiner triple systems1
Maximum w‐cyclic holey group divisible packings with block size three and applications to optical orthogonal codes1
Corrigendum: Super‐simple resolvable balanced incomplete block designs with block size 4 and index 21
A reduction of the spectrum problem for odd sun systems and the prime case1
Pentagonal geometries with block sizes 3, 4, and 51
A generalization of group divisible t $t$‐designs1
Partial geometric designs having circulant concurrence matrices1
On a pair of orthogonal large sets of partitioned incomplete Latin squares1
Affine Mendelsohn triple systems and the Eisenstein integers1
P℘N functions, complete mappings and quasigroup difference sets1
A note on λ‐designs1
The spectrum for large sets of resolvable idempotent Latin squares1
Completing the spectrum of semiframes with block size three1
Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum1
Edge balanced star‐hypergraph designs and vertex colorings of path designs1
The existence of r‐golf designs1
Exceptional designs in some extended quadratic residue codes1
On symmetric designs with flag‐transitive and point‐quasiprimitive automorphism groups1
Primitive cycle decompositions of Kn and Kn−I1
Universal p‐ary designs1
The existence of disjoint (hooked) near‐Rosa sequences and applications1
0.061562061309814