There are many graph problems that can be solved in linear or polynomial time with a
dynamic programming algorithm when the input graph has bounded treewidth. For …

For more and more applications, it is important to be able to compute the treewidth of a given
graph and to find tree decompositions of small width reasonably fast. This paper gives an …

Treewidth is a graph parameter with several interesting theoretical and practical
applications. This survey reviews algorithmic results on determining the treewidth of a given …

This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some
alternative characterizations and some applications of the notion are given. The paper also …

Treewidth is a parameter that measures how tree-like a relational instance is, and whether it
can reasonably be decomposed into a tree. Many computation tasks are known to be …

For several applications, it is important to be able to compute the treewidth of a given graph
and to find tree decompositions of small width reasonably fast. Good lower bounds on the …

We give a fixed-parameter tractable algorithm that, given a parameter k and two graphs
G_1,G_2, either concludes that one of these graphs has treewidth at least k or determines …

Fast algorithms can be created for many graph problems when instances are confined to
classes of graphs that are recursively constructed. This article first describes some basic …

The notion of treewidth plays an important role in theoretical and practical studies of graph
problems. It has been recognized that, especially in practical environments, when computing …

We give a new FPT algorithm testing isomorphism of n-vertex graphs of tree-width k in time 2
kpolylog (k) n3, improving the FPT algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and …