A Campus-Wide University Examination Timetabling Application. - Andrew Lim 001; Ang Juay Chin; Wee-Kit Ho; Wee-Chong Oon (AAAI/IAAI, 2000)

A New Algorithm for Page Access Sequencing in Join Processing. - Andrew Lim 001; Wee-Chong Oon; Chi-Hung Chi (ADBIS-DASFAA, 2000)

Page Access Sequencing in Join Processing with Limited Buffer Space. - Chen Qun; Andrew Lim 001; Wee-Chong Oon (DEXA, 2001)

Maximizing Paper Spread in Examination Timetabling Using a Vehicle Routing Method. - Wee-Kit Ho; Andrew Lim 001; Wee-Chong Oon (ICTAI, 2001)

Page access scheduling in join processing. - Andrew Lim 001; Jennifer Lai-Pheng Kwan; Wee-Chong Oon (Data Knowl. Eng., 2001)

UTTSExam: A Campus-Wide University Exam-Timetabling System. - Andrew Lim 001; Juay Chin Ang; Wee-Kit Ho; Wee-Chong Oon (AAAI/IAAI, 2002)

UTTSExam: A University Examination Timetable Scheduler. - Andrew Lim 001; Juay Chin Ang; Wee-Kit Ho; Wee-Chong Oon (AAAI/IAAI, 2002)

Multi-Player Game Approach to Solving Multi-Entity Problems. - Wee-Chong Oon; Andrew Lim 001 (AAAI/IAAI, 2002)

Multi-Player Game Approach to Scheduling Problems. - Wee-Chong Oon; Andrew Lim 001 (ISPAN, 2002)

Practice Abstracts. - Donald L. Keefer; Javier Faulin; Alberto Bayo; Andrew Lim 001; Juay Chin Ang; Wee-Kit Ho; Wee-Chong Oon (Interfaces, 2002)

A matching-based algorithm for page access sequencing in join processing. - Andrew Lim 001; Wee-Chong Oon; Chi-Hung Chi (J. Syst. Softw., 2002)

An investigation on piece differential information in co-evolution on games using Kalah. - Wee-Chong Oon; Yew Jin Lim (IEEE Congress on Evolutionary Computation, 2003)

Towards definitive benchmarking of algorithm performance. - Andrew Lim 001; Wee-Chong Oon; Wenbin Zhu (ECIS, 2003)

On automated grading of programming assignments in an academic institution. - Brenda Cheang; Andy Kurnia; Andrew Lim 001; Wee-Chong Oon (Comput. Educ., 2003)

M2ICAL Analyses HC-Gammon. - Wee-Chong Oon; Martin Henz (AAAI, 2007)

M2ICAL: A Tool for Analyzing Imperfect Comparison Algorithms. - Wee-Chong Oon; Martin Henz (ICTAI (1), 2007)

The Tree Representation of Feasible Solutions for the TSP with Pickup and Delivery and LIFO Loading. - Dejian Tu; Songshan Guo; Hu Qin; Wee-Chong Oon; Andrew Lim 001 (AAAI, 2010)

An Algorithm for the Freight Allocation Problem with All-Units Quantity-Based Discount. - Xiang Gao; Andrew Lim 001; Wee-Chong Oon; Hu Qin (IEA/AIE (2), 2011)

Optimal Algorithms for Two-Dimensional Box Placement Problems. - Wenbin Zhu; Wee-Chong Oon; Yujian Weng; Andrew Lim 001 (IEA/AIE (2), 2011)

Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems. - Zhaoyi Zhang; Songshan Guo; Wenbin Zhu; Wee-Chong Oon; Andrew Lim 001 (IJCAI, 2011)

The tree representation for the pickup and delivery traveling salesman problem with LIFO loading. - Yongquan Li; Andrew Lim 001; Wee-Chong Oon; Hu Qin; Dejian Tu (Eur. J. Oper. Res., 2011)

A skyline heuristic for the 2D rectangular packing and strip packing problems. - Lijun Wei; Wee-Chong Oon; Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2011)

Ricochet Robots is Solved. - Yibo Chen; Wee-Chong Oon; Wenbin Zhu (J. Int. Comput. Games Assoc., 2011)

The six elements to block-building approaches for the single container loading problem. - Wenbin Zhu; Wee-Chong Oon; Andrew Lim 001; Yujian Weng (Appl. Intell., 2012)

A reference length approach for the 3D strip packing problem. - Lijun Wei; Wee-Chong Oon; Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2012)

Space defragmentation for packing problems. - Wenbin Zhu; Zhaoyi Zhang; Wee-Chong Oon; Andrew Lim 001 (Eur. J. Oper. Res., 2012)

A goal-driven approach to the 2D bin packing and variable-sized bin packing problems. - Lijun Wei; Wee-Chong Oon; Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2013)

A fast implementation for the 2D/3D box placement problem. - Wenbin Zhu; Zhixing Luo; Andrew Lim 001; Wee-Chong Oon (Comput. Optim. Appl., 2016)