Related references
Note: Only part of the references are listed.A Single-Exponential Time 2-Approximation Algorithm for Treewidth
Tuukka Korhonen
2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021) (2022)
Rank-width: Algorithmic and structural results
Sang-il Oum
DISCRETE APPLIED MATHEMATICS (2017)
A Branch Decomposition Algorithm for the p-Median Problem
Caleb C. Fast et al.
INFORMS JOURNAL ON COMPUTING (2017)
A c(k)n 5-APPROXIMATION ALGORITHM FOR TREEWIDTH
Hans L. Bodlaender et al.
SIAM JOURNAL ON COMPUTING (2016)
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Robert Ganian et al.
FUNDAMENTA INFORMATICAE (2013)
Boolean-width of graphs
Binh-Minh Bui-Xuan et al.
THEORETICAL COMPUTER SCIENCE (2011)
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Binh-Minh Bui-Xuan et al.
DISCRETE APPLIED MATHEMATICS (2010)
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Robert Ganian et al.
DISCRETE APPLIED MATHEMATICS (2010)
Approximating Rank-Width and Clique-Width Quickly
Sang-Il Oum
ACM TRANSACTIONS ON ALGORITHMS (2008)
Finding branch-decompositions and rank-decompositions
Petr Hlineny et al.
SIAM JOURNAL ON COMPUTING (2008)
Width parameters beyond tree-width and their applications
Petr Hlineny et al.
COMPUTER JOURNAL (2008)
On powers of graphs of bounded NLC-width (clique-width)
Karol Suchana et al.
DISCRETE APPLIED MATHEMATICS (2007)
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Michael Rao
THEORETICAL COMPUTER SCIENCE (2007)
Testing branch-width
Sang-il Oum et al.
JOURNAL OF COMBINATORIAL THEORY SERIES B (2007)
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Bruno Courcelle et al.
JOURNAL OF COMBINATORIAL THEORY SERIES B (2007)
Approximating clique-width and branch-width
Sang-il Oum et al.
JOURNAL OF COMBINATORIAL THEORY SERIES B (2006)
Branch-width, parse trees, and monadic second-order logic for matroids
P Hlineny
JOURNAL OF COMBINATORIAL THEORY SERIES B (2006)
Dominating sets in planar graphs: Branch-width and exponential speed-up
Fedor V. Fomin et al.
SIAM JOURNAL ON COMPUTING (2006)
Rank-width and vertex-minors
SI Oum
JOURNAL OF COMBINATORIAL THEORY SERIES B (2005)
A parametrized algorithm for matroid branch-width
P Hlineny
SIAM JOURNAL ON COMPUTING (2005)
Finding odd cycle transversals
B Reed et al.
OPERATIONS RESEARCH LETTERS (2004)
Tour merging via branch-decomposition
W Cook et al.
INFORMS JOURNAL ON COMPUTING (2003)
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
MU Gerber et al.
THEORETICAL COMPUTER SCIENCE (2003)
Edge dominating set and colorings on graphs with fixed clique-width
D Kobler et al.
DISCRETE APPLIED MATHEMATICS (2003)
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
G Damiand et al.
THEORETICAL COMPUTER SCIENCE (2001)
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
B Courcelle et al.
DISCRETE APPLIED MATHEMATICS (2001)
Linear time solvable optimization problems on graphs of bounded clique-width
B Courcelle et al.
THEORY OF COMPUTING SYSTEMS (2000)
Share Paper
