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

DOI10.1137/1.9781611975994.176MaRDI QIDQ5146973zbMATH OpenOpenAlexFDO

Authors Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, 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)

Cited in

(12)

• Polyhedral results on the stable set problem in graphs containing even or odd pairs
• On the recognition of \(\{a,b,c\}\)-modular matrices
• An FPTAS for the -modular multidimensional knapsack problem
• The integrality number of an integer program
• Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
• Notes on \(\{a,b,c\}\)-modular matrices
• THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
• Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
• Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
• Integer programs with bounded subdeterminants and two nonzeros per row
• A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
• Extended formulations for the integer hull of strictly -modular cographic polyhedral cones

This page was built for publication: The stable set problem in graphs with bounded genus and bounded odd cycle packing number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146973)