77 citations · 160 across the 8 of their papers we have counts for
4 papers · 1 filter
Slack matrices, -products, and -level polytopes
Manuel Aprile, Michele Conforti, Yuri Faenza +3
In this paper, we study algorithmic questions concerning products of matrices and their consequences for recognition algorithms for polyhedra. The 1-product of matrices , $S_2…
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
Michele Conforti, Samuel Fiorini, Tony Huynh +1
Let be an -node graph without two disjoint odd cycles. The algorithm of Artmann, Weismantel and Zenklusen (STOC'17) for bimodular integer programs can be used to find a maxi…
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Michele Conforti, Samuel Fiorin, Tony Huynh +2
Consider the family of graphs without node-disjoint odd cycles, where is a constant. Determining the complexity of the stable set problem for such graphs is a lon…
Subgraph Polytopes and Independence Polytopes of Count Matroids
Michele Conforti, Volker Kaibel, Matthias Walter +1
Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a non-empty subset of nodes and F is a subset…