1. Adriaen, M., De Causmaecker, P., Demeester, P., & Vanden Berghe, G. (2006). Tackling the university timetabling problem with an aggregation approach. In E. K. Burke & H. Rudová (Eds.), Practice and theory of automated timetabling VI (PATAT 2006) (pp. 330–335). New York: Springer.
2. Burke, E. K., Kingston, J., & de Werra, D. (2004). Applications to timetabling. In J. L. Gross & J. Yellen (Eds.), The handbook of graph theory (pp. 445–474). Boca Raton: CRC Press.
3. Burke, E. K., McCollum, B., McMullan, P., & Yellen, J. (2008). Heuristic strategies to modify existing timetables. Presented at PATAT08, Montreal, Canada.
4. Burke, E. K., Pham, N., Qu, R., & Yellen, J. (2011). Linear combination of heuristics for examination timetabling. Annals of Operations Research. doi: 10.1007/s10479-011-0854-y .
5. Carrington, J. R., Pham, N., Qu, R., & Yellen, J. (2007). An enhanced weighted graph model for examination/course timetabling. In R. Barták et al. (Eds.), Proceedings of the 26th workshop of the UK planning and scheduling special interest group (pp. 9–16). Prague: Charles University.