Pages that link to "Item:Q2946405"
From MaRDI portal
The following pages link to Algorithmic Applications of Tree-Cut Width (Q2946405):
Displaying 17 items.
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← 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 complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← 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)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Problems hard for treewidth but easy for stable gonality (Q6039413) (← links)
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts (Q6039417) (← links)
- (Q6065468) (← links)