In this paper, we consider a large class of vertex partitioning problems and apply to them the theory of algorithm design for problems restricted to partial k-trees. We carefully describe the details… Expand

We give a characterization of these graph parameters that unifies their definitions, facilitates their common algorithmic treatment and allows for their uniform complexity classification.Expand

We give a formal description of vertex subset optimization problems in a class that includes several variants of domination, independence, efficiency and packing.Expand

We present an algorithm with runtime $O(k^{2k}n^3m) for the k-Interval Completion problem of deciding whether a graph on n vertices and m edges can be made into an interval graph by adding at most k edges.Expand

We present an algorithm with runtime O(k(2k)n3 * m) for the following NP-complete problem: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k… Expand

We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT using similar, but more modern, graph structure tools.Expand