Pages that link to "Item:Q5505650"
From MaRDI portal
The following pages link to Parameterized Algorithms for Generalized Domination (Q5505650):
Displaying 11 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Combinatorial properties of a general domination problem with parity constraints (Q998375) (← links)
- Structural parameterizations of dominating set variants (Q1625157) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- Improved parameterized algorithms and kernels for mixed domination (Q2310753) (← links)
- (Q2721971) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Parameterized Complexity of Generalized Domination Problems (Q5851100) (← links)