Author:
Hansmann Ronny S.,Zimmermann Uwe T.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. H.L. Bodlaender and K. Jansen. Restrictions of graph partition problems. Part I. Theoretical Computer Science, 148(1):93–109, 1995.
2. E. Dahlhaus, P. Horak, M. Miller, and J.F. Ryan. The train marshalling problem. Discrete Applied Mathematics, 103(1–3):41–54, 2000.
3. E. Dahlhaus, F. Manne, M. Miller, and J.F. Ryan. Algorithms for combinatorial problems related to train marshalling. In Proceedings of AWOCA 2000, pages 7–16, Hunter Valley, 2000.
4. G. Di Stefano and M.L. Koči. A graph theoretical approach to the shunting problem. Electronic Notes in Theoretical Computer Science, 92:16–33, 2004.
5. G. Di Stefano, St. Krause, M.E. Lübbecke, and U.T. Zimmermann. On minimum k-modal partitions of permutations. In J.R. Correa, A. Hevia, and M. Kiwi, editors, Latin American Theoretical Informatics (LATIN2006), volume 3887 of Lecture Notes in Computer Science, pages 374–385. Springer-Verlag, Berlin, 2006.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献