Q5111890 (Q5111890): Difference between revisions

@@ Property / DOI @@
-.4230/LIPIcs.IPEC.2017.30
@@ Property / DOI: 10.4230/LIPIcs.IPEC.2017.30 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+dynASP
@@ Property / describes a project that uses: dynASP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Jdrasil
@@ Property / describes a project that uses: Jdrasil / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ToTo
@@ Property / describes a project that uses: ToTo / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Regina
@@ Property / describes a project that uses: Regina / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Jdrasil: A Modular Library for Computing Tree Decompositions
+Normal rank
@@ Property / cites work @@
+A Benders Approach to the Minimum Chordal Completion Problem
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for \textsc{Minimum Fill-in}
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+A characterisation of rigid circuit graphs
@@ Property / cites work: A characterisation of rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs
+Normal rank
@@ Property / cites work @@
+Answer set solving with bounded treewidth revisited
+Normal rank
@@ Property / cites work @@
+DynASP2.5: Dynamic Programming on Tree Decompositions in Action
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Treewidth and Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4634396
@@ Property / cites work: Q4634396 / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Dominating Set Analyzed by the Potential Method
+Normal rank
@@ Property / cites work @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+On the treewidth of toroidal grids
@@ Property / cites work: On the treewidth of toroidal grids / rank @@
+Normal rank
@@ Property / cites work @@
+SAT-encodings for special treewidth and pathwidth
@@ Property / cites work: SAT-encodings for special treewidth and pathwidth / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
+Normal rank
@@ Property / cites work @@
+Integrally Closed Domains, Minimal Polynomials, and Null Ideals of Matrices
+Normal rank
@@ Property / cites work @@
+Positive-instance driven dynamic programming for treewidth
+Normal rank
@@ Property / cites work @@
+Decomposition by clique separators
@@ Property / cites work: Decomposition by clique separators / rank @@
+Normal rank
@@ Property / cites work @@
+All structured programs have small tree width and good register allocation
+Normal rank
@@ Property / cites work @@
+Computing treewidth on the GPU
@@ Property / cites work: Computing treewidth on the GPU / rank @@
+Normal rank
@@ Property / cites work @@
+\textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.IPEC.2017.30
@@ Property / DOI: 10.4230/LIPICS.IPEC.2017.30 / rank @@
+Normal rank