Pages that link to "Item:Q2817850"
From MaRDI portal
The following pages link to A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850):
Displaying 11 items.
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Faster parameterized algorithm for pumpkin vertex deletion set (Q2414055) (← links)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- (Q5075776) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
