As everyone knows, Garey and Johnson's famous book (and many others) provides an excellent reference for reduction technique in classical setting. Are there any surveys or books on the topic of reduction technique in parameterized algorithm, say the fpt reduction?
Both the original parametrized complexity book by Downey and Fellows, and the newer book by Flum and Grohe, are good references for reduction techniques.
Techniques for the design of algorithms often help in reductions as well. Therefore it may be good to learn about techniques used to design FPT algorithms, for which the notes of the Spring School on Fixed Parameter and Exact Algorithms (2009) may be a starting point. In particular, you may want to look at the following excellent overview talks:
I haven't had the occasion to open it yet, but I guess you may be interested in "Exact exponential algorithms" by Fomin and Kratsch (from last year)
Here it its table of contents :