Pages that link to "Item:Q3113780"
From MaRDI portal
The following pages link to Treewidth reduction for constrained separation and bipartization problems (Q3113780):
Displaying 10 items.
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- Near optimal seperation of tree-like and general resolution (Q558312) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- Constrained domatic bipartition on trees (Q1751203) (← links)
- An FPT algorithm for matching cut and d-cut (Q2115892) (← links)
- Treewidth of graphs with balanced separations (Q2312607) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Finding small separators in linear time via treewidth reduction (Q2933661) (← links)
- Reducing Separable Convex Programs with Tree Constraints (Q3351145) (← links)