The following pages link to Ivo Koch (Q324796):
Displaying 13 items.
- \(k\)-tuple chromatic number of the Cartesian product of graphs (Q324798) (← links)
- A strengthened general cut-generating procedure for the stable set polytope (Q324806) (← links)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- \(k\)-tuple colorings of the Cartesian product of graphs (Q1752494) (← links)
- The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations (Q2091811) (← links)
- An integer programming approach for the 2-class single-group classification problem (Q2132360) (← links)
- The 2D subarray polytope (Q2132390) (← links)
- The \(b\)-chromatic index of direct product of graphs (Q2352788) (← links)
- An integer programming approach to b-coloring (Q2419584) (← links)
- (Q4568175) (← links)
- A hybrid heuristic for the rectilinear picture compression problem (Q6097853) (← links)
- Edge deletion to tree-like graph classes (Q6124427) (← links)
