Author:
Chen Jianer,Kanj Iyad A.,Xia Ge
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Balasubramanian, R., Fellows, M.R., Raman, V.: An improved fixed parameter algorithm for vertex cover. Inform. Process. Lett. 65, 163–168 (1998)
2. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. 10th ACM-SIAM Symp. on Discrete Algorithms (SODA 1999), pp. 856–857 (1999)
3. Buss, J.F., Goldsmith, J.: Nondeterminism within P. SIAM J. Comput. 22, 560–572 (1993)
4. Cai, L., Juedes, D.: On the existence of subexponential-time parameterized algorithms, Available at http://www.cs.uga.edu/~cai/
5. Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms 41, 280–301 (2001)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献