Pages that link to "Item:Q340561"
From MaRDI portal
The following pages link to On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561):
Displaying 11 items.
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- (Q3459882) (redirect page) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
