Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The first step in isolating a bug involves identifying a sequence of step...
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...
Melanie Badent, Michael Baur, Ulrik Brandes, Sabin...