Pages that link to "Item:Q986553"
From MaRDI portal
The following pages link to The parameterized complexity of editing graphs for bounded degeneracy (Q986553):
Displaying 13 items.
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Circulant graphs and GCD and LCM of subsets (Q477605) (← links)
- Incremental problems in the parameterized complexity setting (Q519883) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Graph editing to a given neighbourhood degree list is fixed-parameter tractable (Q1708604) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- (Q5009469) (← links)
- (Q5075776) (← links)
- (Q5116488) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On the complexity of target set selection in simple geometric networks (Q6606994) (← links)
