Pages that link to "Item:Q5918906"

The following pages link to Conflict free version of covering problems on graphs: classical and parameterized (Q5918906):

Displaying 4 items.

• Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
• Constrained hitting set problem with intervals (Q2695330) (← links)
• Parameterized complexity of conflict-free set cover (Q5918356) (← links)
• Sparsity in covering solutions (Q6547950) (← links)