Pages that link to "Item:Q2232241"
From MaRDI portal
The following pages link to Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241):
Displaying 6 items.
- Faster FPT algorithms for deletion to pairs of graph classes (Q2140510) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
- Edge deletion to tree-like graph classes (Q6124427) (← links)