Pages that link to "Item:Q2272595"
From MaRDI portal
The following pages link to Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595):
Displaying 8 items.
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- (Q5111863) (← links)
- (Q5111866) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- (Q6068237) (← links)
- Digraph coloring and distance to acyclicity (Q6614618) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)