1. Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)
2. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
3. Lecture Notes in Computer Science;V. Dujmović,2002
4. Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proc. 15th Symp. Discrete Algorithms SODA, January 2004, pp. 781–790. ACM and SIAM (2004)
5. Fernau, H.: A top-down approach to search-trees: Improved algorithmics for 3-Hitting Set. Technical Report TR04-073, Electronic Colloquium on Computational Complexity ECCC (2004)