1. N. Alon, D. Moshkovitz, and S. Safra. Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms, 2(2):153–177, 2006.
2. J. Anhalt. Eine iterative Heuristik für aperiodische Fahrplangestaltung mit OD-Paaren. Master’s thesis, Georg-August-Universität Göttingen, 2012. (in German).
3. M. Bellare, S. Goldwasser, C. Lund, and A. Russel. Efficient probabilistically checkable proofs and applications to approximation. In STOC ’93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 294–304, New York, USA, 1993. ACM.
4. R. Burdett and E. Kozan. A sequencing approach for train timetabling. OR Spectrum, 32(1):163–193, 2010.
5. U. Brännlund, P. O. Lindberg, A. Nou, and J. E. Nilsson. Railway timetabling using lagrangian relaxation. Transportation Science, 32(4):358, 1998.