Hans L. Bodlaender

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

In this paper, we give for constant

A partial k -arboretum of graphs with bounded treewidth

k

On problems without polynomial kernels

a linear-time algorithm that, given a graph

Treewidth: Algorithmic techniques and results

G=(V,E)

Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs

, determines whether the treewidth of

A linear time algorithm for finding tree-decompositions of small treewidth

G

DYNAMIC PROGRAMMING ON GRAPHS WITH BOUNDED TREEWIDTH

is at most

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

k

Two Strikes Against Perfect Phylogeny

and, if so, finds a tree-decomposition of

Combinatorial Optimization on Graphs of Bounded Treewidth

G