Pages that link to "Item:Q1702123"

The following pages link to An FPT 2-approximation for tree-cut decomposition (Q1702123):

Displaying 13 items.

• An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
• A Menger-like property of tree-cut width (Q1998754) (← links)
• Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
• On objects dual to tree-cut decompositions (Q2171026) (← links)
• On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
• Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
• Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
• The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
• (Q2788989) (redirect page) (← links)
• Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
• On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
• Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)