1. Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. Journal of Scheduling 9, 177–193 (2006)
2. Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems – Part I. Theoretical Computer Science 148, 93–109 (1995)
3. Corneil, D.G., Olariu, S., Stewart, L.: The ultimate interval graph recognition algorithm? In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 175–180. SIAM, Philadelphia (1998)
4. Dinitz, J.H., Stinson, D.R.: On assigning referees to tournament schedules. Bulletin of the Institute of Combinatorics and its Applications 44, 22–28 (2005)
5. Duarte, A.R.: Challenge referee assignment problem instances (last visited on March 23, 2007), Online document at
http://www.esportemax.org/rapopt