Pages that link to "Item:Q1899445"

The following pages link to Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445):

Displaying 8 items.

• Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• Complexity of the packing coloring problem for trees (Q972338) (← links)
• On minimum cuts and the linear arrangement problem (Q1570828) (← links)
• Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
• Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)