One of the major insights of the ``fixed-parameter
tractability’’ (FPT) approach to algorithm design is that, for many
NP-hard problems, it is possible to efficiently *shrink* instances
which have some underlying simplicity. This preprocessing
can...