Pages that link to "Item:Q2978512"
From MaRDI portal
The following pages link to Solving the stable set problem in terms of the odd cycle packing number (Q2978512):
Displaying 8 items.
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- (Q5115779) (← links)
- A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
- Induced odd cycle packing number, independent sets, and chromatic number (Q6074594) (← links)
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
