1. Děneko VG, Hoffmann M, Okamoto Y, Woeginger GJ (2006) The traveling salesman problem with few inner points. Oper Res Lett 31:106–110
2. Downey RG, Fellows MR (1999) Parameterized complexity. Monographs in computer science. Springer, New York
3. Flum J, Grohe M (2006) Parameterized complexity theory. Texts in theoretical computer science an EATCS series. Springer, Berlin
4. Garey MR, Graham RL, Johnson DS (1976) Some NP-complete geometric problems. In: Proceedings of 8th annual ACM symposium on theory of computing (STOC '76). Association for Computing Machinery, New York, pp 10–22
5. Grantson M (2004) Fixed-parameter algorithms and other results for optimal partitions. Lecentiate thesis, Department of Computer Science, Lund University