The following pages link to Alan C. H. Ling (Q189441):
Displaying 50 items.
- Quorums from difference covers (Q294779) (← links)
- Optical grooming with grooming ratio nine (Q616353) (← links)
- Grooming traffic to minimize load (Q658091) (← links)
- Pairwise balanced designs with consecutive block sizes (Q676713) (← links)
- Frames with block size four and index three (Q697996) (← links)
- Resolvable group divisible designs with large groups (Q727201) (← links)
- Existence of balanced sampling plans avoiding cyclic distances (Q745463) (← links)
- Scheduling CCRR tournaments (Q817605) (← links)
- Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses (Q887428) (← links)
- Graph divisible designs and packing constructions (Q897275) (← links)
- Matching divisible designs with block size four (Q898140) (← links)
- Resolvable balanced incomplete block designs with subdesigns of block size 4 (Q924949) (← links)
- Constructing strength three covering arrays with augmented annealing (Q924952) (← links)
- Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles (Q949803) (← links)
- Optical grooming with grooming ratio eight (Q967318) (← links)
- Minimum embedding of Steiner triple systems into \((K_4 - e)\)-designs. II (Q998536) (← links)
- Linear spaces with small generated subspaces (Q1003656) (← links)
- Linear hash families and forbidden configurations (Q1009168) (← links)
- The fine intersection problem for Steiner triple systems (Q1015421) (← links)
- Further results on \((v,\{5,w^*\},1)\)-PBDs (Q1025489) (← links)
- Maximum uniformly resolvable designs with block sizes 2 and 4 (Q1044939) (← links)
- Graph designs for the eight-edge five-vertex graphs (Q1045180) (← links)
- Kirkman school project designs (Q1301652) (← links)
- Pairwise balanced designs with block sizes 8, 9, and 10 (Q1352866) (← links)
- Weakly union-free twofold triple systems (Q1387611) (← links)
- Point code minimum Steiner triple systems (Q1389150) (← links)
- Hyperovals in Steiner systems (Q1407631) (← links)
- A new construction for \(Z\)-cyclic whist tournaments (Q1414241) (← links)
- Skolem-type difference sets for cycle systems (Q1422122) (← links)
- A survey on resolvable group divisible designs with block size four. (Q1428526) (← links)
- Splitting systems and separating systems. (Q1428538) (← links)
- Super-simple (\(v\),\,5,\,2)-designs. (Q1428553) (← links)
- Modified group divisible designs with block size four (Q1567674) (← links)
- Totally magic graphs (Q1613532) (← links)
- Group divisible designs with block size four and group type \(g^u m^1\) with minimum \(m\) (Q1766101) (← links)
- On 2-chromatic \((v,5,1)\)-designs (Q1818906) (← links)
- Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs (Q1861286) (← links)
- Complementary partial resolution squares for Steiner triple systems (Q1861292) (← links)
- A note on \(\{4\}\)-GDDs of type 2\(^{10}\) (Q1861304) (← links)
- An application of splittable 4-frames to coloring of \(K_{n,n}\) (Q1861305) (← links)
- Uniform group divisible designs with block sizes three and \(n\) (Q1865131) (← links)
- Sets of three pairwise orthogonal Steiner triple systems (Q1865412) (← links)
- On PBIBD designs based on triangular schemes (Q1865670) (← links)
- Grooming in unidirectional rings: \(K_{4}-e\) designs (Q1876673) (← links)
- Cover-free families and topology-transparent scheduling for MANETs (Q1877340) (← links)
- Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\) (Q1877653) (← links)
- A systematic approach to some block design constructions (Q1881684) (← links)
- A combinatorial error bound for \(t\)-point-based sampling (Q1884988) (← links)
- Asymptotically optimal erasure-resilient codes for large disk arrays. (Q1972905) (← links)
- A finite embedding theorem for partial Steiner 3-designs (Q2011479) (← links)
