Theses

  1. Y. M. Chee, Turán-Type Problems in Group Testing, Coding Theory and Cryptography, Ph.D. Thesis, Department of Computer Science, University of Waterloo, Ontario, Canada. [Outstanding Achievement in Graduate Studies Award] (Buy from UMI ProQuest Digital Dissertations)
  2. Y. M. Chee, The Basis Reduction Algorithm and Existence of Combinatorial Designs, M.Math. Thesis, Department of Computer Science, University of Waterloo, Ontario, Canada.
 

Chapter in Books

  1. Y. M. Chee, “Graphical designs”, CRC Handbook of Combinatorial Designs, Chapter IV.23, pp. 366-369, 1996. (Buy from Amazon.com)
 

Refereed Journal Papers

  1. Y. M. Chee, “A new lower bound for A(17,6,6)”, Ars Combinatoria (to appear).
  2. Y. M. Chee, “Steiner triple systems intersecting in pairwise disjoint blocks”, Electronic Journal of Combinatorics 11 (2004), #R27.
  3. H. K. Aw, Y. M. Chee, and A. C. H. Ling, “Six new constant weight binary codes”, Ars Combinatoria 67 (2003), 313-318.
  4. Y. M. Chee and A. C. H. Ling, “Uniform group divisible designs with block sizes 3 and n”, Graphs and Combinatorics 18 (2002), no. 3, 421-445.
  5. Y. M. Chee and S. Ling, “Highly symmetric expanders”, Finite Fields and Their Applications 8 (2002), no. 3, 294-310.
  6. Y. M. Chee, “An improved finiteness theorem for graphical t-designs”, Discrete Mathematics 237 (2001), no. 1-3, 185-186.
  7. Y. M. Chee, C. J. Colbourn, and A. C. H. Ling, “Asymptotically optimal erasure-resilient codes for large disk arrays”, Discrete Applied Mathematics 102 (2000), no. 1-2, 3-36.
  8. Y. M. Chee and S. Ling, “Combinatorial coverings from geometries over principal ideal rings”, Journal of Combinatorial Designs 7 (1999), no. 4, 247-268.
  9. Y. M. Chee and S. S. Magliveras, “A few more large sets of t-designs”, Journal of Combinatorial Designs 6 (1998), no. 4, 293-308.
  10. Y. M. Chee, C. J. Colbourn, and A. C. H. Ling, “Weakly union-free twofold triple systems”, Annals of Combinatorics 1 (1997), no. 3, 215-225.
  11. Y. M. Chee and C. J. Colbourn, “Constructions for difference triangle sets”, IEEE Transactions on Information Theory 43 (1997), no. 4, 1346-1349.
  12. Y. M. Chee, C. J. Colbourn, R. P. Gallant, and A. C. H. Ling, “On a problem of Hartman and Heinrich concerning pairwise balanced designs with holes”, Journal of Combinatorial Mathematics and Combinatorial Computing 23 (1997) 121-127.
  13. A. Lim, Y. M. Chee, and W. Hsu, “Upgrading links for performance”, Informatica (Vilnius) 7 (1996), no. 4, 455-468.
  14. A. Lim and Y. M. Chee, “On the link upgrade problem for trees”, Journal of Combinatorics, Information & System Sciences 21 (1996), no. 1, 5-14.
  15. Y. M. Chee and S. H. Goh, “Security challenges in NII”, Information Technology - Journal of the Singapore Computer Society 6 (1994), no. 1, 43-50.
  16. Y. M. Chee, “Some simple three-designs of small order”, Journal of Combinatorial Mathematics and Combinatorial Computing 16 (1994) 163-164.
  17. Y. M. Chee and D. L. Kreher, “4-(21,5,λ) designs from a group of order 171”, Ars Combinatoria 36 (1993) 199-205.
  18. Y. M. Chee and S. Ling, “Projective covering designs”, Bulletin of the London Mathematical Society 25 (1993), no. 3, 231-239.
  19. A. Lim, Y. M. Chee, and S.-W. Cheng, “Single jog minimum area joining of compacted cells”, Information Processing Letters 47 (1993), no. 4, 167-172.
  20. Y. M. Chee, “The existence of a simple 3-(28,5,30) design”, Discrete Mathematics 118 (1993), no. 1-3, 251-252.
  21. Y. M. Chee and G. F. Royle, “Enumeration of small nonisomorphic 1-rotational twofold triple systems”, with microfiche supplement, Mathematics of Computation 59 (1992), no. 200, 609-612.
  22. Y. M. Chee, “On graphical quintuple systems”, Journal of Symbolic Computation 13 (1992), no. 6, 677-681.
  23. Y. M. Chee and A. Lim, “The algorithmic complexity of colour switching”, Information Processing Letters 43 (1992), no. 2, 63-68.
  24. Y. M. Chee and T. T. Png, “Scan lines and Gouraud shading of triangles”, Bulletin of the Institute of Combinatorics and its Applications 4 (1992) 111-112.
  25. Y. M. Chee and G. F. Royle, “The 2-rotational Steiner triple systems of order 25”, Discrete Mathematics 97 (1991), no. 1-3, 93-100.
  26. Y. M. Chee, “Graphical t-designs with block sizes three and four”, Discrete Mathematics 91 (1991), no. 2, 201-206.
  27. Y. M. Chee, C. J. Colbourn, S. C. Furino, and D. L. Kreher, “Large sets of disjoint t-designs”, Australiasian Journal of Combinatorics 2 (1990) 111-119.
  28. Y. M. Chee, C. J. Colbourn, and D. L. Kreher, “Simple t-designs with v £ 30”, Ars Combinatoria 29 (1990) 193-258.
  29. D. L. Kreher, Y. M. Chee, D. de Caen, C. J. Colbourn, and E. S. Kramer, “Some new simple t-designs”, Journal of Combinatorial Mathematics and Combinatorial Computing 7 (1990) 53-90.
  30. Y. M. Chee and A. Lim, “Quadrilateral-free Steiner triple systems of orders 31 and 37”, Journal of Combinatorics, Information & System Sciences 14 (1989), no. 4, 244-248.
 

Refereed Conference Papers

  1. Y. M. Chee and S. Ling, “Algebraic constructions of Ramanujan graphs and highly symmetric expanders”, in: Proceedings of the Second Asian Mathematical Conference 1995, S. Tangmanee & E. Schulz eds, World Scientific, 1998, pages 276-282. (Buy from Amazon.com)
  2. A. Lim and Y. M. Chee, “Upgrading links for guaranteed performance”, in: Proceedings of the IEEE Singapore International Conference on Networks and Information Engineering, 1995, pages 398-402.
  3. B. Nordhausen, Y. M. Chee, R. Yeo, and D. Pang, “Digital signatures using SGML”, in: Proceedings of SGML ‘93 Conference, 1993.
  4. S. H. Goh, Y. M. Chee, and M. Yap, “Security and management in IT2000”, in: Proceedings of the First Privacy and Security Research Group Workshop on Network and Distributed System Security, 1993, pages 11-28.
  5. Y. M. Chee and A. Lim, “A complex approach to the security of statistical databases subject to off-line sum queries”, in: IT Security: The Need for International Cooperation, IFIP Transactions A-15, North-Holland, Amsterdam, 1992, pages 373-384.
  6. Y. M. Chee, A. Joux, and J. Stern, “The cryptanalysis of a new public-key cryptosystem based on modular knapsacks”, in: Advances in Cryptology - CRYPTO ‘91 Proceedings, Lecture Notes in Computer Science 576, Springer-Verlag, Berlin, 1992, pages 204-212.
  7. A. Lim, Y. M. Chee, and C. T. Wu, “Performance driven placement with global routing for macro cells”, in: Proceedings of the Second Great Lakes Symposium on VLSI, 1992, pages 35-41. (Buy from Amazon.com)
  8. Y. M. Chee, H. W. Leong, A. Lim, and C. P. Low, “Simulated annealing algorithm for the fault-covering of redundant RAMs”, in: Proceedings of the 24th IEEE International Symposium on Circuits and Systems, 1991, pages 2144-2147.
  9. A. Lim and Y. M. Chee, “Graph partitioning using tabu search”, in: Proceedings of the 24th IEEE International Symposium on Circuits and Systems, 1991, pages 1164-1167.