1. Fixed parameter tractability and completeness II: completeness for W[1];Downey;Theor. Computer Sci.,1995
2. Computers and Intractability: A Guide to the Theory of NP-completeness;Garey,1979
3. Neural computation of decisions in optimization problems;Hopfield;Biol. Cybernetics,1985
4. Reducibility among combinatorial problems;Karp,1972
5. S. Khuri, T. Back, An evolutionary heuristic for the minimum vertex cover problem, in: G.I. Bonn (Ed.), Proceedings of KI-94 Workshops, the 18th German Annual Conference on Artificial Intelligence, 1994, pp. 83–84.