1. Lecture Notes in Computer Science;O. Aichholzer,2003
2. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to Theory of NP-Completeness. Freeman, New York (1979)
4. Gilbert, P.D.: New Results in Planar Triangulations. Report R-850. University of Illinois, Coordinated Science Lab. (1979)
5. Grantson, M., Borgelt, C., Levcopoulos, C.: A Fixed Parameter Algorithm for Minimum Weight Triangulation: Analysis and Experiments. Technical Report LU-CS-TR:2005-234, ISSN 1650-1276 Report 154. Lund University, Sweden (2005)