Pages that link to "Item:Q765338"
From MaRDI portal
The following pages link to On bounded-degree vertex deletion parameterized by treewidth (Q765338):
Displayed 12 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)