Abstract

This thesis studies the theory and practical applications of separator-based dynamic programming (and in particular treewidth) for solving combinatorial problems in graphs. The thesis consists of three parts; the first focusing on graph embedding problems, the second on problems in geometric intersection graphs, and the third explores practical applications of
... read more