I will introduce the primary objects of combinatorial group theory: group presentations, Cayley graphs and disc diagrams. I will describe some classical decision problems and then present Dehn's algorithm (1912) for the solution of the word problem for surface groups. The proof of the algorithm's correctness involves curvature, notions of which continue to be developed and applied in group theory to this day.