An improved parameterized algorithm for treewidth

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Fundamentals of parameterized complexity
Graph minors. XX: Wagner's conjecture
Graph minors. III. Planar tree-width
Safe separators for treewidth
Approximation algorithms for treewidth
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
S-functions for graphs
Improved self-reduction algorithms for graphs with bounded treewidth
Graph minors. XIII: The disjoint paths problem
Finding all leftmost separators of size $\le k$
Finding optimal triangulations parameterized by edge clique cover
An improved parameterized algorithm for the minimum node multiway cut problem
Parametrized complexity theory.
Nonserial dynamic programming
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
A $c^k n$ 5-Approximation Algorithm for Treewidth
Large Induced Subgraphs via Triangulations and CMSO
Algorithms finding tree-decompositions of graphs
Improved Approximation Algorithms for Minimum Weight Vertex Separators
Complexity of Finding Embeddings in a k-Tree
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
Kernelization
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
An Improvement of Reed’s Treewidth Approximation
A linear time algorithm for finding tree-decompositions of small treewidth
Inapproximability of Treewidth and Related Problems
Parameterized Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: An improved parameterized algorithm for treewidth