The book addresses difficult problems on graphs for which there are likely no efficient algorithms. The author presents various methods for dealing with the algorithmic hardness of such problems. In doing so, he introduces his readers to the frontiers of current research in this subfield of algorithmics. With its easily understandable presentation, numerous explanatory illustrations, examples, and exercises, as well as the appropriate selection of results and techniques, the volume is particularly suitable for use in teaching.