Pages that link to "Item:Q393120"
From MaRDI portal
The following pages link to Solving min ones 2-SAT as fast as vertex cover (Q393120):
Displaying 4 items.
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)