Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824): Difference between revisions

@@ Property / author @@
-Hans L. Bodlaender
@@ Property / author: Hans L. Bodlaender / rank @@
-Normal rank
@@ Property / author @@
+Hans L. Bodlaender
@@ Property / author: Hans L. Bodlaender / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2128049247
@@ Property / OpenAlex ID: W2128049247 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4217
@@ Property / arXiv ID: 1104.4217 / 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 @@
+Necessary edges in \(k\)-chordalisations of graphs
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113681
@@ Property / cites work: Q3113681 / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
+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 @@
+The Pathwidth and Treewidth of Cographs
@@ Property / cites work: The Pathwidth and Treewidth of Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the treewidth and the minimum fill-in with the modular decomposition
+Normal rank
@@ Property / cites work @@
+Q4426346
@@ Property / cites work: Q4426346 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and metaheuristic methods for computing graph treewidth
+Normal rank
@@ Property / cites work @@
+Safe reduction rules for weighted treewidth
@@ Property / cites work: Safe reduction rules for weighted treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036591
@@ Property / cites work: Q4036591 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3012824