Pages that link to "Item:Q765338"
From MaRDI portal
The following pages link to On bounded-degree vertex deletion parameterized by treewidth (Q765338):
Displaying 30 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)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Kernels for packing and covering problems (Q2272393) (← 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)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5115821) (← links)
- (Q5116488) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- (Q5874480) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)
