Pages that link to "Item:Q5890961"
From MaRDI portal
The following pages link to Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961):
Displaying 5 items.
- The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
- On the parameterized complexity of the Maximum Exposure Problem (Q2680233) (← links)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- (Q5874535) (← links)
