On the Closure of Subsets of {4, 5, ..., 9} which contain {4}. - Ronald C. Mullin; Alan C. H. Ling; R. Julian R. Abel; Frank E. Bennett (Ars Comb., 1997)

Pairwise Balanced Designs with Consecutive Block Sizes. - Alan C. H. Ling; Xiaojun Zhu 002; Charles J. Colbourn; Ronald C. Mullin (Des. Codes Cryptogr., 1997)

Pairwise Balanced Designs with Block Sizes 8, 9, and 10. - Charles J. Colbourn; Alan C. H. Ling (J. Comb. Theory A, 1997)

Deleting Lines in Projective Planes. - Alan C. H. Ling; Charles J. Colbourn (Ars Comb., 1998)

Point Code Minimum Steiner Triple Systems. - Charles J. Colbourn; Alan C. H. Ling (Des. Codes Cryptogr., 1998)

Balanced sampling plans with block size four excluding contiguous units. - Charles J. Colbourn; Alan C. H. Ling (Australas. J Comb., 1999)

Kirkman school project designs. - Charles J. Colbourn; Alan C. H. Ling (Discret. Math., 1999)

Asymptotically optimal erasure-resilient codes for large disk arrays. - Yeow Meng Chee; Charles J. Colbourn; Alan C. H. Ling (Discret. Appl. Math., 2000)

Modified group divisible designs with block size four. - Alan C. H. Ling; Charles J. Colbourn (Discret. Math., 2000)

Quorums from difference covers. - Charles J. Colbourn; Alan C. H. Ling (Inf. Process. Lett., 2000)

(M, S)-optimal designs with block size three. - Charles J. Colbourn; Alan C. H. Ling (Australas. J Comb., 2001)

The existence of referee squares. - Jeffrey H. Dinitz; Alan C. H. Ling (Discret. Math., 2001)

Slope packings and coverings, and generic algorithms for the discrete logarithm problem. - M. A. Chateauneuf; Alan C. H. Ling; Douglas R. Stinson (IACR Cryptol. ePrint Arch., 2001)

Equireplicate Balanced Binary Codes for Oligo Arrays. - Noga Alon; Charles J. Colbourn; Alan C. H. Ling; Martin Tompa (SIAM J. Discret. Math., 2001)

Packings with block size five and index one: v equiv 2 (mod 4). - Alan C. H. Ling (Ars Comb., 2002)

A direct construction of transversal covers using group divisible designs. - Brett Stevens; Alan C. H. Ling; Eric Mendelsohn (Ars Comb., 2002)

Construction of optimal quality control for oligo arrays. - Charles J. Colbourn; Alan C. H. Ling; Martin Tompa (Bioinform., 2002)

The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs. - Charles J. Colbourn; Esther R. Lamken; Alan C. H. Ling; W. H. Mills (Des. Codes Cryptogr., 2002)

Totally magic graphs. - Geoffrey Exoo; Alan C. H. Ling; John P. McSorley; Nicholas C. K. Phillips; Walter D. Wallis (Discret. Math., 2002)

Uniform Group Divisible Designs with Block Sizes Three and n. - Yeow Meng Chee; Alan C. H. Ling (Graphs Comb., 2002)

Kirkman triple systems of order 21 with nontrivial automorphism group. - Myra B. Cohen; Charles J. Colbourn; Lee A. Ives; Alan C. H. Ling (Math. Comput., 2002)

Difference triangle sets from affine planes. - Alan C. H. Ling (IEEE Trans. Inf. Theory, 2002)

Steiner Systems for Topology-Transparent Access Control in MANETs. - Charles J. Colbourn; Violet R. Syrotiuk; Alan C. H. Ling (ADHOC-NOW, 2003)

Topology-transparent scheduling for MANETs using orthogonal arrays. - Violet R. Syrotiuk; Charles J. Colbourn; Alan C. H. Ling (DIALM-POMC, 2003)

Augmenting Simulated Annealing to Build Interaction Test Suites. - Myra B. Cohen; Charles J. Colbourn; Alan C. H. Ling (ISSRE, 2003)

Six New Constant Weight Binary Codes. - Hui Kheng Aw; Yeow Meng Chee; Alan C. H. Ling (Ars Comb., 2003)

Some applications of combinatorial designs to extremal graph theory. - Alan C. H. Ling (Ars Comb., 2003)

Skolem-type Difference Sets for Cycle Systems. - Darryn E. Bryant; Heather Gavlas; Alan C. H. Ling (Electron. J. Comb., 2003)

A new construction for Z-cyclic whist tournaments. - Gennian Ge; Alan C. H. Ling (Discret. Appl. Math., 2003)

Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs. - Charles J. Colbourn; Alan C. H. Ling (Discret. Math., 2003)

Complementary partial resolution squares for Steiner triple systems. - Jeffrey H. Dinitz; Esther R. Lamken; Alan C. H. Ling (Discret. Math., 2003)

A note on {4}-GDDs of type 210. - Donald L. Kreher; Alan C. H. Ling; Rolf S. Rees; Clement W. H. Lam (Discret. Math., 2003)

An application of splittable 4-frames to coloring of Kn, n. - Alan C. H. Ling (Discret. Math., 2003)

Sets of three pairwise orthogonal Steiner triple systems. - Jeffrey H. Dinitz; Peter Dukes; Alan C. H. Ling (J. Comb. Theory A, 2003)

Constrained Ramsey numbers of graphs. - Robert E. Jamison; Tao Jiang 003; Alan C. H. Ling (J. Graph Theory, 2003)

Super-simple (v, 5, 2)-designs. - Hans-Dietrich O. F. Gronau; Donald L. Kreher; Alan C. H. Ling (Discret. Appl. Math., 2004)

Cover-Free Families and Topology-Transparent Scheduling for MANETs. - Charles J. Colbourn; Alan C. H. Ling; Violet R. Syrotiuk (Des. Codes Cryptogr., 2004)

Grooming in unidirectional rings: K4-e designs. - Jean-Claude Bermond; Charles J. Colbourn; Alan C. H. Ling; Min-Li Yu (Discret. Math., 2004)

Group divisible designs with block size four and group type gum1 for small g. - Gennian Ge; Alan C. H. Ling (Discret. Math., 2004)

A survey on resolvable group divisible designs with block size four. - Gennian Ge; Alan C. H. Ling (Discret. Math., 2004)

Splitting systems and separating systems. - Alan C. H. Ling; Pak Ching Li; G. H. John van Rees (Discret. Math., 2004)

A systematic approach to some block design constructions. - Gennian Ge; Alan C. H. Ling (J. Comb. Theory A, 2004)

A combinatorial error bound for t-point-based sampling. - Peter Dukes; Alan C. H. Ling (Theor. Comput. Sci., 2004)

Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares. - Charles J. Colbourn; Torleiv Kløve; Alan C. H. Ling (IEEE Trans. Inf. Theory, 2004)

Group Divisible Designs with Block Size Four and Group Type gum1 with Minimum m. - Gennian Ge; Alan C. H. Ling (Des. Codes Cryptogr., 2005)

Resolvable Maximum Packings with Quadruples. - Gennian Ge; Clement W. H. Lam; Alan C. H. Ling; Hao Shen (Des. Codes Cryptogr., 2005)

Embedding path designs into kite systems. - Charles J. Colbourn; Alan C. H. Ling; Gaetano Quattrocchi (Discret. Math., 2005)

Constructions of Quad-Rooted Double Covers. - Gennian Ge; Alan C. H. Ling (Graphs Comb., 2005)

Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. - Jean-Claude Bermond; Charles J. Colbourn; David Coudert; Gennian Ge; Alan C. H. Ling; Xavier Muñoz (SIAM J. Discret. Math., 2005)

Optimal memoryless encoding for low power off-chip data buses. - Yeow Meng Chee; Charles J. Colbourn; Alan C. H. Ling (ICCAD, 2006)

Location-aware key predistribution scheme for wide area wireless sensor networks. - Katerina Simonova; Alan C. H. Ling; Xiaoyang Sean Wang (SASN, 2006)

A Fast Algorithm for the Constrained Multiple Sequence Alignment Problem. - Dan He; Abdullah N. Arslan; Alan C. H. Ling (Acta Cybern., 2006)

Scheduling CCRR tournaments. - Gennian Ge; Esther R. Lamken; Alan C. H. Ling (J. Comb. Theory A, 2006)

Fault-tolerant routings with minimum optical index. - Jeffrey H. Dinitz; Alan C. H. Ling; Douglas R. Stinson (Networks, 2006)

Perfect hash families from transversal designs. - Jeffrey H. Dinitz; Alan C. H. Ling; Douglas R. Stinson (Australas. J Comb., 2007)

On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges. - Yeow Meng Chee; Alan C. H. Ling (SIAM J. Discret. Math., 2007)

On the Existence of K5 setminuse-Designs with Application to Optical Networks. - Gennian Ge; Alan C. H. Ling (SIAM J. Discret. Math., 2007)

The PBD-Closure of Constant-Composition Codes. - Yeow Meng Chee; Alan C. H. Ling; San Ling; Hao Shen (IEEE Trans. Inf. Theory, 2007)

Note edge-colourings of K n, n with no long two-coloured cycles. - Peter Dukes; Alan C. H. Ling (Comb., 2008)

Constructing strength three covering arrays with augmented annealing. - Myra B. Cohen; Charles J. Colbourn; Alan C. H. Ling (Discret. Math., 2008)

Minimum embedding of Steiner triple systems into (K4-e)-designs I. - Charles J. Colbourn; Alan C. H. Ling; Gaetano Quattrocchi (Discret. Math., 2008)

Resolvable balanced incomplete block designs with subdesigns of block size 4. - Gennian Ge; Malcolm Greig; Alan C. H. Ling; Rolf S. Rees (Discret. Math., 2008)

The Fine Intersection Problem for Steiner Triple Systems. - Yeow Meng Chee; Alan C. H. Ling; Hao Shen (Graphs Comb., 2008)

Mining partial periodic correlations in time series. - Zhen He 002; Xiaoyang Sean Wang; Byung Suk Lee 001; Alan C. H. Ling (Knowl. Inf. Syst., 2008)

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven. - Charles J. Colbourn; Hung-Lin Fu; Gennian Ge; Alan C. H. Ling; Hui-Chuan Lu (SIAM J. Discret. Math., 2008)

The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: A Complete Solution. - Yeow Meng Chee; Son Hoang Dau; Alan C. H. Ling; San Ling (IEEE Trans. Inf. Theory, 2008)

Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three. - Yeow Meng Chee; Gennian Ge; Alan C. H. Ling (IEEE Trans. Inf. Theory, 2008)

A Systematic Construction for Radar Arrays. - Gennian Ge; Alan C. H. Ling; Ying Miao 001 (IEEE Trans. Inf. Theory, 2008)

Optical grooming with grooming ratio eight. - Charles J. Colbourn; Gennian Ge; Alan C. H. Ling (Discret. Appl. Math., 2009)

Linear hash families and forbidden configurations. - Charles J. Colbourn; Alan C. H. Ling (Des. Codes Cryptogr., 2009)

Further results on (v, {5, w*}, 1)-PBDs. - R. Julian R. Abel; Gennian Ge; Malcolm Greig; Alan C. H. Ling (Discret. Math., 2009)

Graph designs for the eight-edge five-vertex graphs. - Charles J. Colbourn; Gennian Ge; Alan C. H. Ling (Discret. Math., 2009)

Maximum uniformly resolvable designs with block sizes 2 and 4. - Jeffrey H. Dinitz; Alan C. H. Ling; Peter Danziger (Discret. Math., 2009)

Minimum embedding of Steiner triple systems into (K4-e)-designs II. - Alan C. H. Ling; Charles J. Colbourn; Gaetano Quattrocchi (Discret. Math., 2009)

Linear spaces with small generated subspaces. - Peter Dukes; Alan C. H. Ling (J. Comb. Theory A, 2009)

A recursive construction for perfect hash families. - Charles J. Colbourn; Alan C. H. Ling (J. Math. Cryptol., 2009)

The Existence of N2 Resolvable Latin Squares. - A. J. Wolfe; Alan C. H. Ling; Jeffrey H. Dinitz (SIAM J. Discret. Math., 2009)

The Existence of r×4 Grid-Block Designs with r=3, 4. - Rucong Zhang; Gennian Ge; Alan C. H. Ling; Hung-Lin Fu; Yukiyasu Mutoh (SIAM J. Discret. Math., 2009)

Limit on the Addressability of Fault-Tolerant Nanowire Decoders. - Yeow Meng Chee; Alan C. H. Ling (IEEE Trans. Computers, 2009)

On the existence of well-ordered Steiner triple systems. - Alan C. H. Ling (Ars Comb., 2010)

Spectrum of Sizes for Perfect Deletion-Correcting Codes. - Yeow Meng Chee; Gennian Ge; Alan C. H. Ling (SIAM J. Discret. Math., 2010)

Linear size optimal q-ary constant-weight codes and constant-composition codes. - Yeow Meng Chee; Son Hoang Dau; Alan C. H. Ling; San Ling (IEEE Trans. Inf. Theory, 2010)

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization. - Yeow Meng Chee; Alan C. H. Ling; Jianxing Yin (IEEE Trans. Inf. Theory, 2010)

Optical grooming with grooming ratio nine. - Charles J. Colbourn; Gennian Ge; Alan C. H. Ling (Discret. Math., 2011)

Optimal equitable symbol weight codes for power line communications. - Yeow Meng Chee; Han Mao Kiah; Alan C. H. Ling; Chengmin Wang (ISIT, 2012)

Grooming traffic to minimize load. - Charles J. Colbourn; Alan C. H. Ling; Gaetano Quattrocchi; Violet R. Syrotiuk (Discret. Math., 2012)

Covering and packing for pairs. - Yeow Meng Chee; Charles J. Colbourn; Alan C. H. Ling; Richard M. Wilson 001 (J. Comb. Theory A, 2013)

A Construction of Modular Generalized Sidon Sets. - Charles C. Y. Lam; Alan C. H. Ling (Ars Comb., 2014)

Pairwise Balanced Designs with Prescribed Minimum Dimension. - Peter Dukes; Alan C. H. Ling (Discret. Comput. Geom., 2014)

Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses. - Yeow Meng Chee; Charles J. Colbourn; Alan Chi Hung Ling; Hui Zhang 030; Xiande Zhang (Des. Codes Cryptogr., 2015)

A finite embedding theorem for partial Steiner 3-designs. - Peter J. Dukes; Tao Feng 002; Alan C. H. Ling (Finite Fields Their Appl., 2015)

Graph Divisible Designs and Packing Constructions. - Peter J. Dukes; Alan C. H. Ling (Graphs Comb., 2015)

Thickly-resolvable block designs. - Peter J. Dukes; Alan C. H. Ling; Amanda Malloch (Australas. J Comb., 2016)

Resolvable Group Divisible Designs with Large Groups. - Peter J. Dukes; Esther R. Lamken; Alan C. H. Ling (Electron. J. Comb., 2016)

Matching divisible designs with block size four. - Peter J. Dukes; Tao Feng 002; Alan C. H. Ling (Discret. Math., 2016)

Relative Difference Sets Partitioned by Cosets. - Peter J. Dukes; Alan C. H. Ling (Electron. J. Comb., 2017)

Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families. - Yeow Meng Chee; Fei Gao; Han Mao Kiah; Alan Chi Hung Ling; Hui Zhang 030; Xiande Zhang (SIAM J. Discret. Math., 2019)

Access balancing in storage systems by labeling partial Steiner systems. - Yeow Meng Chee; Charles J. Colbourn; Hoang Dau; Ryan Gabrys; Alan C. H. Ling; Dylan Lusi; Olgica Milenkovic (Des. Codes Cryptogr., 2020)

Scheduling to reduce close contacts: resolvable grid graph decomposition and packing. - Yeow Meng Chee; Alan Chi Hung Ling; Van Khu Vu; Hui Zhang 030 (Des. Codes Cryptogr., 2023)