Pages that link to "Item:Q5918356"
From MaRDI portal
The following pages link to Parameterized complexity of conflict-free set cover (Q5918356):
Displaying 7 items.
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- Sparsity in covering solutions (Q6547950) (← links)
- On conflict-free cuts: algorithms and complexity (Q6602320) (← links)