With more than 200 research papers published on the algorithmic complexity of domination and related parameters of graphs, it is difficult to know what to cover in a relatively short chapter on the subject, especially since it could take quite a few pages just to cover the preliminaries of computational complexity and the many algorithm design paradigms that have been applied to domination problems.