1. Lect Notes Comput Sci;A. A. Ageev,1999
2. A. A. Ageev and M. I. Sviridenko Pipage rounding: a new method of constructing algorithms with proven performance guarantee · Preliminary version appeared as [1], to appear, 2002.
3. H. L. Bodlaender A tourist guide through treewidth · Tech. Report RUU-CS-92-12, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1992.
4. M. R. Garey and D. S. Johnson Computers and intractability (a guide to the theory of NP-completeness) · W.H. Freeman and Company, New York, 1979.
5. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns · Parallel approximation schemes for a class of planar and near planar combinatorial problems · Information and Computation (2002).