1. Booth, K. S., & Lueker, G. S. (1976).Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences. 13(3), 335–379
2. Brueggeman, L., Fellows, M., Fleischer, R., Lackner, M., Komusiewicz, C., Koutis, Y., Pfandler, A., & Rosamond, F. (2012). Train marshalling is fixed parameter tractable. In E. Kranakis, D. Krizanc, & F. Luccio (Eds.), Fun with Algorithms (pp. 51–56). Berlin, Heidelberg: Springer Berlin Heidelberg
3. Dahlhaus, E. (2009). The structure of sequencing requirements of distributer freight trains, Proceedings of EURNEX-ZEL 2009, Zilina
4. Dahlhaus, E., Horak, P., Miller, M., & Ryan, J. (2000). The train marshalling problem. Discrete Applied Mathematics, 103(1–3), 41–54.
5. Dahlhaus, E., Manne, F., Miller, M., & Ryan, J. (2000). Algorithms for combinatorial problems related to train marshalling. In Proceedings of AWOCA 2000, Hunter Valley, pp. 7–16