Pages that link to "Item:Q1755835"
From MaRDI portal
The following pages link to A note on non-degenerate integer programs with small sub-determinants (Q1755835):
Displaying 12 items.
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648) (← links)
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- On the recognition of \(\{a,b,c\}\)-modular matrices (Q2061884) (← links)
- The integrality number of an integer program (Q2118127) (← links)
- Notes on \(\{a,b,c\}\)-modular matrices (Q2135088) (← 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)
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants (Q3174729) (← links)
- On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices (Q6146267) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
