7 citations · 12 across the 12 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017★ 4 cited
Extension complexity of stable set polytopes of bipartite graphs
Manuel Aprile, Yuri Faenza, Samuel Fiorini +2
The extension complexity of a polytope is the minimum number of facets of a polytope that affinely projects to . Let be a bipartite graph with verti…
math.CO2017★ 1 cited
On 2-level polytopes arising in combinatorial settings
Manuel Aprile, Alfonso Cevallos, Yuri Faenza
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and s…