{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T23:28:08Z","timestamp":1750116488310},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_6","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T02:06:22Z","timestamp":1509501982000},"page":"75-87","source":"Crossref","is-referenced-by-count":7,"title":["Extension Complexity of Stable Set Polytopes of\u00a0Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Aprile","sequence":"first","affiliation":[]},{"given":"Yuri","family":"Faenza","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[]},{"given":"Tony","family":"Huynh","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Macchia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10479-012-1269-0","volume":"204","author":"M Conforti","year":"2013","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Extended formulations in combinatorial optimization. Ann. Oper. Res. 204, 97\u2013143 (2013)","journal-title":"Ann. Oper. Res."},{"key":"6_CR2","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer programming. Graduate Texts in Mathematics, vol. 271. Springer, Cham (2014)"},{"key":"6_CR3","volume-title":"Projective Geometry","author":"HSM Coxeter","year":"1994","unstructured":"Coxeter, H.S.M.: Projective Geometry, Revised reprint of the 2 edn. Springer, New York (1994)","edition":"Revised reprint"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1, 127\u2013136 (1971)","journal-title":"Math. Program."},{"issue":"1","key":"6_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.disc.2012.09.015","volume":"313","author":"S Fiorini","year":"2013","unstructured":"Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. Discrete Math. 313(1), 67\u201383 (2013)","journal-title":"Discrete Math."},{"issue":"2","key":"6_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/2716307","volume":"62","author":"S Fiorini","year":"2015","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., Wolf, R.D.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62(2), 17\u201323 (2015)","journal-title":"J. ACM"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"G\u00f6\u00f6s, M., Jain, R., Watson, T.: Extension complexity of independent set polytopes. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 565\u2013572. IEEE (2016)","DOI":"10.1109\/FOCS.2016.67"},{"key":"6_CR9","unstructured":"Kaibel, V.: Extended formulations in combinatorial optimization. arXiv preprint arXiv:1104.1023 (2011)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Khoshkhah, K., Theis, D.O.: Fooling sets and the spanning tree polytope. arXiv preprint arXiv:1701.00350 (2017)","DOI":"10.1016\/j.ipl.2017.05.009"},{"issue":"3","key":"6_CR11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"RK Martin","year":"1991","unstructured":"Martin, R.K.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3), 119\u2013128 (1991)","journal-title":"Oper. Res. Lett."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: The matching polytope has exponential extension complexity. In: STOC 2014\u2013Proceedings of 2014 ACM Symposium on Theory of Computing, pp. 263\u2013272. ACM, New York (2014)","DOI":"10.1145\/2591796.2591834"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Communication complexity (for algorithm designers). arXiv preprint arXiv:1509.06257 (2015)","DOI":"10.1561\/9781680831153"},{"key":"6_CR14","volume-title":"Combinatorial Optimization. Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"issue":"1","key":"6_CR15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02579163","volume":"4","author":"Z Tuza","year":"1984","unstructured":"Tuza, Z.: Covering of graphs by complete bipartite subgraphs: complexity of 0-1 matrices. Combinatorica 4(1), 111\u2013116 (1984)","journal-title":"Combinatorica"},{"key":"6_CR16","unstructured":"Wong, R.T.: Integer programming formulations of the traveling salesman problem. In: Proceedings of 1980 IEEE International Conference on Circuits and Computers, pp. 149\u2013152 (1980)"},{"issue":"3","key":"6_CR17","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M Yannakakis","year":"1991","unstructured":"Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. System Sci. 43(3), 441\u2013466 (1991)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T18:52:59Z","timestamp":1603219979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}