Pages that link to "Item:Q476298"
From MaRDI portal
The following pages link to On the tractability of some natural packing, covering and partitioning problems (Q476298):
Displaying 4 items.
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Chain packing in graphs (Q808291) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)