Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404): Difference between revisions

@@ label / en / label / en @@
+Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3888545
@@ Property / cites work: Q3888545 / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
+Normal rank
@@ Property / cites work @@
+Reduction algorithms for graphs of small treewidth
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of vertex colouring
@@ Property / cites work: Parameterized complexity of vertex colouring / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Hamiltonicity Checking Via Bases of Perfect Matchings
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
+Normal rank
@@ Property / cites work @@
+Solving problems on graphs of high rank-width
@@ Property / cites work: Solving problems on graphs of high rank-width / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Clique-Width for Graphs of Bounded Tree-Width
+Normal rank
@@ Property / cites work @@
+Graph Layout Problems Parameterized by Vertex Cover
+Normal rank
@@ Property / cites work @@
+Q4633895
@@ Property / cites work: Q4633895 / rank @@
+Normal rank
@@ Property / cites work @@
+Intractability of Clique-Width Parameterizations
@@ Property / cites work: Intractability of Clique-Width Parameterizations / rank @@
+Normal rank
@@ Property / cites work @@
+Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
+Normal rank
@@ Property / cites work @@
+Kernelization using structural parameters on sparse graph classes
+Normal rank
@@ Property / cites work @@
+On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
+Normal rank
@@ Property / cites work @@
+A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
+Normal rank
@@ Property / cites work @@
+Backdoor treewidth for SAT
@@ Property / cites work: Backdoor treewidth for SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Combining Treewidth and Backdoors for CSP.
@@ Property / cites work: Combining Treewidth and Backdoors for CSP. / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Branch-Decompositions and Rank-Decompositions
+Normal rank
@@ Property / cites work @@
+Q3304141
@@ Property / cites work: Q3304141 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized coloring for tree-like graphs
@@ Property / cites work: Generalized coloring for tree-like graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
+Normal rank
@@ Property / cites work @@
+A polynomial kernel for distance-hereditary vertex deletion
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+Slightly Superexponential Parameterized Problems
@@ Property / cites work: Slightly Superexponential Parameterized Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Immersions in Highly Edge Connected Graphs
@@ Property / cites work: Immersions in Highly Edge Connected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Between Treewidth and Clique-Width
@@ Property / cites work: Between Treewidth and Clique-Width / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.4230/LIPIcs.MFCS.2019.42
+Normal rank
@@ Property / OpenAlex ID @@
+W2970851838
@@ Property / OpenAlex ID: W2970851838 / rank @@
+Normal rank
@@ Property / title @@
+Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (English)
+Normal rank