The stable set problem in graphs with bounded genus and bounded odd cycle packing number

DOI10.1137/1.9781611975994.176OpenAlexW2998522986MaRDI QIDQ5146973

Samuel Fiorini, Michele Conforti, Gwenaël Joret, Tony Huynh, Stefan Weltge

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.06300

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles, Notes on \(\{a,b,c\}\)-modular matrices, On the recognition of \(\{a,b,c\}\)-modular matrices, An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem, The integrality number of an integer program, Extended formulations for stable set polytopes of graphs without two disjoint odd cycles