Pages that link to "Item:Q2699960"
From MaRDI portal
The following pages link to Faster parameterized algorithms for two vertex deletion problems (Q2699960):
Displaying 5 items.
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- Faster FPT algorithms for deletion to pairs of graph classes (Q2140510) (← links)
- Faster parameterized algorithm for pumpkin vertex deletion set (Q2414055) (← links)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion (Q2802923) (← links)