Get started
Author

Alan C. H. Ling

Observed names: A. C. H. Ling, A.C.H. Ling, Alan C. H. Ling A, Alan C. H. Ling B, Alan C.H Ling, Alan C.H. Ling, Alan Chi Hung Ling, Alan H. Ling, Alan Ling, Ling, Alan C. H., Ling, Alan Chi Hung
Observed institutions: University of Vermont, Agency for Science, Technology and Research, Michigan Technological University, University of Science and Technology of China, University of Waterloo, Nanyang Technological University, University of Toronto, University of Victoria
OpenAlex ID: A5111648433
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
2004 · C.J. Colbourn, T. Klove, et al. · IEEE Transactions on Information Theory · 155
Augmenting simulated annealing to build interaction test suites
2005 · M.B. Cohen, C.J. Colbourn, et al. · 127
Constructing strength three covering arrays with augmented annealing
2007 · Myra B. Cohen, Charles J. Colbourn, et al. · Discrete Mathematics · 126
PDF
Group divisible designs with block size four and group type gum1 for small g
2004 · Gennian Ge, Alan C.H Ling · Discrete Mathematics · 52
PDF
Construction Techniques for Anti-Pasch Steiner Triple Systems
2000 · A. C. H. Ling, C. J. Colbourn, et al. · Journal of the London Mathematical Society · 51
Asymptotic results on the existence of 4‐ RGDDs and uniform 5‐ GDDs
2004 · Gennian Ge, Alan C. H. Ling · Journal of Combinatorial Designs · 49
The existence of uniform 5-GDDs
1997 · Jianxing Yin, Alan C. H. Ling, et al. · Journal of Combinatorial Designs · 45
A class of partial triple systems with applications in survey sampling
1998 · Charles J. Colbourn, Alan C.H. Ling · Communication in Statistics- Theory and Methods · 42
Topology-transparent scheduling for MANETs using orthogonal arrays
2003 · Violet R. Syrotiuk, Charles J. Colbourn, et al. · 39
Constrained Ramsey numbers of graphs
2002 · Robert E. Jamison, Tao Jiang, et al. · Journal of Graph Theory · 37
Grooming in unidirectional rings: K4−e designs
2004 · Jean-Claude Bermond, Charles J. Colbourn, et al. · Discrete Mathematics · 35
PDF
Pairwise Balanced Designs with Consecutive Block Sizes
1997 · Alan C. H. Ling, Xiaojun Zhu, et al. · Designs Codes and Cryptography · 35
The Existence of Kirkman Squares—Doubly Resolvable (v,3,1)-BIBDs
2002 · Charles J. Colbourn, E. R. Lamken, et al. · Designs Codes and Cryptography · 34
Asymptotically optimal erasure-resilient codes for large disk arrays
2000 · Yeow Meng Chee, Charles J. Colbourn, et al. · Discrete Applied Mathematics · 34
PDF
Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes
2010 · Yeow Meng Chee, Son Hoang Dau, et al. · IEEE Transactions on Information Theory · 33
PDF
Location-aware key predistribution scheme for wide area wireless sensor networks
2006 · Katerina Simonova, Alan C. H. Ling, et al. · 33
Cover-Free Families and Topology-Transparent Scheduling for MANETs
2004 · Charles J. Colbourn, Alan C. H. Ling, et al. · Designs Codes and Cryptography · 33
Super-simple (v,5,2)-designs
2003 · Hans-Dietrich O.F. Gronau, Donald L. Kreher, et al. · Discrete Applied Mathematics · 33
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
2008 · Yeow Meng Chee, Gennian Ge, et al. · IEEE Transactions on Information Theory · 31
PDF
Skolem-type Difference Sets for Cycle Systems
2003 · Darryn Bryant, Heather Gavlas, et al. · The Electronic Journal of Combinatorics · 31
The Hamilton—Waterloo problem: The case of triangle‐factors and one Hamilton cycle
2008 · J.H. Dinitz, Alan C.H. Ling · Journal of Combinatorial Designs · 30
A survey on resolvable group divisible designs with block size four
2003 · Gennian Ge, Alan C.H Ling · Discrete Mathematics · 28
PDF
Modified group divisible designs with block size four
2000 · Alan C.H. Ling, Charles J. Colbourn · Discrete Mathematics · 28
PDF
Resolvable Maximum Packings with Quadruples
2005 · Gennian GE, C. W. H. LAM, et al. · Designs Codes and Cryptography · 26
Quorums from difference covers
2000 · Charles J. Colbourn, Alan C.H. Ling · Information Processing Letters · 25
Works count: 160
Citation count: 2,081
H-index: 25
I10-index: 66
Year
Topic
Type