1. S. Arora, C. Lund, R. Motwani, Madhu Sudan and M. Szegedy, “Proof Verification and Hardness of Approximation Problems”, Proc. 33rd IEEE FOCS, Oct. 1992, pp 14–23.
2. B.S. Baker, “Approximation Algorithms for NP-complete Problems on Planar Graphs,” Proc. 24th IEEE FOCS, Nov. 1983, pp 265–273. (Journal version: J. ACM, Vol. 41, No. 1, Jan. 1994, pp 153–180.)
3. R. Bar-Yehuda and S. Even, “A Local Ratio Theorem for Approximating the Weighted Vertex Cover Problem,” in Analysis and Design of Algorithms for Combinatorial Problems, Annals of Discrete Mathematics, Vol. 25, North Holland Publications, 1985, pp 27–45.
4. H.L. Bodlaender, “NC Algorithms for Graphs with Bounded Treewidth”, Proc. WG'88, Springer-Verlag LNCS 344, 1988, pp 1–10.
5. H.L. Bodlaender, “Planar graphs with Bounded Treewidth”, Tech. Rep. No. RUU-CS-88-14, University of Utrecht, 1988.