Engineering Planar-Separator and Shortest-Path Algorithms

"Algorithm engineering" denotes the process of designing, implementing, testing, analyzing, and refining computational proceedings to improve their performance. We consider three graph problems -- planar separation, single-pair shortest-path routing, and multimodal shortest-path routing -- and conduct a systematic study in order to: classify different kinds of input; draw concrete recommendations for choosing the parameters involved; and identify and tune crucial parts of the algorithm.