Positive-Instance Driven Dynamic Programming for Treewidth. (Q5111757): Difference between revisions

@@ label / en / label / en @@
+Positive-Instance Driven Dynamic Programming for Treewidth.
@@ Property / DOI @@
-.4230/LIPIcs.ESA.2017.68
@@ Property / DOI: 10.4230/LIPIcs.ESA.2017.68 / rank @@
-Normal rank
@@ Property / author @@
-Hisao Tamaki
@@ Property / author: Hisao Tamaki / rank @@
-Normal rank
@@ Property / author @@
+Hisao Tamaki
@@ Property / author: Hisao Tamaki / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A note on exact algorithms for vertex ordering problems on graphs
+Normal rank
@@ Property / cites work @@
+On exact algorithms for treewidth
@@ Property / cites work: On exact algorithms for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Safe separators for treewidth
@@ Property / cites work: Safe separators for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Contraction and Treewidth Lower Bounds
@@ Property / cites work: Contraction and Treewidth Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Treewidth and Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Treewidth computation and extremal combinatorics
@@ Property / cites work: Treewidth computation and extremal combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+Q5687246
@@ Property / cites work: Q5687246 / rank @@
+Normal rank
@@ Property / cites work @@
+An Iterative Heuristic Algorithm for Tree Decomposition
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Encoding Treewidth into SAT
@@ Property / cites work: Encoding Treewidth into SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudo Affine Projection Algorithms Revisited: Robustness and Stability Analysis
+Normal rank
@@ Property / full work available at URL @@
+https://dblp.uni-trier.de/db/conf/esa/esa2017.html#Tamaki17
+Normal rank
@@ Property / OpenAlex ID @@
+W2897005204
@@ Property / OpenAlex ID: W2897005204 / rank @@
+Normal rank
@@ Property / title @@
+Positive-Instance Driven Dynamic Programming for Treewidth. (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.ESA.2017.68
@@ Property / DOI: 10.4230/LIPICS.ESA.2017.68 / rank @@
+Normal rank