77 citations · 221 across the 23 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DM2019★ 4 cited
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…
cs.DM2019★ 1 cited
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…