1. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. Assoc. Comput. Mach.,1994
2. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor and B. Schieber, A unified approach to approximating resource allocation and scheduling, inProceedings, 32th ACM Sympos. on Theory of Computing, 2000, pp. 735–744.
3. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda;Ann. Discrete Math.,1985
4. H. L. Bodlaender, Planar Graphs with Bounded Treewidth, Technical Report, RUU-CS-88-14, Department of Computer Science, University of Utrecht, 1988.
5. NC-algorithms for graphs with small treewidth;Bodlaender,1989