1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. Train marshalling is fixed parameter tractable;Brueggeman,2012
3. The train marshalling problem;Dahlhaus;Discrete Appl. Math.,2000
4. Efficient splitting off algorithms for graphs;Gabow,1994
5. Comprehensive Logistics;Gudehus,2012