Measuring what matters: a hybrid approach to dynamic programming with treewidth
From MaRDI portal
(Redirected from Publication:5092404)
Recommendations
Cites work
- (Meta) kernelization
- A polynomial kernel for distance-hereditary vertex deletion
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- Approximating clique-width and branch-width
- Backdoor treewidth for SAT
- Between treewidth and clique-width
- Clique-width: on the price of generality
- Combining treewidth and backdoors for CSP
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- Edge dominating set and colorings on graphs with fixed clique-width
- Finding Branch-Decompositions and Rank-Decompositions
- Fundamentals of parameterized complexity
- Generalized coloring for tree-like graphs
- Graph Layout Problems Parameterized by Vertex Cover
- Graph minors. III. Planar tree-width
- scientific article; zbMATH DE number 3694608 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- Immersions in highly edge connected graphs
- Intractability of clique-width parameterizations
- Kernelization using structural parameters on sparse graph classes
- Linear time solvable optimization problems on graphs of bounded clique-width
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Parameterized complexity of vertex colouring
- Preprocessing for treewidth: a combinatorial analysis through kernelization
- Reduction algorithms for graphs of small treewidth
- Slightly superexponential parameterized problems
- Solving problems on graphs of high rank-width
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Upper bounds to the clique width of graphs
Cited in
(5)- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Positive-instance driven dynamic programming for treewidth
- Solving projected model counting by utilizing treewidth and its limits
- On the Parameterized Complexity of Clique Elimination Distance
- An FPT algorithm for elimination distance to bounded degree graphs
This page was built for publication: Measuring what matters: a hybrid approach to dynamic programming with treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092404)
