Pages that link to "Item:Q3196378"
From MaRDI portal
The following pages link to On the Complexity of the Minimum Independent Set Partition Problem (Q3196378):
Displaying 5 items.
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- On the Minimum Common Integer Partition Problem (Q3434560) (← links)
- Better Approximations for the Minimum Common Integer Partition Problem (Q3595391) (← links)
- Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms (Q4608072) (← links)
- On the minimum consistent subset problem (Q5918312) (← links)