Author:
Bansal Nikhil,Raman Venkatesh
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. R. Balasubramanian, M. R. Fellows and V. Raman, ‘An Improved fixed parameter algorithm for vertex cover’ Information Processing Letters, 65 (3):163–168, 1998.
2. N. Bansal and V. Raman, ‘Upper Bounds for MaxSat: Further Improved’, Technical Report of the Institute of Mathematical Sciences, IMSc preprint 99/08/30.
3. R. Beigel and D. Eppstein, ‘3-coloring in time O(1:3446n): A no-MIS Algorithm’, In Proc of IEEE Foundations of Computer Science (1995) 444–452.
4. E. Dantsin, M. R. Gavrilovich E. A. Hirsch and B. Konev, ‘Approximation algorithms for MAX SAT: a better performance ratio at the cost of a longer running time’, PDMI preprint 14/1998, Stekolov Institute of Mathematics at St. Petersburg, 1998.
5. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, November 1998.
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献