1. Arora, S., Grigni, M., Karger, D., Klein, P., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: Proceedings of the Ninth Annual ACM-SIAM SODA, pp. 33–41. ACM Press, New York (1998)
2. Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of the Thirtyseventh Annual FOCS, pp. 2–11. IEEE Computer Society Press, Los Alamitos (1996)
3. Lecture Notes in Computer Science;A. Berger,2005
4. Berger, A., Grigni, M., Zhao, H.: A well-connected separator for planar graphs. Technical Report TR-2004-026-A, Emory University (2004)
5. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25, 1305–1317 (1996)