  In the past a few years, many interesting inapproximability results have been
obtained from the parameterized perspective. This article surveys some of such
results, with a focus on $k$-Clique, $k$-SetCover, and other related problems.
