1. Abdullah, S., & Jaddi, N. S. (2010). Great deluge algorithm for rough set attribute reduction. In Y. Zhang, A. Cuzzocrea, J. Ma, K. -I. Chung, T. Arslan, & X. Song (Eds.), Communications in computer and information science, 1. Database theory and application, bio-science and bio-technology (Vol. 118, pp. 189–197). Berlin Heidelberg New York: Springer. ISBN: 978-3-642-17621-0.
2. Abdullah, S., Burke, E. K., McCollum, B. (2005). An investigation of variable neighbourhood search for the course timetabling problem. In The 2nd multidisciplinary international conference on scheduling: Theory and applications (MISTA) (pp. 413–427). New York, July 18–21, 2005.
3. Abdullah, S., Burke, E. K., & McCollum, B. (2007). Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem. In K. F. Doerner, M. Gendreau, P. Greistorfer, W. J. Gutjahr, R. F. Hartl, & M. Reimann (Eds.), Metaheuristics – Progress in complex systems optimization. Computer Science Interfaces Book Series (Vol. 39, pp. 153–169). Springer Operations Research. ISBN-13:978-0-387-71919-1
4. A constructive hyper-heuristics for rough set attribute reduction;Abdullah;ISDA,2010
5. Selection bias in gene extraction on the basis of microarray gene-expression data;Ambroise;Proceedings of the National Academy of Sciences,2002