In this course we focus on results from structural graph theory that have been widely used for designing algorithms. Among the topics covered are path-decompositions, tree-decompositions, induced subgraph detection, the three-in-a-tree theorem, and others (time permitting).