1. Fixed parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogues;Abrahamson;Ann. Pure Appl. Logic,1995
2. Polynomial time approximation schemes for Euclidean TSP and other geometric problems;Arora,1996
3. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems;Arora,1997
4. Polynomial time approximation schemes for dense instances of NP-hard problems;Arora,1995
5. Introduction to the Theory of Complexity;Bovet,1993