Pages that link to "Item:Q5918906"
From MaRDI portal
The following pages link to Conflict free version of covering problems on graphs: classical and parameterized (Q5918906):
Displaying 5 items.
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation (Q3467859) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Sparsity in covering solutions (Q6547950) (← links)
