Pages that link to "Item:Q1662648"
From MaRDI portal
The following pages link to The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648):
Displaying 9 items.
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices (Q2357129) (← links)
- A fixed-parameter tractable algorithm for matrix domination (Q2390264) (← links)
- Combinatorial bounds via measure and conquer (Q4962767) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
