The following pages link to Kanstantsin Pashkovich (Q263203):
Displaying 23 items.
- The projected faces property and polyhedral relations (Q263204) (← links)
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs (Q527446) (← links)
- Stable sets and graphs with no even holes (Q745687) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- An elementary integrality proof of Rothblum's stable matching formulation (Q1709952) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- Combinatorial bounds on nonnegative rank and extended formulations (Q1759811) (← links)
- Hidden vertices in extensions of polytopes (Q1785631) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- Computing the nucleolus of weighted voting games in pseudo-polynomial time (Q2089798) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Approximating stable matchings with ties of bounded size (Q2109960) (← links)
- On the approximability of the stable matching problem with ties of size two (Q2196613) (← links)
- Small extended formulations for cyclic polytopes (Q2351019) (← links)
- Which nonnegative matrices are slack matrices? (Q2435500) (← links)
- Bounds on the number of 2-level polytopes, cones, and configurations (Q2664102) (← links)
- Cut Dominants and Forbidden Minors (Q2818204) (← links)
- Constructing Extended Formulations from Reflection Relations (Q3009770) (← links)
- Delta Minors, Delta Free Clutters, and Entanglement (Q3177442) (← links)
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem (Q4636516) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- Ideal Clutters That Do Not Pack (Q5219553) (← links)
- Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results (Q5247623) (← links)
