{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T17:46:14Z","timestamp":1744307174713,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["615640"],"award-info":[{"award-number":["615640"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10107-021-01635-0","type":"journal-article","created":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T15:04:25Z","timestamp":1616511865000},"page":"547-566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Extended formulations for stable set polytopes of graphs without two disjoint odd cycles"],"prefix":"10.1007","volume":"192","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6908-923X","authenticated-orcid":false,"given":"Tony","family":"Huynh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,23]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Artmann, S., Weismantel, R., Zenklusen, R.: A strongly polynomial algorithm for bimodular integer linear programming. In: STOC\u201917\u2014Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. ACM, New York. pp. 1206\u20131219 (2017)","key":"1635_CR1","DOI":"10.1145\/3055399.3055473"},{"key":"1635_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0024-3795(93)00173-W","volume":"218","author":"JW Grossman","year":"1995","unstructured":"Grossman, J.W., Kulkarni, D.M., Schochetman, I.E.: On the minors of an incidence matrix and its smith normal form. Linear Algebra Appl. 218, 213\u2013224 (1995)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1635_CR3","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E Tardos","year":"1986","unstructured":"Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34(2), 250\u2013256 (1986)","journal-title":"Oper. Res."},{"issue":"1\u20133","key":"1635_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582563","volume":"64","author":"M Dyer","year":"1994","unstructured":"Dyer, M., Frieze, A.: Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Math. Program. 64(1\u20133), 1\u201316 (1994)","journal-title":"Math. Program."},{"issue":"2","key":"1635_CR5","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.disopt.2008.12.002","volume":"6","author":"SI Veselov","year":"2009","unstructured":"Veselov, S.I., Chirkov, A.J.: Integer program with bimodular matrix. Discrete Optim. 6(2), 220\u2013222 (2009)","journal-title":"Discrete Optim."},{"issue":"1","key":"1635_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00454-014-9601-x","volume":"52","author":"N Bonifas","year":"2014","unstructured":"Bonifas, N., Di Summa, M., Eisenbrand, F., H\u00e4hnle, N., Niemeier, M.: On sub-determinants and the diameter of polyhedra. Discrete Comput. Geom. 52(1), 102\u2013115 (2014)","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20132","key":"1635_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-016-1089-0","volume":"164","author":"F Eisenbrand","year":"2017","unstructured":"Eisenbrand, F., Vempala, S.: Geometric random edge. Math. Program. 164(1\u20132), 325\u2013339 (2017)","journal-title":"Math. Program."},{"unstructured":"Paat, J., Schl\u00f6ter, M., Weismantel, R.: Most IPs with bounded determinants can be solved in polynomial time. http:\/\/arxiv.org\/abs\/1904.06874 (2019)","key":"1635_CR8"},{"doi-asserted-by":"crossref","unstructured":"Conforti, M., Fiorini, S., Huynh, T., Joret, G., Weltge, S.: The stable set problem in graphs with bounded genus and bounded odd cycle packing number. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM. pp. 2896\u20132915 (2020)","key":"1635_CR9","DOI":"10.1137\/1.9781611975994.176"},{"doi-asserted-by":"crossref","unstructured":"Cevallos, A., Weltge, S., Zenklusen, R.: Lifting linear extension complexity bounds to the mixed-integer setting. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201918, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, pp. 788\u2013807 (2018)","key":"1635_CR10","DOI":"10.1137\/1.9781611975031.51"},{"unstructured":"Seymour, P.D.: Matroid minors. In: Handbook of combinatorics, Vol. 1, pp. 527\u2013550. Elsevier, Amsterdam (1995)","key":"1635_CR11"},{"issue":"3","key":"1635_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.jctb.2012.11.004","volume":"103","author":"KI Kawarabayashi","year":"2013","unstructured":"Kawarabayashi, K.I., Ozeki, K.: A simpler proof for the two disjoint odd cycles theorem. J. Combin. Theory Ser. B 103(3), 313\u2013319 (2013)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"1635_CR13","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Combin. Theory Ser. B 18(2), 138\u2013154 (1975)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5","key":"1635_CR14","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.jctb.2006.10.002","volume":"97","author":"D Slilaty","year":"2007","unstructured":"Slilaty, D.: Projective-planar signed graphs and tangled signed graphs. J. Combin. Theory Ser. B 97(5), 693\u2013717 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1635_CR15","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins University Press, Baltimore (2001)"},{"doi-asserted-by":"crossref","unstructured":"Balas, E.: Disjunctive programming. Ann. Discrete Math. 5: 3\u201351 Discrete optimization, In Proceedings of the Advanced Research Institute Discrete Optimization and Systems Applications, Banff, Alta., 1977), II (1979)","key":"1635_CR16","DOI":"10.1016\/S0167-5060(08)70342-X"},{"issue":"1","key":"1635_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10107-015-0912-3","volume":"153","author":"M Conforti","year":"2015","unstructured":"Conforti, M., Gerards, B., Pashkovich, K.: Stable sets and graphs with no even holes. Math. Program. 153(1), 13\u201339 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"1635_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480190182678","volume":"7","author":"F Barahona","year":"1994","unstructured":"Barahona, F., Mahjoub, A.R.: Compositions of graphs and polyhedra ii: stable sets. SIAM J. Discrete Math. 7(3), 359\u2013371 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"1635_CR19","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"GL Nemhauser","year":"1974","unstructured":"Nemhauser, G.L., Trotter, J.L.E.: Properties of vertex packing and independence system polyhedra. Math. Program. 6, 48\u201361 (1974)","journal-title":"Math. Program."},{"issue":"1","key":"1635_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s12532-012-0048-x","volume":"5","author":"M Walter","year":"2013","unstructured":"Walter, M., Truemper, K.: Implementation of a unimodularity test. Math. Program. Ser. C 5(1), 57\u201373 (2013)","journal-title":"Math. Program. Ser. C"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01635-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01635-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01635-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T20:08:42Z","timestamp":1698091722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01635-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,23]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1635"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01635-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2021,3,23]]},"assertion":[{"value":"30 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}