Alan CH Ling - College of Engineering and Mathematics - University ...
Alan CH Ling - College of Engineering and Mathematics - University ...
Alan CH Ling - College of Engineering and Mathematics - University ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
11. C.J. Colbourn, G. Ge <strong>and</strong> A.C.H. <strong>Ling</strong>, Graph designs for the eight-edge five-vertex graphs, DiscreteMath. (2009), 6440-6445.12. A.J. Wolfe, A.C.H. <strong>Ling</strong> <strong>and</strong> J.H. Dinitz, The existence <strong>of</strong> N 2 -resolvable Latin squares, SIAMJournal on Discrete Math. (2009), 1217-1237.13. A.C.H. <strong>Ling</strong> <strong>and</strong> J.H. Dinitz, The Hamilton-Waterloo problem with triangle-factors <strong>and</strong> Hamiltoncycles: the case n ≡ 3 (mod 18), J. Combin. Math. <strong>and</strong> Combin. Comput. (2009), 143-147.14. P. Dukes <strong>and</strong> A.C.H. <strong>Ling</strong>, Existence <strong>of</strong> balanced sampling plan avoiding adjacent distances, Metrika(2009), 131-140.15. C.J. Colbourn, G. Ge <strong>and</strong> A.C.H. <strong>Ling</strong>, Optical grooming with grooming ratio eight, DiscreteApplied <strong>Mathematics</strong> (2009), 2763-2772.16. J.H. Dinitz, A.C.H. <strong>Ling</strong> <strong>and</strong> P. Danziger, Maximum uniformly resolvable designs with block sizes2 <strong>and</strong> 4, Discrete Math. (2009), 4716-4721.17. R. Zhang, G. Ge, A.C.H. <strong>Ling</strong>, <strong>and</strong> H.L. Fu <strong>and</strong> Y. Mutoh, The existence <strong>of</strong> r ×4 grid-block designswith r = 3, 4, SIAM Journal on Discrete Math. (2009), 1045-1062.18. R.J.R. Abel, G. Ge, M. Greig <strong>and</strong> A.C.H. <strong>Ling</strong>, Further results on (v, {5, w ⋆ }, 1)-PBDs, DiscreteMath. (2009), 2323-2339.19. C.J. Colbourn <strong>and</strong> A.C.H. <strong>Ling</strong>, Linear hash families <strong>and</strong> forbidden configurations, Designs Codes<strong>and</strong> Crypt. (2009), 25-55.20. J.H. Dinitz <strong>and</strong> A.C.H. <strong>Ling</strong>, The Hamilton-Waterloo problem: the case <strong>of</strong> triangle-factors <strong>and</strong> oneHamilton cycle, Journal <strong>of</strong> Combinatorial Designs (2009), 160-176.21. A.C.H. <strong>Ling</strong>, C.J. Colbourn, <strong>and</strong> Q. Quattrocchi, Minimum embedding <strong>of</strong> Steiner triple systemsinto K 4 \ e designs II, Discrete Math. (2009), 400-411.22. C.J. Colbourn, H.L. Fu, G. Ge, A.C.H. <strong>Ling</strong> <strong>and</strong> H.C. Lu, Minimizing SONET AMDs in unifirectionalWDM rings with grooming ratio seven, SIAM Journal on Discrete Math. , 2008/09, 109-122.23. Y.M. Chee, G. Ge <strong>and</strong> A.C.H. <strong>Ling</strong>, Group divisible codes <strong>and</strong> their application in the construction<strong>of</strong> optimal constant-composition codes <strong>of</strong> weight three, IEEE Trans. on Inform. Theory (2008),3552-3564.24. Y.M. Chee, S.H. Dau, A.C.H. <strong>Ling</strong> <strong>and</strong> S. <strong>Ling</strong>, The sizes <strong>of</strong> optimal q-ary codes <strong>of</strong> weight three<strong>and</strong> distance four: a complete solution, IEEE Trans. on Inform. Theory (2008), 3552-3564.25. C.J. Colbourn. A.C.H. <strong>Ling</strong> <strong>and</strong> G. Quattrocchi, Minimum embedding <strong>of</strong> Steiner triple systemsinto K 4 \ e designs I, Discrete Math. (2008), 5308-5311.26. G.Ge, A.C.H. <strong>Ling</strong> <strong>and</strong> Y. Miao, A systematic construction for Radar Arrays, IEEE Trans. onInform. Theory (2008), 410-414.27. P. Dukes <strong>and</strong> A.C.H. <strong>Ling</strong>, Edge-coloring <strong>of</strong> K n,n with no long two-colored cycles, Combinatorica(2008), 373-378.28. Y. Chee, A.C.H. <strong>Ling</strong> <strong>and</strong> H. Shen, Fine intersection <strong>of</strong> STS, Graph <strong>and</strong> Combinatorics (2008),149-157.29. M.B. Cohen, C.J. Colbourn, <strong>and</strong> A.C.H. <strong>Ling</strong>, Constructing Strength Three Covering Arrays withAugmented Annealing, Discrete Math. (2008), 2709-2722.30. G. Ge, M. Greig, A.C.H. <strong>Ling</strong> <strong>and</strong> R.S. Rees, Resolvable balanced block designs with subdesigns <strong>of</strong>block size 4, Discrete Math. (2008), 2674-2703.5