Home About Me What I Do Education Theses Books Journal Publications Conference Publications Lab

I'm

Yeow Meng Chee

Provost and Chief Academic & Innovation Officer

Singapore University of Technology and Design

Hero Image
Image


About Me

Researcher, Educator, Administrator, and Entrepreneur

As of 2 April 2025, I serve as Provost and Chief Academic & Innovation Officer at the Singapore University of Technology and Design (SUTD), where I am responsible for shaping the university’s strategic direction in education and research. I am also a professor in Engineering Systems and Design, and in Information Systems Technology and Design.

Priot to this, I was Vice President (Innovation & Enterprise) and Professor of Industrial Systems Engineering and Management at the National University of Singapore (NUS). At NUS, I held several key leadership roles, including Vice Provost (Technology-Enhanced and Experiential Learning) from 2022 to 2023, and Associate Vice President (Innovation & Enterprise) from 2019 to 2022. I also served as Director of the NUS Enterprise Academy and NUS Overseas Colleges (NOC).

Beyond academia, I am currently an independent director of Azeus Systems Holdings Ltd, where I chair the Remuneration Committee and serve as a member of the Audit Committee.

My earlier academic appointments include serving as Head of the Division of Mathematical Sciences (2008-2010), Chair of the School of Physical and Mathematical Sciences (2011-2017), and Interim Dean of the College of Science (2018-2019) at the Nanyang Technological University.

Before entering academia, I held senior roles in public service, including Head of Security (Information Infrastructure) and Assistant Director (Internationalisation) at the National Computer Board, Deputy Director (Strategic Programs) at the Infocomm Development Authority, and Program Director (Interactive Digital Media R&D) at the Media Development Authority, where I was responsible for a $50M fund that supports digital media research in Singapore universities. I deployed Asia's first public certification authority Netrust in 1997, and also co-founded the Singapore Computer Emergency Response Team (SingCERT).

I represented Singapore in various international forums, including as member of the APEC Electronic Commerce Task Force in 1998, member of the ASEAN Coordinating Committee on Electronic Commerce in 1998, member of the Working Group on ASEAN Information Infrastructure in 1999, secretariat of the Canada-Singapore IT Joint Council in 1998, co-chair of the APEC TEL Public Key Interoperability Expert Group in 1999, secretariat of the Australia-Singapore ICT Joint Council in 1999, and a member of the APEC Project DARE (Data Analytics Raising Employment) Advisory Board in 2017.

At the national level, I was a member of the National IT Security Committee and its Expert Sub-Committee in 1997, member of the National Information Infrastructure Standards Security Working Group in 1997, member of the E-Commerce Hotbed Policy Committee's Legal, Regulatory and Enforcement Study Group that drafted Singapore's Electronic Transactions Act, member of the Smart Solutions Committee of the Singapore Corporation of Rehabilitative Enterprises (SCORE) in 2015, and member of the Core Group of NRF's Singapore Data Science Consortium in 2016. I am currently on the Advisory Council of the Association of Information Security Professionals (AiSP).

In 2000, I began my entrepreneurial journey as a co-founder of a spinoff, CoolConnect (now Ufinity), from IDA. I went on to found a few more startups: Idea Foundries, Canvas Ventures, and Netorics, before returning to public service, and eventually joining NUS. I continued to be involved in startups, and have spun off Matchimi in 2014 and Mentum in 2017.

My major research interests lie in two areas:

  • the interplay between combinatorics and computer science, especially coding theory, extremal set systems, and their applications; and
  • data engineering and artificial intelligence, especially novel applications of machine learning.
I am a Fellow and Council Member of the Institute of Combinatorics and its Applications. I served as an associate editor of the IEEE Transactions on Information Theory, and an editorial board member of the Journal of Combinatorial Theory, Series A.

In 2018, I was awarded the Public Administration Medal (Silver) by the Singapore Government, and in 1985, I was awarded the National Computer Board Scholarship.

What I do

Discover, Inspire, and Transform

Research

My research interests lie in the interplay between combinatorics and computer science, especially coding theory, data engineering, and artificial intelligence

Education

I am deeply passionate about entrepreneurship education and training, especially the use of experiential learning as a pedagogy

Character & Values

I believe education goes beyond academic development, into holistic development of students, instilling values and building character

Venture Creation

I am always on the look out for ideas with the potential to make impact, or for startups with interesting ideas

My Education

Education

1996 - 1997

Post-Doctoral Fellow

IBM Zurich Research Laboratory, Zurich, Switzerland

Member of the Secure Computing Group under the supervision of Matthias Kaiserswerth. Prototyped a secure online ticketing system for the Swiss Federal Railways (SBB)

1996

Post-Doctoral Fellow

University of Waterloo, Ontario, Canada

In the Department of Combinatorics & Optimization, under the supervision of Scott Vanstone. Implemented elliptic curve schemes in the then draft IEEE P1363 standard to ensure their correctness

1994 - 1996

PhD Student

University of Waterloo, Ontario, Canada

PhD student in the Department of Computer Science, first under the supervision of Anna Lubiw, and then Charlie Colbourn. I was awarded the 1996 "Outstanding Achievement in Graduate Studies" honour. The title of my PhD thesis is "Turan-type Problems in Group Testing, Coding Theory, and Cryptography"

1988 - 1989

Master's Student

University of Waterloo, Ontario, Canada

MMath student in the Department of Computer Science, under the supervision of Charlie Colbourn. The title of my MMath thesis is "The Basis Reduction Algorithm and Existence of Combinatorial Designs"

1985 - 1988

Undergraduate Student

University of Waterloo, Ontario, Canada

BMath student in the Department of Computer Science, with double major in Computer Science, and Combinatorics & Optimization. Ron Mullin was my informal undergraduate supervisor. I won the Putnam Endowment Award and Fejer Award in 1989. I also received Honourable Mention (top 50) in the 1987 William Lowell Putnam Mathematical Competition

1983 - 1984

Junior College Student

Hwa Chong Junior College, Singapore

Among the first cohort of students in Singapore to take the Cambridge S papers. I scored a distinction in the Mathematics S paper. I was also awarded a National Computer Board Undergraduate Scholarship

1979 - 1982

Secondary School Student

Raffles Institution, Singapore

Represented school in the 1982 Singapore Mathematical Society Inter-School Mathematical Competition

1973 - 1978

Primary School Student

River Valley English School, Singapore

Top 8% of national cohort

My Theses

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, Canada, 1996. [PDF]
  2. Y. M. Chee, “The Basis Reduction Algorithm and Existence of Combinatorial Designs,” M.Math. Thesis, Department of Computer Science, University of Waterloo, Canada, 1989.

My Books

Books Authored and Edited

Image

NUS Overseas Colleges Story: Grooming Start-up Founders at Asia's Top University

Y. M. Chee and G. Chng

World Scientific, 2023

Image

Coding and Cryptology, vol. 6639 of Lecture Notes in Computer Science

Y. M. Chee, Z. Buo, S. Ling, F. Shao, Y. Tang, H. Wang, and C. Xing (Eds.)

Springer-Verlag, 2011

Image

Coding and Cryptology, vol. 5557 of Lecture Notes in Computer Science

Y. M. Chee, C. Li, S. Ling, H. Wang, and C. Xing (Eds.)

Springer-Verlag, 2009

Research Publications

Refereed Journal Publications

  1. Y. M. Chee, T. Etzion, K. A. S. Immink, T. T. Nguyen, V. K. Vu, and J. H. Weber, “Thermal-aware Communication,” IEEE Transactions on Information Theory, vol. 71, no. 6, pp. 4145–4155, 2025. [PDF]
  2. Y. M. Chee, T. Etzion, H. M. Kiah, and H. Zhang, “Recovery sets of subspaces from a simplex code,” IEEE Transactions on Information Theory, vol. 70, no. 10, pp. 6961–6973, 2024. [PDF]
  3. Z. Chen, P. N. Karthik, V. Y. F. Tan, and Y. M. Chee, “Federated best arm identification with heterogeneous clients,” IEEE Transactions on Information Theory, vol. 70, no. 6, pp. 4258–4279, 2024. [PDF]
  4. J. Li, Y. Ma, Z. Cao, Y. Wu, W. Song, J. Zhang, and Y. M. Chee, “Learning feature embedding refiner for solving vehicle routing problems,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 11, pp. 15279–15291, 2024. [PDF]
  5. Y. M. Chee, A. Vardy, V. K. Vu, and E. Yaakobi, “Transverse-read codes for domain wall memories,” IEEE Journal on Selected Areas in Information Theory, vol. 4, pp. 784–793, 2023. [PDF]
  6. Y. M. Chee, T. Etzion, H. M. Kiah, and A. Vardy, “Domination mappings into the hamming ball: existence, constructions, and algorithms,” Advances in Mathematics of Communications, vol. 17, no. 5, pp. 1027–1059, 2023. [PDF]
  7. T. T. Nguyen, K. Cai, H. M. Kiah, K. A. S. Immink, and Y. M. Chee, “Two-dimensional RC/SW constrained codes: bounded weight and almost balanced weight,” IEEE Transactions on Information Theory, vol. 69, no. 8, pp. 4961–4976, 2023. [PDF]
  8. S. Jiang, Y. M. Chee, S. Ling, H. Wang, and C. Xing, “A new framework for deniable secure key exchange,” Information and Computation, vol. 285, Part B, 104866, 2022. [PDF] and story behind this paper
  9. Y. M. Chee, M. Horovitz, A. Vardy, V. K. Vu, and E. Yaakobi, “Endurance-limited memories: capacity and codes,” IEEE Transactions on Information Theory, vol. 68, no. 3, pp. 1599–1613, 2022. [PDF]
  10. Y. M. Chee, T. Etzion, H. M. Kiah, S. Marcovich, A. Vardy, V. K. Vu, and E. Yaakobi, “Locally-constrained de Bruijn codes: properties, enumeration, code constructions, and applications,” IEEE Transactions on Information Theory, vol. 67, no. 12, pp. 7857–7875, 2021. [PDF]
  11. Y. M. Chee, T. Etzion, H. M. Kiah, A. Vardy, and C. Wang, “Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions,” Journal of Combinatorial Designs, vol. 29, no. 7, pp. 447–481, 2021. [PDF]
  12. K. Cai, Y. M. Chee, R. Gabrys, H. M. Kiah, and T. T. Nguyen, “Correcting a single indel/edit for DNA-based data storage: linear-time encoders and order-optimality,” IEEE Transactions on Information Theory, vol. 67, no. 6, pp. 3438–3451, 2021. [PDF]
  13. Y. M. Chee, H. M. Kiah, and H. Zhang, “Lower bounds for total storage of multiset combinatorial batch codes using linear programming,” IEEE Transactions on Information Theory, vol. 67, no. 1, pp. 255–267, 2021. [PDF]
  14. Y. M. Chee, H. M. Kiah, and H. Wei, “Efficient and explicit balanced primer codes,” IEEE Transactions on Information Theory, vol. 66, no. 9, pp. 5344– 5357, 2020. [PDF]
  15. Y. M. Chee, J. Chrisnata, H. M. Kiah, and T. T. Nguyen, “Efficient encoding/decoding of GC-balanced codes correcting tandem duplications,” IEEE Transactions on Information Theory, vol. 66, no. 8, pp. 4892–4903, 2020. [PDF]
  16. Y. M. Chee, T. Etzion, H. M. Kiah, A. Vardy, and H. Wei, “Low-power cooling codes with efficient encoding and decoding,” IEEE Transactions on Information Theory, vol. 66, no. 8, pp. 4804–4818, 2020. [PDF]
  17. Y. M. Chee, H. M. Kiah, A. Vardy, and E. Yaakobi, “Explicit and efficient WOM codes of finite length,” IEEE Transactions on Information Theory, vol. 66, no. 5, pp. 2669–2682, 2020. [PDF]
  18. Y. M. Chee, D. T. Dao, H. M. Kiah, S. Ling, and H. Wei, “Robust positioning patterns with low redundancy,” SIAM Journal on Computing, vol. 49, no. 2, pp. 284–317, 2020. [PDF]
  19. Y. M. Chee, S. Ling, T. T. Nguyen, V. K. Vu, H. Wei, and X. Zhang, “Burst-deletion-correcting codes for permutations and multipermutations,” IEEE Transactions on Information Theory, vol. 66, no. 2, pp. 957–969, 2020. [PDF]
  20. Y. M. Chee, J. Chrisnata, H. M. Kiah, and T. T. Nguyen, “Deciding the confusability of words under tandem repeats in linear time,” ACM Transactions on Algorithms, vol. 15, no. 3, pp. 1–22, 2019. [PDF]
  21. Y. M. Chee, J. Chrisnata, H. M. Kiah, S. Ling, T. T. Nguyen, and V. K. Vu, “Capacity-achieving codes that mitigate intercell interference and charge leakage in flash memories,” IEEE Transactions on Information Theory, vol. 65, no. 6, pp. 3702–3712, 2019. [PDF]
  22. Y. M. Chee, F. Gao, H. M. Kiah, A. C. H. Ling, H. Zhang, and X. Zhang, “Decompositions of edge-colored digraphs: a new technique in the constuction of constant-weight codes and related families,” SIAM Journal on Discrete Mathematics, vol. 33, no. 1, pp. 209–229, 2019. [PDF]
  23. Y. M. Chee, H. M. Kiah, A. Vardy, V. K. Vu, and E. Yaakobi, “Coding for racetrack memories,” IEEE Transactions on Information Theory, vol. 64, no. 11, pp. 7094–7112, 2018. [PDF]
  24. Y. M. Chee and X. Zhang, “Optimal q-ary error correcting/all unidirectional error detecting codes,” IEEE Transactions on Information Theory, vol. 64, no. 8, pp. 5806–5812, 2018. [PDF]
  25. Y. M. Chee, T. Etzion, H. M. Kiah, and A. Vardy, “Cooling codes: Thermal management coding for high-performance interconnects,” IEEE Transactions on Information Theory, vol. 64, no. 4, pp. 3062–3085, 2018. [PDF]
  26. Y. M. Chee, H. M. Kiah, S. Ling, and H. Wei, “Geometric orthogonal codes of size larger than optical orthogonal codes,” IEEE Transactions on Information Theory, vol. 64, no. 4, pp. 2883–2895, 2018. [PDF]
  27. Y. M. Chee and X. Zhang, “Linear size constant-composition codes meeting the Johnson bound,” IEEE Transactions on Information Theory, vol. 64, no. 2, pp. 909–917, 2018. [PDF]
  28. Y. M. Chee, H. M. Kiah, H. Zhang, and X. Zhang, “Constructions of optimal and near-optimal multiply constant-weight codes,” IEEE Transactions on Information Theory, vol. 63, no. 6, pp. 3621–3629, 2017. [PDF]
  29. Y. M. Chee, H. M. Kiah, P. Purkayastha, and P. Solé, “Product construction of affine codes,” SIAM Journal on Discrete Mathematics, vol. 29, no. 3, pp. 1540–1552, 2015. [PDF]
  30. Y. M. Chee, C. J. Colbourn, A. C. H. Ling, H. Zhang, and X. Zhang, “Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses,” Designs, Codes and Cryptography, vol. 77, no. 2, pp. 479–491, 2015. [PDF]
  31. Y. M. Chee, G. Ge, H. Zhang, and X. Zhang, “Hanani triple packings and optimal q-ary codes of constant weight three,” Designs, Codes and Cryptography, vol. 75, no. 3, pp. 387–403, 2015. [PDF]
  32. Y. M. Chee, H. M. Kiah, A. C. H. Ling, and C. Wang, “Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications,” Journal of Combinatorial Designs, vol. 23, no. 4, pp. 151–182, 2015. [PDF]
  33. Y. M. Chee, H. M. Kiah, H. Zhang, and X. Zhang, “Optimal codes in the Enomoto-Katona space,” Combinatorics, Probability and Computing, vol. 24, no. 2, pp. 382–406, 2015. [PDF]
  34. Y. M. Chee, H. Zhang, and X. Zhang, “Complexity of dependencies in bounded domains, Armstrong codes, and generalizations,” IEEE Transactions on Information Theory, vol. 61, no. 2, pp. 812–819, 2015. [PDF]
  35. S. H. Dau and Y. M. Chee, “Polynomial time algorithm for min-ranks of graphs with simple tree structures,” Algorithmica, vol. 71, no. 1, pp. 152–180, 2015. [PDF]
  36. Y. M. Chee, Z. Cherif, J.-L. Danger, S. Guilley, H. M. Kiah, J.-L. Kim, P. Solé, and X. Zhang, “Multiply constant-weight codes and the reliability of loop physically unclonable functions,” IEEE Transactions on Information Theory, vol. 60, no. 11, pp. 7026–7034, 2014. [PDF]
  37. B. Liu, G. Cong, Y. Zeng, D. Xu, and Y. M. Chee, “Influence spreading path and its application to the time constrained social influence maximization problem and beyond,” IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 8, pp. 1904–1917, 2014. [PDF]
  38. C. Caliskan and Y. M. Chee, “New infinite families of 2-edge-balanced graphs,” Journal of Combinatorial Designs, vol. 22, no. 7, pp. 291–305, 2014. [PDF]
  39. S. H. Dau, V. Skachek, and Y. M. Chee, “Optimal index codes with near-extreme rates,” IEEE Transactions on Information Theory, vol. 60, no. 3, pp. 1515–1527, 2014. [PDF]
  40. Y. M. Chee, L. Ji, H. M. Kiah, C. Wang, and J. Yin, “Maximum distance separable codes for symbol-pair read channels,” IEEE Transactions on Information Theory, vol. 59, no. 11, pp. 7259—7267, 2013. [PDF]
  41. Y. M. Chee, C. J. Colbourn, D. Horsley, and J. Zhou, “Sequence covering arrays,” SIAM Journal on Discrete Mathematics, vol. 27, no. 4, pp. 1844— 1861, 2013. [PDF]
  42. Y. M. Chee, H. M. Kiah, P. Purkayastha, and C. Wang, “Importance of symbol equity in coded modulation for power line communications,” IEEE Transactions on Communications, vol. 61, no. 10, pp. 4381—4390, 2013. [PDF]
  43. Y. M. Chee, S. Ling, H. Wang, and L. F. Zhang, “Upper bounds on matching families in Z_{pq}^n,” IEEE Transactions on Information Theory, vol. 59, no. 8, pp. 5131—5139, 2013. [PDF]
  44. Y. M. Chee, H. M. Kiah, P. Purkayastha, and C. Wang, “Cross-bifix-free codes within a constant factor of optimality,” IEEE Transactions on Information Theory, vol. 59, no. 7, pp. 4668—4674, 2013. [PDF]
  45. Y. M. Chee, H. M. Kiah, and C. Wang, “Generalized balanced tournament designs with block size four,” Electronic Journal of Combinatorics, vol. 20, no. 2, p. P51, 2013. [PDF]
  46. Y. M. Chee, C. J. Colbourn, A. C. H. Ling, and R. M. Wilson, “Covering and packing for pairs,” Journal of Combinatorial Theory, Series A, vol. 120, no. 7, pp. 1440–1449, 2013. [PDF]
  47. S. H. Dau, V. Skachek, and Y. M. Chee, “Error correction for index coding with side information,” IEEE Transactions on Information Theory, vol. 59, no. 3, pp. 1517–1531, 2013. [PDF]
  48. Y. M. Chee, T. Feng, S. Ling, H. Wang, and L. F. Zhang, “Query-efficient locally decodable codes of subexponential length,” Computational Complexity, vol. 22, no. 1, pp. 159–189, 2013. [PDF]
  49. Y. M. Chee, H. M. Kiah, and P. Purkayastha, “Estimates on the size of symbol weight codes,” IEEE Transactions on Information Theory, vol. 59, no. 1, pp. 301–314, 2013. [PDF]
  50. Y. M. Chee and X. Zhang, “Improved constructions for frameproof codes,” IEEE Transactions on Information Theory, vol. 58, no. 8, pp. 5449–5453, 2012. [PDF]
  51. S. H. Dau, V. Skachek, and Y. M. Chee, “On the security of index coding with side information,” IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3975–3988, 2012. [PDF]
  52. A. Beimel, Y. M. Chee, H. Wang, and L. F. Zhang, “Communication-efficient distributed oblivious transfer,” Journal of Computer and System Sciences, vol. 78, no. 4, pp. 1142–1157, 2012. [PDF]
  53. Y. M. Chee, H. Wang, and L. F. Zhang, “On the Bringer-Chabanne EPIR protocol for polynomial evaluation,” Journal of Mathematical Cryptology, vol. 5, no. 3–4, pp. 277–301, 2012. [PDF]
  54. Z. Zhang, Y. M. Chee, S. Ling, M. Liu, and H. Wang, “Threshold changeable secret sharing schemes revisted,” Theoretical Computer Science, vol. 418, pp. 106–115, 2012. [PDF]
  55. Y. M. Chee, L. Ji, A. Lim, and A. K. H. Tung, “Arboricity: an acyclic hypergraph decomposition problem motivated by database theory,” Discrete Applied Mathematics, vol. 160, no. 1–2, pp. 100–107, 2012. [PDF]
  56. Y. M. Chee, S. Ling, Y. Tan, and X. Zhang, “Universal cycles for minimum coverings of pairs by triples, with applications to 2-radius sequences,” Mathematics of Computation, vol. 81, no. 277, pp. 585–603, 2012. [PDF]
  57. Y. M. Chee, G. Ge, L. Ji, S. Ling, and J. Yin, “List decodability at small radii,” Designs, Codes and Cryptography, vol. 61, no. 2, pp. 151–166, 2011. [PDF]
  58. J.-C. Bermond, Y. M. Chee, N. Cohen, and X. Zhang, “The α-arboricity of complete uniform hypergraphs,” SIAM Journal on Discrete Mathematics, vol. 25, no. 2, pp. 600–610, 2011. [PDF]
  59. Y. M. Chee, Y. Tan, and X. D. Zhang, “Strongly regular graphs constructed from p-ary bent functions,” Journal of Algebraic Combinatorics, vol. 34, no. 2, pp. 251–266, 2011. [PDF]
  60. Y. Chang, Y. M. Chee, and J. Zhou, “A pair of disjoint 3-GDDs of type g^t u^1,” Designs, Codes and Cryptography, vol. 60, no. 1, pp. 37–62, 2011. [PDF]
  61. Y. M. Chee, X. Zhang, and H. Zhang, “Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order,” Advances in Mathematics of Communications, vol. 5, no. 1, pp. 59–68, 2011. [PDF]
  62. Y. M. Chee, A. C. H. Ling, and J. Yin, “Optimal partitioned cyclic packings for frequency hopping and code synchronization,” IEEE Transactions on Information Theory, vol. 56, no. 11, pp. 5738–5746, 2010. [PDF]
  63. Y. M. Chee, C. Xing, and S. L. Yeo, “New constant-weight codes from propagation rules,” IEEE Transactions on Information Theory., vol. 56, no. 4, pp. 1596–1599, 2010. [PDF]
  64. Y. M. Chee, G. Ge, and A. C. H. Ling, “Spectrum of sizes for perfect deletion-correcting codes,” SIAM Journal on Discrete Mathematics, vol. 24, no. 1, pp. 33–55, 2010. [PDF]
  65. Y. M. Chee, S. H. Dau, A. C. H. Ling, and S. Ling, “Linear size optimal q-ary constant-weight codes and constant-composition codes,” IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 140–151, 2010. [PDF]
  66. Y. M. Chee and A. C. H. Ling, “Limit on the addressability of fault-tolerant nanowire decoders,” IEEE Transactions on Computing, vol. 58, no. 1, pp. 60–68, 2009. [PDF]
  67. Y. M. Chee, G. Ge, and A. C. H. Ling, “Group divisible codes and their application in the construction of optimal constant-composition codes of weight three,” IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3552–3564, 2008. [PDF]
  68. Y. M. Chee, A. C. H. Ling, and H. Shen, “The fine intersection problem for Steiner triple systems,” Graphs and Combinatorics, vol. 24, no. 3, pp. 149–157, 2008. [PDF]
  69. Y. M. Chee, S. H. Dau, A. C. H. Ling, and S. Ling, “The sizes of optimal q-ary codes of weight three and distance four: a complete solution,” IEEE Transactions on Information Theory, vol. 54, no. 3, pp. 1291–1295, 2008. [PDF]
  70. Y. M. Chee and S. Ling, “Improved lower bounds for constant GC-content DNA codes,” IEEE Transactions on Information Theory, vol. 54, no. 1, pp. 391–394, 2008. [PDF]
  71. Y. M. Chee and P. Kaski, “An enumeration of graphical designs,” Journal of Combinatorial Designs, vol. 16, no. 1, pp. 70–85, 2008. [PDF]
  72. Y. M. Chee and A. C. H. Ling, “On extremal k-graphs without repeated copies of 2-intersecting edges,” SIAM Journal on Discrete Mathematics, vol. 21, no. 3, pp. 805–821, 2007. [PDF]
  73. Y. M. Chee, A. C. H. Ling, S. Ling, and H. Shen, “The PBD-closure of constant-composition codes,” IEEE Transactions on Information Theory, vol. 53, no. 8, pp. 2685–2692, 2007. [PDF]
  74. Y. M. Chee, “A new lower bound for A(17,6,6),” Ars Combinatoria, vol. 83, pp. 361–363, 2007. [PDF]
  75. Y. M. Chee and S. Ling, “Constructions for q-ary constant-weight codes,” IEEE Transactions on Information Theory, vol. 53, no. 1, pp. 135–146, 2007. [PDF]
  76. Y. M. Chee, “Steiner triple systems intersecting in pairwise disjoint blocks,” Electronic Journal of Combinatorics, vol. 11, no. 1, pp. Research Paper 27, 17 pp. (electronic), 2004. [PDF]
  77. H. K. Aw, Y. M. Chee, and A. C. H. Ling, “Six new constant weight binary codes,” Ars Combinatoria, vol. 67, pp. 313–318, 2003. [PDF]
  78. Y. M. Chee and A. C. H. Ling, “Uniform group divisible designs with block sizes three and n,” Graphs and Combinatorics, vol. 18, no. 3, pp. 421– 445, 2002. [PDF]
  79. Y. M. Chee and S. Ling, “Highly symmetric expanders,” Finite Fields and Their Applications, vol. 8, no. 3, pp. 294–310, 2002. [PDF]
  80. Y. M. Chee, “An improved finiteness theorem for graphical t-designs,” Discrete Mathematics, vol. 237, no. 1-3, pp. 185–186, 2001. [PDF]
  81. Y. M. Chee, C. J. Colbourn, and A. C. H. Ling, “Asymptotically optimal erasure-resilient codes for large disk arrays,” Discrete Applied Mathematics, vol. 102, no. 1-2, pp. 3–36, 2000. [PDF]
  82. Y. M. Chee and S. Ling, “Combinatorial coverings from geometries over principal ideal rings,” Journal of Combinatorial Designs, vol. 7, no. 4, pp. 247– 268, 1999. [PDF]
  83. Y. M. Chee and S. S. Magliveras, “A few more large sets of t-designs,” Journal of Combinatorial Designs, vol. 6, no. 4, pp. 293–308, 1998. [PDF]
  84. Y. M. Chee, C. J. Colbourn, and A. C. H. Ling, “Weakly union-free twofold triple systems,” Annals of Combinatorics, vol. 1, no. 3, pp. 215–225, 1997. [PDF]
  85. Y. M. Chee and C. J. Colbourn, “Constructions for difference triangle sets,” IEEE Transactions on Information Theory, vol. 43, no. 4, pp. 1346–1349, 1997. [PDF]
  86. 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, vol. 23, pp. 121–127, 1997. [PDF]
  87. A. Lim and Y.-M. Chee, “On the link upgrade problem for trees,” Journal of Combinatorics, Information & System Sciences, vol. 21, no. 1, pp. 5–14, 1996.
  88. A. Lim, Y.-M. Chee, and W. Hsu, “Upgrading links for performance,” Informatica (Vilnius), vol. 7, no. 4, pp. 455–468, 1996. [PDF]
  89. Y. M. Chee, “Some simple three-designs of small order,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 16, pp. 163–164, 1994.
  90. A. Lim, Y. M. Chee, and S. W. Cheng, “Single jog minimum area joining of compacted cells,” Information Processing Letters, vol. 47, no. 4, pp. 167–172, 1993. [PDF]
  91. Y. M. Chee, “The existence of a simple 3-(28,5,30) design,” Discrete Mathematics, vol. 118, no. 1-3, pp. 251–252, 1993. [PDF]
  92. Y. M. Chee and D. L. Kreher, “4-(21,5,λ) designs from a group of order 171,” Ars Combinatoria, vol. 36, pp. 199–205, 1993.
  93. Y. M. Chee and S. Ling, “Projective covering designs,” Bulletin of the London Mathematical Society, vol. 25, no. 3, pp. 231–239, 1993. [PDF]
  94. Y. M. Chee, “On graphical quintuple systems,” Journal of Symbolic Computation, vol. 13, no. 6, pp. 677–681, 1992. [PDF]
  95. Y. M. Chee and A. Lim, “The algorithmic complexity of colour switching,” Information Processing Letters, vol. 43, no. 2, pp. 63–68, 1992. [PDF]
  96. Y. M. Chee and T. T. Png, “Scan lines and Gouraud shading for triangles,” Bulletin of the Institute of Combinatorics and its Applications, vol. 4, pp. 111–112, 1992.
  97. Y. M. Chee and G. F. Royle, “Enumeration of small nonisomorphic 1-rotational twofold triple systems,” Mathematics of Computation, vol. 59, no. 200, pp. 609–612, 1992. [PDF]
  98. Y. M. Chee, “Graphical t-designs with block sizes three and four,” Discrete Mathematics, vol. 91, no. 2, pp. 201–206, 1991. [PDF]
  99. Y. M. Chee and G. F. Royle, “The 2-rotational Steiner triple systems of order 25,” Discrete Mathematics, vol. 97, no. 1-3, pp. 93–100, 1991. [PDF]
  100. Y. M. Chee, C. J. Colbourn, S. C. Furino, and D. L. Kreher, “Large sets of disjoint t-designs,” Australasian Journal of Combinatorics, vol. 2, pp. 111– 119, 1990. [PDF]
  101. Y. M. Chee, C. J. Colbourn, and D. L. Kreher, “Simple t-designs with v ≤ 30,” Ars Combinatoria, vol. 29, pp. 193–258, 1990. [PDF]
  102. 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, vol. 7, pp. 53–90, 1990. [PDF]
  103. Y. M. Chee and A. Lim, “Quadrilateral-free Steiner triple systems of orders 31 and 37,” Journal of Combinatorics, Information & System Sciences, vol. 14, no. 4, pp. 244–248, 1989. [PDF]

Research Publications

Refereed Conference Publications

  1. Y. M. Chee, T. L. Nguyen, and V. K. Vu, “Weight constrained run length limited gray codes,” in ISIT 2025 - Proceedings of the 2025 IEEE International Symposium on Information Theory, to appear (accepted April 2025).
  2. Y. M. Chee, T. Etzion, and H. Lao, “Hierarchy of pseudo-random array codes,” in ISIT 2025 - Proceedings of the 2025 IEEE International Symposium on Information Theory, to appear (accepted April 2025).
  3. Y. Huang, J. Tang, Q. Cong, R. T. B. Ma, L. Chen, and Y. M. Chee, “The last survivor of PoS pools: staker's dilemma,” in SIGMETRICS 2025 - Proceedings of the ACM on Measurement and Analysis of Computing Systems, pp. 160-162, 2025.
  4. Y. M. Chee, H. Lao, T. L. Nguyen, and V. K. Vu, “Window weight limited gray codes and robust positioning sequences,” in ISIT 2024 – Proceedings of the 2024 IEEE International Symposium on Information Theory, pp. 3166-3171, 2024.
  5. T. V. Bui, Y. M. Chee, and V. K. Vu, “Efficient designs for threshold group testing without gap,” in ISIT 2024 – Proceedings of the 2024 IEEE International Symposium on Information Theory, pp. 3005-3010, 2024.
  6. Y. M. Chee, S. H. Dau, T. Etzion, H. M. Kiah, Y. Luo, and W. Zhang, “Repairing with zero skip cost,“ in ISIT 2024 – Proceedings of the 2024 IEEE International Symposium on Information Theory, pp. 2134-2139, 2024.
  7. T. X. Dinh, B. T. Le, S. H. Dau, S. Boztas, S. Kruglik, H. M. Kiah, E. Viterbo, T. Etzion, and Y. M. Chee, “Repairing a single erasure in Reed-Solomon codes with side information,” in ISIT 2024 – Proceedings of the 2024 IEEE International Symposium on Information Theory, pp. 2122-2127, 2024.
  8. Y. M. Chee, Q. T. Le, and H. Ta, “On the asymptotic nonnegative rank of matrices and its applications in information theory,” in ISIT 2024 – Proceedings of the 2024 IEEE International Symposium on Information Theory, pp. 1955-1960, 2024.
  9. H. Lao, Y. M. Chee, H. Chen, and V. K. Vu, “New constructions for linear maximum sum-rank distance codes,” in ISIT 2024 – Proceedings of the 2024 IEEE International Symposium on Information Theory, pp. 1544-1549, 2024.
  10. Y. M. Chee, T. Etzion, H. Ta, and V. K. Vu, “On de Bruijn covering sequences and arrays,” in ISIT 2024 – Proceedings of the 2024 IEEE International Symposium on Information Theory, pp. 1343-1348, 2024.
  11. Y. M. Chee, T. Etzion, K. A. S. Immink, T. T. Nguyen, V. K. Vu, J. H. Weber, and E. Yaakobi, “Thermal-aware channel with multiple wires,” in ISIT 2024 – Proceedings of the 2024 IEEE International Symposium on Information Theory, pp. 1035-1040, 2024.
  12. Y. M. Chee, K. A. S. Immink, and V. K. Vu, “Coding scheme for noisy nanopore sequencing with backtracking and skipping errors,” in ISIT 2024 – Proceedings of the 2024 IEEE International Symposium on Information Theory, pp. 458-463.
  13. S. Wang, Y. M. Chee, and V. K. Vu, “Permutation codes in Levenshtein, Ulam and generalized Kendall-tau metrics,” in ISIT 2024 – Proceedings of the 2024 IEEE International Symposium on Information Theory, pp. 43-48, 2024.
  14. H. Pan, Q.-T. Ta, M. Zhang, Z. Zhao, Y. M. Chee, G. Chen, and B. C. Ooi, “FC: adative atomic commit via failure detection,“ in ICDE 2024 – Proceedings of the 40th IEEE International Conference on Data Enginnering, pp. 2026-2039, 2024.
  15. Z. Chen, P. N. Karthik, Y. M. Chee, and V. Y. F. Tan, “Fixed-budget differentially private best arm identification,“ in ICLR 2024 – Proceedings of the Twelfth International Conference on Learning Representations, poster, 2024.
  16. X. Li, J. Lu, H. Ding, C. Sun, J. T. Zhou, and Y. M. Chee, “PointCVaR: risk-optimised outlier removal for robust 3D point cloud classifcation,“ in AAAI 2024 – Proceedings of the 38th Annual AAAI Conference on Artificial Intelligence, article no. 2381, pp. 21340-21348, 2024.
  17. Y. Ma, Z. Cao, and Y. M. Chee, “Learning to search feasible and infeasible regions of routing problems with flexible neural k-opt,“ in NeurIPS 2023 – Proceedings of the 37th Conference on Neural Information Processing Systems, 2023.
  18. Y. M. Chee, T. Etzion, K. A. S. Immink, T. T. Nguyen, V. K. Vu, and J. H. Weber, “Thermal-aware channel capacity,” in ISIT 2023 – Proceedings of the 2023 IEEE International Symposium on Information Theory, pp. 2661-2666, 2023.
  19. Y. M. Chee, T. L. Nguyen, V. D. Tran, and V. K. Vu, “Maximal length constrained de Bruijn sequences,” in ISIT 2023 – Proceedings of the 2023 IEEE International Symposium on Information Theory, pp. 684-689.
  20. J. Bi, Y. Ma, J. Wang, Z. Cao, J. Chen, Y. Sun, and Y. M. Chee, “Learning generalizable models for vehicle routing problems via knowledge distillation,” in NeurIPS 2022 – Proceedings of the 36th Conference on Neural Information Processing Systems, 2022.
  21. Q. Cong, J. Tang, K. Han, Y. Huang, L. Chen, and Y. M. Chee,“Noisy interactive graph search,” in KDD 2022 – Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 231–240, 2022.
  22. Y. M. Chee, N. H. Le, and V. K. Vu, “Robust locally positioning sequences and codes: capacity, constructions and applications,” in ISIT 2022 – Proceedings of the 2022 IEEE International Symposium on Information Theory, pp. 516–521, 2022.
  23. T. T. Nguyen, K. Cai, H. M. Kiah, K. A. S. Immink, and Y. M. Chee, “Using one redundant bit to construct two-dimensional almost-balanced codes,” in ISIT 2022 – Proceedings of the 202 IEEE International Symposium on Information Theory, pp. 3091–3096, 2022.
  24. Y. M. Chee, D. T. Dao, T. L. Nguyen, H. Ta, and V. K. Vu, “Run length limited de Bruijn sequences for quantum communications,” in ISIT 2022 – Proceedings of the 202 IEEE International Symposium on Information Theory, pp. 264–269, 2022.
  25. T. V. Bui, Y. M. Chee, J. Scarlett, and V. K. Vu, “Group testing with blocks of positives,” in ISIT 2022 – Proceedings of the 202 IEEE International Symposium on Information Theory, pp. 1082–1087, 2022.
  26. Y. Ma, J. Li, Z. Cao, W. Song, H. Guo, Y. Gong, and Y. M. Chee, “Efficient neural neighborhood search for pickup and delivery problems,” in IJCAI 2022: Proceedings of the 31st International Joint Conference on Artificial Intelligence, pp. 4776–4784, 2022.
  27. T. T. Nguyen, K. Cai, K. A. S. Immink, and Y. M. Chee, “Linear-time encoders for two-dimensional bounded-weight constrained codes,” in NVMW 2022 – Proceedings of the 13th Annual Non-Volatile Memories Workshop, 2022.
  28. X. Li, H. Ding, Z. Tong, Y. Wu, and Y. M. Chee, “Primitive3D: 3D object dataset synthesis from randomly assembled primitives,” in CVPR 2022 – Proceedngs of the 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 15947–15957, 2022.
  29. Y. Wu, T. T. A. Dinh, G. Hu, M. Zhang, Y. M. Chee, and B. C. Ooi, “Serverless data science — are we there yet? A case study of model serving,” in SIGMOD 2022– Proceedings of the 2022 ACM Special Interest Group in Management of Data, pp. 1866–1875, 2022.
  30. Q. Cong, J. Tang, Y. Huang, L. Chen, and Y. M. Chee, “Cost-effective algorithms for average-case interactive graph search,” in ICDE 2022 – Proceedings of the 2022 IEEE International Conference on Data Engineering, pp. 1152–1165, 2022.
  31. Y. M. Chee, D. T. Dao, T. Etzion, H. M. Kiah, and H. Zhang, “Regular multiset combinatorial batch codes over vector spaces,” in ISIT 2021 – Proceedings of the 2021 IEEE International Symposium on Information Theory, pp. 3133–3138, 2021.
  32. T. T. Nguyen, K. Cai, K. A. S. Immink, and Y. M. Chee, “Efficient design of capacity-approaching two-dimensional weight-constrained codes,” in ISIT 2021 – Proceedings of the 2021 IEEE International Symposium on Information Theory, pp. 2930–2935, 2021.
  33. Y. M. Chee, A. Vardy, V. K. Vu, and E. Yaakobi, “Coding for transverse-reads in domain wall memories,” in ISIT 2021 – Proceedings of the 2021 IEEE Internation
  34. Y. M. Chee, M. Hagiwara, and V. K. Vu, “Two dimensional deletion correcting codes and their applications,” in ISIT 2021 – Proceedings of the 2021 IEEE International Symposium on Information Theory, pp. 2792–2797, 2021.
  35. Y. M. Chee, J. Chrisnata, T. Etzion, and H. M. Kiah, “Efficient algorithm for the linear complexity of sequences and some related consequences,” in ISIT 2020 – Proceedings of the 2020 IEEE International Symposium on Information Theory, pp. 2897–2902, 2020.
  36. Y. M. Chee and V. K. Vu, “Codes correcting synchronization errors for symbol-pair read channels,” in ISIT 2020 – Proceedings of the 2020 IEEE International Symposium on Information Theory, pp. 746–750, 2020.
  37. Y. M. Chee, C. J. Colbourn, S. H. Dau, R. Gabrys, A. C. H. Ling, D. Lusi, and O. Milenkovic, “Access balancing in storage systems by labeling partial Steiner systems,” in ISIT 2020 – Proceedings of the 2020 IEEE International Symposium on Information Theory, pp. 566–570, 2020.
  38. Y. M. Chee, T. Etzion, H. M. Kiah, and H. Zhang, “Recovery sets for subspaces from a vector space,” in ISIT 2020 – Proceedings of the 2020 IEEE International Symposium on Information Theory, pp. 542–547, 2020.
  39. Y. M. Chee, M. Horovitz, A. Vardy, V. K. Vu, and E. Yaakobi, “Endurance-limited memories with informed decoder,” in ITW 2019 – Proceedings of the 2019 IEEE Information Theory Workshop, Visby, Gotland, Sweden, pp. 1–5, 2019.
  40. Y. M. Chee, T. Etzion, H. M. Kiah, V. K. Vu, and E. Yaakobi, “Constrained de Bruijn codes and their applications,” in ISIT 2019 – Proceedings of the 2019 IEEE International Symposium on Information Theory, pp. 2369–2373, 2019.
  41. Y. M. Chee, H. M. Kiah, and H. Zhang, “Lower bounds for total storage of multiset combinatorial batch codes using linear programming,” in ISIT 2019 – Proceedings of the 2019 IEEE International Symposium on Information Theory, pp. 2364–2368, 2019.
  42. Y. M. Chee, H. M. Kiah, A. J. Han Vinck, V. K. Vu, and E. Yaakobi, “Coding for write l-step-up memories,” in ISIT 2019 – Proceedings of the 2019 IEEE International Symposium on Information Theory, pp. 1597–1601, 2019.
  43. Y. M. Chee, H. M. Kiah, E. Yaakobi, and H. Zhang, “A generalization of the Blackburn-Etzion construction for private information retrieval array codes,” in ISIT 2019 – Proceedings of the 2019 IEEE International Symposium on Information Theory, pp. 1062–1066, 2019.
  44. Y. M. Chee, H. M. Kiah, and T. T. Nguyen, “Linear-time encoders for codes correcting a single edit for DNA-based data storage,” in ISIT 2019 – Proceedings of the 2019 IEEE International Symposium on Information Theory, pp. 772–776, 2019.
  45. Y. M. Chee, H. M. Kiah, and H. Wei, “Efficient and explicit balanced primer codes,” in ISIT 2019 – Proceedings of the 2019 IEEE International Symposium on Information Theory, pp. 91–95, 2019.
  46. Y. M. Chee, H. M. Kiah, A. Vardy, V. K. Vu, and E. Yaakobi, “Codes correcting under- and over-shift errors in racetrack memories,” in NVMW 2019 – Proceedings of the 10th Annual Non-Volatile Memories Workshop, 2019.
  47. Y. M. Chee, J. Chrisnata, H. M. Kiah, and T. T. Nguyen, “Linear-time encoding/decoding of irreducible words for codes correcting tandem duplications,” in NVMW 2019 – Proceedings of the 10th Annual Non-Volatile Memories Workshop, 2019. [Memorable Paper Award Finalist].
  48. Y. M. Chee, D. T. Dao, H. M. Kiah, S. Ling, and H. Wei, “Binary robust positioning patterns with low redundancy and efficient locating algorithms,” in SODA 2019 – Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2171–2184, 2019.
  49. Y. M. Chee, R. Gabrys, A. Vardy, V. K. Vu, and E. Yaakobi, “Reconstruction from deletions in racetrack memories,” in ITW 2018 – Proceedings of the 2018 IEEE Information Theory Workshop, Guangzhou, pp. 215–219, 2018.
  50. Y. M. Chee, M. Horovitz, A. Vardy, V. K. Vu, and E. Yaakobi, “Codes for endurance-limited memories,” in ISITA 2018 – Proceedings of the 2018 International Symposium on Information Theory and its Applications, pp. 501–505, 2018.
  51. Y. M. Chee, J. Chrisnata, H. M. Kiah, and T. T. Nguyen, “Efficient encoding/decoding of irreducible words for codes correcting tandem duplications,” in ISIT 2018 – Proceedings of the 2018 IEEE International Symposium on Information Theory, pp. 2406–2410, 2018.
  52. Y. M. Chee, T. Etzion, H. M. Kiah, A. Vardy, and H. Wei, “Low-power cooling codes with efficient encoding and decoding,” in ISIT 2018 – Proceedings of the 2018 IEEE International Symposium on Information Theory, pp. 1655–1659, 2018.
  53. Y. M. Chee, H. M. Kiah, A. Vardy, V. K. Vu, and E. Yaakobi, “Codes correcting limited-shift errors in racetrack memories,” in ISIT 2018 – Proceedings of the 2018 IEEE International Symposium on Information Theory, pp. 96–100, 2018.
  54. S. Feng, G. Cong, A. Khan, X. Li, Y. Liu, and Y. M. Chee, “Inf2vec: Latent representation model for social influence embedding,” in ICDE 2018 – Proceedings of the 34th IEEE International Conference on Data Engineering, pp. 941–952, 2018.
  55. Y. M. Chee, H. M. Kiah, A. Vardy, V. K. Vu, and E. Yaakobi, “Codes correcting position errors in racetrack memories,” in ITW 2017 Kaohsiung – Proceedings of the 2017 IEEE Information Theory Workshop, Kaohsiung, pp. 161–165, 2017.
  56. Y. M. Chee, H. M. Kiah, A. Vardy, and E. Yaakobi, “Explicit constructions of finite-length WOM codes,” in ISIT 2017 – Proceedings of the 2017 IEEE International Symposium on Information Theory, pp. 2870–2874, 2017.
  57. Y. M. Chee, S. Ling, T. T. Nguyen, V. K. Vu, and H. Wei, “Permutation codes correcting a signle burst deletion II: stable deletions,” in ISIT 2017 – Proceedings of the 2017 IEEE International Symposium on Information Theory, pp. 2693–2697, 2017.
  58. Y. M. Chee, T. Etzion, H. M. Kiah, and A. Vardy, “Cooling codes: thermal management coding for high-performance interconnects,” in ISIT 2017 – Proceedings of the 2017 IEEE International Symposium on Information Theory, pp. 2013–2017, 2017.
  59. Y. M. Chee, H. M. Kiah, S. Ling, and H. Wei, “Geometric orthogonal codes better than optical orthogonal codes,” in ISIT 2017 – Proceedings of the 2017 IEEE International Symposium on Information Theory, pp. 1396–1400, 2017.
  60. Y. M. Chee, H. M. Kiah, A. Vardy, V. K. Vu, and E. Yaakobi, “Coding for racetrack memories,” in ISIT 2017 – Proceedings of the 2017 IEEE International Symposium on Information Theory, pp. 619–623, 2017.
  61. S. Feng, G. Cong, B. An, and Y. M. Chee, “POI2Vec: geographical latent representation for predicting future visitors,” in AAAI-17 – Proceedings of the 31st AAAI Conference on Artificial Intelligence, pp. 102–108, 2017.
  62. Y. M. Chee, H. M. Kiah, S. Ling, T. T. Nguyen, V. K. Vu, and X. Zhang, “String concatenation construction for Chebyshev permutation channel codes,” in ISIT 2016 – Proceedings of the 2016 IEEE International Symposium on Information Theory, pp. 2824– 2828, 2016.
  63. Y. M. Chee, J. Chrisnata, H. M. Kiah, S. Ling, T. T. Nguyen, and V. K. Vu, “Efficient encoding/decoding of capacity-achieving constant-composition ICI-free codes,” in ISIT 2016 – Proceedings of the 2016 IEEE International Symposium on Information Theory, pp. 205–209, 2016.
  64. Y. M. Chee, J. Chrisnata, H. M. Kiah, S. Ling, T. T. Nguyen, and V. K. Vu, “Rates of constant-compotition codes that mitigate intercell in-terference,” in ISIT 2016 – Proceedings of the 2016 IEEE International Symposium on Information Theory, pp. 200–204, 2016.
  65. S. Feng, T. Xu, Y. Zeng, G. Cong, Y. M. Chee, and Q. Yuan, “Personalized ranking metric embedding for next new POI recommendation,” in IJCAI 2015: Proceedings of the 2015 International Joint Conference on Artificial Intelligence, pp. 2069–2075, 2015.
  66. Y. M. Chee, Y. Li, and X. Zhang, “Spectrum of sizes for perfect burst deletion-correcting codes,” in ISIT 2015 – Proceedings of the 2015 IEEE International Symposium on Information Theory, pp. 1931– 1935, 2015.
  67. Y. M. Chee, V. K. Vu, and X. Zhang, “Permutation codes correcting a single burst deletion I: unstable deletions,” in ISIT 2015 – Proceedings of the 2015 IEEE International Symposium on Information Theory, pp. 1741–1745, 2015.
  68. Y. M. Chee, F. Gao, S. T. H. Teo, and H. Zhang, “Combinatorial systematic switch codes,” in ISIT 2015 – Proceedings of the 2015 IEEE International Symposium on Information Theory, pp. 241–245, 2015.
  69. S. Feng, X. Chen, G. Cong, Y. Zeng, Y. M. Chee, and Y. Xiang, “Influence maximization with novelty decay in social networks,” in AAAI-14 – Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 37–43, 2014.
  70. Y. M. Chee, L. Wu, and C. Xing, “Correcting on curves and highly sound locally correctable codes of high rate,” in ISIT 2014 – Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 2964–2966, 2014.
  71. Y. M. Chee and V. K. Vu, “Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics,” in ISIT 2014 – Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 2959–2963, 2014.
  72. Y. M. Chee, H. M. Kiah, and P. Purkayastha, “Rewritable coset coding for flash memories,” in ISIT 2014 – Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 2082– 2086, 2014.
  73. Y. M. Chee, H. M. Kiah, P. Purkayastha, and P. Solé, “Product construction of affine codes,” in ISIT 2014 – Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 1441– 1445, 2014.
  74. Y. M. Chee, F. Gao, H. M. Kiah, A. C. H. Ling, H. Zhang, and X. Zhang, “Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families,” in ISIT 2014 – Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 1436–1440, 2014.
  75. Y. M. Chee, H. M. Kiah, and P. Purkayastha, “Matrix codes and multitone frequency shift keying for power line communications,” in ISIT 2013 – Proceedings of the 2013 IEEE International Symposium on Information Theory, pp. 2870–2874, 2013.
  76. Y. M. Chee, H. Zhang, and X. Zhang, “Complexity of dependencies in bounded domains, Armstrong codes, and generalizations,” in ISIT 2013 – Proceedings of the 2013 IEEE International Symposium on Information Theory, pp. 499–503, 2013.
  77. Y. M. Chee, H. M. Kiah, H. Zhang, and X. Zhang, “Optimal codes in the Enomoto-Katona space,” in ISIT 2013 – Proceedings of the 2013 IEEE International Symposium on Information Theory, pp. 321–325, 2013.
  78. Y. M. Chee, H. M. Kiah, and C. Wang, “Maximum distance separable symbol-pair codes,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 2896–2900, 2012.
  79. S. H. Dau, V. Skachek, and Y. M. Chee, “Optimal index codes with near-extreme rates,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 2251–2255, 2012.
  80. Y. M. Chee, H. M. Kiah, A. C. H. Ling, and C. Wang, “Optimal equitable symbol weight codes for power line communications,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 671–675, 2012.
  81. Y. M. Chee, H. M. Kiah, P. Purkayastha, and C. Wang, “Importance of symbol equity in coded modulation for power line communications,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 666–670, 2012. [Student Paper Award Finalist (as advisor)]
  82. Y. M. Chee and P. Purkayastha, “Efficient decoding of permutation codes obtained from distance preserving maps,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 641–645, 2012.
  83. C. Bracken, Y. M. Chee, and P. Purkayastha, “Optimal family of q-ary codes obtained from a substructure of generated Hadamard matrices,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 116–119, 2012.
  84. Y. M. Chee, H. Wang, and L. F. Zhang, “Oblivious transfer and n-variate linear function evaluation,” in Computing and Combinatorics – Proceedings of the 17th Annual International Conference, COCOON 2011 (B. Fu and D.-Z. Du, eds.), vol. 6842 of Lecture Notes in Computer Science, pp. 627–637, Springer-Verlag, 2011.
  85. S. H. Dau, V. Skachek, and Y. M. Chee, “Index coding and error correction,” in ISIT 2011 – Proceedings of the 2011 IEEE International Symposium on Information Theory, pp. 1753–1757, 2011.
  86. S. H. Dau, V. Skachek, and Y. M. Chee, “On secure index coding with side information,” in ISIT 2011 – Proceedings of the 2011 IEEE International Symposium on Information Theory, pp. 1046–1050, 2011.
  87. Y. M. Chee, Y. Tan, and Y. Zhou, “Almost p-ary perfect sequences,” in SETA 2010 – Proceedings of the 6th Conference on Sequences and their Applications (C. Carlet and A. Pott, eds.), vol. 6338 of Lecture Notes in Comput. Sci., pp. 399–415, Springer-Verlag, 2010.
  88. D. Zhang, Y. M. Chee, A. Mondal, A. K. H. Tung, and M. Kitsuregawa, “Keyword search in spatial databases: towards searching by document,” in ICDE 2009 – Proceedings of the IEEE 25th International Conference on Data Engineering, pp. 688–699, IEEE Computer Society, 2009.
  89. Z. Zhang, M. Liu, Y. M. Chee, S. Ling, and H. Wang, “Strongly multiplicative and 3-multiplicative linear secret sharing schemes,” in Advances in Cryptology – ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology & Information Security, vol. 5350 of Lecture Notes in Computer Science, pp. 19– 36, Springer-Verlag, 2008.
  90. Y. M. Chee and C. J. Colbourn, “Scalable optimal test patterns for crosstalk-induced faults on deep submicron global interconnects,” in IWCC ’07: Proceedings of the First International Workshop on Coding and Cryptology (Y. Li, S. Ling, H. Niederreiter, H. Wang, C. Xing, and S. Zhang, eds.), vol. 4 of C
  91. Y. M. Chee, C. J. Colbourn, and A. C. H. Ling, “Optimal memoryless encoding for low power off-chip data buses,” in ICCAD ’06: Proceedings of the 2006 IEEE/ACM International Conference on Computer-Aided Design, pp. 369–374, ACM Press, 2006
  92. Y. M. Chee and S. Ling, “Algebraic constructions of Ramanujan graphs and highly symmetric expanders,” in Proceedings of the Second Asian Mathematical Conference 1995 (Nakhon Ratchasima), (River Edge, NJ), pp. 276–282, World Sci. Publishing, 1998.
  93. A. Lim, Y. M. Chee, and W. Hsu, “Upgrading links for guaranteed performance,” in Proceedings of the IEEE Singapore International Conference on Networks, pp. 398–402, 1995.
  94. 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, pp. 11–28, 1993.
  95. Y. M. Chee and A. Lim, “A complex approach to the security of statistical databases subject to off-line sum queries,” in IFIP/Sec ’92: Proceedings of the IFIP TC11, Eigth International Conference on Information Security (G. G. Gable and W. J. Caelli, eds.), vol. A-15 of IFIP Transactions, pp. 373–384, North-Holland, 1992.
  96. 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, pp. 35–41, 1992.
  97. Y. M. Chee, A. Joux, and J. Stern, “The cryptoanalysis of a new public-key cryptosystem based on modular knapsacks.,” in Advances in Cryptology – CRYPTO ’91, 11th Annual International Cryptology Conference (J. Feigenbaum, ed.), vol. 576 of Lecture Notes in Computer Science, pp. 204–212, Springer-Verlag, 1992
  98. 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, pp. 2144–2147, 1991.
  99. A. Lim and Y. M. Chee, “Graph partitioning using tabu search,” in Proceedings of the 24th IEEE International Symposium on Circuits and Systems, pp. 1164–1167, 1991.

My Lab

Members of the Chee Lab

Principal Investigator


Image

Yeow Meng Chee

Professor of Design and Engineering



Postdocs


Image

Van Khu Vu

Senior Research Fellow

Image

Thach Van Bui

Research Fellow

Image

Huimin Lao

Research Fellow

Image

Duy-Hoang Ta

Research Fellow



PhD Students


Image

Zhirui Chen

Image

Hexiang Pan

Image

Yabang Zhao



Former Postdocs

  1. Hui Zhang, 2019-2023.
  2. Tuan Thanh Nguyen, 2019. Current location: Research Fellow, Singapore University of Technology and Design
  3. Hengjia Wei, 2016–2019. Current location: Researcher, Peng Cheng Laboratory, China
  4. Yang Li, 2014–2015. Current location: Associate Professor, Soochow University, China
  5. Fei Gao, 2013–2015. Current location: Senior Scientist and Group Manager, Institute for High Performance Computing, A*STAR
  6. Xiande Zhang, 2009–2011, 2012–2016. Current location: Associate Professor, University of Science and Technology, China
  7. Cafer Caliskan, 2012–2013. Current location: Professor, Antalya Bilim University, Turkey
  8. Son Hoang Dau, 2012. Current location: Lecturer, Computer Science and Information Technology, School of Science, RMIT University, Australia
  9. Liang Feng Zhang, 2012. Current location: Assistant Professor, ShanghaiTech University
  10. Chengmin Wang, 2011–2012. Current location: Associate Professor, Department of Mathematics, Taizhou University, China
  11. Carl Bracken, 2010–2011
  12. Purkayastha Punarbasu, 2010–2014. Current location: Senior Software Project Leader, CGG, United Kingdoms
  13. Vitaly Skachek, 2009–2010. Current location: Associate Professor, Institute of Computer Science, University of Tartu
  14. Yin Tan, 2009–2010. Current location: Research Associate, Department of Electrical and Computer Engineering, University of Waterloo
  15. Peng Gao, 2009–2010. Current location: Professor, Beihang University


Former PhD Students

  1. Yining Ma, PhD 2024 (Industrial Systems Engineering and Management, National University of Singapore). Thesis title: Learning-to-Search Approaches for Vehicle Routing Problems using Deep Reinforcement Learning. CUrrent location: Researcher, Nanyang Technological University
  2. Xinke Li, PhD 2023 (Industrial Systems Engineering and Management, National University of Singapore). Thesis title: Towards Dataset Construction for 3D Understanding. Current location: Research Fellow, National University of Singapore
  3. Qianhao Cong, PhD 2023 (Industrial Systems Engineering and Management, National University of Singapore). Thesis title: Interactive Graph Search: Algorithms and Analyses. Current location: Blockchain Researcher, Matrixport
  4. Jingyi Zhao, Ph.D. 2023 (Industrial Systems Engineering and Management, National University of Singapore). Thesis title: Time-dependent Vehicle Routing Problems under Various Conditions and Constraints. Current location: Postdoctoral Researcher, Polytechnique Montreal
  5. Yuming Huang, PhD 2023 (Industrial Systems Engineering and Management, National University of Singapore). Thesis title: Fairness and Security on Blockchain Incentives
  6. Zekun Tong, Ph.D. 2023 (Industrial Systems Engineering and Management, National University of Singapore). Thesis title: Deep Learning on Graph-structured Data. Current location: Quantitative Researcher, company undisclosed
  7. Jingwen Li, Ph.D. 2022 (Industrial Systems Engineering and Management, National University of Singapore). Thesis title: Deep Reinforcement Learning for Solving Vehicle Routing Problems. Current location: Researcher, College of Computer Science, Sichuan Normal University
  8. Tuan Thanh Nguyen, Ph.D. 2018 (Mathematical Sciences, Nanyang Technological University). Thesis title: Codes Correcting Bursts of Deletions/Insertions and Tandem Duplications. Current location: Researcher, Singapore University of Technology and Design
  9. Van Khu Vu, Ph.D. 2018 (Mathematical Sciences, Nanyang Technological University). Thesis title: Coding Techniques for Flash Memories. Current location: Research Fellow, Department of Industrial Systems Engineering and Management, National University of Singapore
  10. Shanshan Feng, Ph.D. 2017 (Interdisciplinary Graduate School, Nanyang Technological University, co-supervised with Gao Cong). Thesis title: Latent Representation Models for User Sequential Mobility and Social Influence Propagation. Current location: Associate Professor, Harbin Institute of Technology, Shenzhen
  11. Liyasi Wu, Ph.D. 2017 (Mathematical Sciences, Nanyang Technological University, co-supervised with Chaoping Xing). Thesis title: Local Correction of Codes of High Rate
  12. Han Mao Kiah, Ph.D. 2014 (Mathematical Sciences, Nanyang Technological University). Thesis title: Reliable Communications over Power Lines through Coded Modulation Schemes. Current location: Assistant Professor, School of Physical and Mathematical Sciences, Nanyang Technological University
  13. Xinli Wang, Ph.D. 2012 (Mathematical Sciences, Nanyang Technological University, co-supervised with Sinai Robins). Thesis title: Discrete-Geometric Functions associated to Polyhedral Cones and Point Sets. Current location: Instructor, Department of Mathematics, University of Manitoba
  14. Son Hoang Dau, Ph.D. 2012 (Mathematical Sciences, Nanyang Technological University, co-supervised with San Ling). Thesis title: On Index Coding with Side Information. Current location: Lecturer, Computer Science and Information Technology, School of Science, RMIT University, Australia
  15. Liang Feng Zhang, Ph.D. 2012 (Mathematical Sciences, Nanyang Technological University, co-supervised with Huaxiong Wang). Thesis title: A Study of Private Information Retrieval and Related Primitives. Current location: Associate Professor, School of Information Science and Technology, ShanghaiTech University

Yeow Meng Chee

National University of Singapore
21 Lower Kent Ridge, Singapore 119077

+65 6516 1445

ymchee@nus.edu.sg

© Yeow Meng Chee, All Right Reserved | Designed By HTML Codex