1. Edge-disjoint paths in planar graphs;Frank;J. Combin. Theory Ser. B,1985
2. On routing around a rectangle;Frank;Proceedings of the ETAN Network Theory Symposium, Yugoslavia,1984
3. Graphen mit triangulierbaren ungeraden Vierecken;Gallai;Magyar Tud. Akad. Mat. Kut. Int. Kozl.,1962
4. An algorithm for optimal routing around a rectangle;Gonzalez;Proceedings of the 20th Allerton Conference on Communication, Control, and Computing,1982
5. A linear time algorithm for optimal routing around a rectangle;Gonzalez;J. ACM,1988