The joint goal of theoretical research in algorithms andcomputational complexity is to discover all the relevant algorithmic techniquesin a problem domain and prove the optimality of these techniques.We propose that the search for such tight results should be doneby a combined exploration of the dimensions running time, qualityof solution, and generality. Furthermore, the theory of parameterized ...