Pages that link to "Item:Q3304132"
From MaRDI portal
The following pages link to On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132):
Displaying 18 items.
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Approximating partially bounded degree deletion on directed graphs (Q1641092) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
- (Q5075791) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5115821) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- (Q5874480) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
