The following pages link to (Q3328286):
Displaying 17 items.
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- An integer analogue of Carathéodory's theorem (Q1074117) (← links)
- Promise problems complete for complexity classes (Q1109568) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- On the number of convex lattice polytopes (Q2366288) (← links)
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems (Q2492683) (← links)
- Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
- On the Chvátal rank of linear relaxations of the stable set polytope (Q3002564) (← links)
- On co-bicliques (Q3004204) (← links)
- On the complexity of resilient network design (Q3057137) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- Disjoint clique cutsets in graphs without long holes (Q4676589) (← links)
- Optimal group testing (Q5886113) (← links)
