{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:54:36Z","timestamp":1743054876965,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030457709"},{"type":"electronic","value":"9783030457716"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45771-6_9","type":"book-chapter","created":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T21:03:32Z","timestamp":1586811812000},"page":"104-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles"],"prefix":"10.1007","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[]},{"given":"Tony","family":"Huynh","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,14]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Artmann, S., Weismantel, R., Zenklusen, R.: A strongly polynomial algorithm for bimodular integer linear programming. In: STOC 2017\u2013Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1206\u20131219. ACM, New York (2017)","DOI":"10.1145\/3055399.3055473"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3\u201351 (1979). discrete optimization (Proc. Adv. Res. Inst. Discrete Optimization and Systems Appl., Banff, Alta., 1977), II","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"9_CR3","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."},{"issue":"1","key":"9_CR4","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."},{"key":"9_CR5","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, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 788\u2013807 (2018). \nhttp:\/\/dl.acm.org\/citation.cfm?id=3174304.3175321"},{"issue":"2","key":"9_CR6","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. Comb. Theory Ser. B 18(2), 138\u2013154 (1975)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9_CR7","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 (2020). \nhttps:\/\/arxiv.org\/abs\/1908.06300\n\n. to appear in SODA \u201920"},{"key":"9_CR8","unstructured":"Conforti, M., Fiorini, S., Huynh, T., Weltge, S.: Extended formulations for stable set polytopes of graphs without two disjoint odd cycles (2019). \nhttp:\/\/arxiv.org\/abs\/1911.12179"},{"issue":"1","key":"9_CR9","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). \nhttps:\/\/doi.org\/10.1007\/s10107-015-0912-3","journal-title":"Math. Program."},{"issue":"1\u20133","key":"9_CR10","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":"1\u20132","key":"9_CR11","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."},{"key":"9_CR12","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":"3","key":"9_CR13","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. Comb. Theory Ser. B 103(3), 313\u2013319 (2013). \nhttps:\/\/doi.org\/10.1016\/j.jctb.2012.11.004","journal-title":"J. Comb. Theory Ser. B"},{"key":"9_CR14","unstructured":"Paat, J., Schl\u00f6ter, M., Weismantel, R.: Most IPs with bounded determinants can be solved in polynomial time (2019). \nhttp:\/\/arxiv.org\/abs\/1904.06874"},{"key":"9_CR15","unstructured":"Seymour, P.D.: Matroid minors. In: Handbook of Combinatorics, vol. 1, no. 2, pp. 527\u2013550. Elsevier Sci. B. V., Amsterdam (1995)"},{"issue":"5","key":"9_CR16","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. Comb. Theory Ser. B 97(5), 693\u2013717 (2007). \nhttps:\/\/doi.org\/10.1016\/j.jctb.2006.10.002","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"9_CR17","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":"2","key":"9_CR18","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":"9_CR19","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). \nhttps:\/\/doi.org\/10.1007\/s12532-012-0048-x","journal-title":"Math. Program. Ser. C"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45771-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T23:09:44Z","timestamp":1589929784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45771-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457709","9783030457716"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45771-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.xixilogic.org\/events\/clar2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}