1. An improved fixed parameter algorithm for vertex cover;Balasubramanian;Inform. Process. Lett.,1998
2. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda;Ann. Discrete Math.,1985
3. Finding maximum independent sets in sparse and general graphs;Beigel,1999
4. 3-coloring in time O(1.3446n): a no-MIS algorithm;Beigel,1995
5. Nondeterminism within P;Buss;SIAM J. Comput.,1993