{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:29:03Z","timestamp":1769315343226,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T00:00:00Z","timestamp":1484179200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/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":["Discrete Comput Geom"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00454-016-9852-9","type":"journal-article","created":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T14:14:59Z","timestamp":1484230499000},"page":"757-761","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs"],"prefix":"10.1007","volume":"57","author":[{"given":"Samuel","family":"Fiorini","sequence":"first","affiliation":[]},{"given":"Tony","family":"Huynh","sequence":"additional","affiliation":[]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[]},{"given":"Kanstantsin","family":"Pashkovich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,12]]},"reference":[{"issue":"6","key":"9852_CR1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0167-6377(88)90058-2","volume":"7","author":"E Balas","year":"1988","unstructured":"Balas, E.: On the convex hull of the union of certain polyhedra. Oper. Res. Lett. 7(6), 279\u2013283 (1988)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"9852_CR2","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.orl.2015.06.011","volume":"43","author":"M Conforti","year":"2015","unstructured":"Conforti, M., Kaibel, V., Walter, M., Weltge, S.: Subgraph polytopes and independence polytopes of count matroids. Oper. Res. Lett. 43(5), 457\u2013460 (2015)","journal-title":"Oper. Res. Lett."},{"key":"9852_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-60618-1_66","volume-title":"Graph-Theoretic Concepts in Computer Science (Aachen, 1995)","author":"HN Djidjev","year":"1995","unstructured":"Djidjev, H.N., Venkatesan, S.M.: Planarization of graphs embedded on surfaces. In: Nagl, M. (ed.) Graph-Theoretic Concepts in Computer Science (Aachen, 1995). Lecture Notes in Computer Science, pp. 62\u201372. Springer, Berlin (1995)"},{"issue":"7","key":"9852_CR4","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0167-6377(91)90038-Q","volume":"10","author":"AMH Gerards","year":"1991","unstructured":"Gerards, A.M.H.: Compact systems for $$T$$ T -join and perfect matching polyhedra of graphs with bounded genus. Oper. Res. Lett. 10(7), 377\u2013382 (1991)","journal-title":"Oper. Res. Lett."},{"key":"9852_CR5","series-title":"Perspectives in Computing","volume-title":"Discrete Algorithms and Complexity (Kyoto, 1986)","author":"JP Hutchinson","year":"1987","unstructured":"Hutchinson, J.P., Miller, G.I.: On deleting vertices to make a graph of positive genus planar. In: Johnson, D.P., Nishizek, T., Nozaki, A., Wilf, H.P. (eds.) Discrete Algorithms and Complexity (Kyoto, 1986). Perspectives in Computing. Academic, Boston (1987)"},{"key":"9852_CR6","unstructured":"Kolman, P., Kouteck\u00fd, M. Tiwary, H.: Extension complexity, MSO logic, and treewidth. In: Pagh, R. (ed.) 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol. 53, pp. 18:1\u201318:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016)"},{"issue":"3","key":"9852_CR7","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":"9852_CR8","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: The matching polytope has exponential extension complexity. In: STOC\u201914-Proceedings of the 2014 ACM Symposium on Theory of Computing, pp. 263\u2013272. ACM, New York (2014)","DOI":"10.1145\/2591796.2591834"},{"issue":"1","key":"9852_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/net.10010","volume":"39","author":"JC Williams","year":"2002","unstructured":"Williams, J.C.: A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs. Networks 39(1), 53\u201360 (2002)","journal-title":"Networks"},{"key":"9852_CR10","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)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9852-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-016-9852-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9852-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T04:06:12Z","timestamp":1498363572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-016-9852-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,12]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9852"],"URL":"https:\/\/doi.org\/10.1007\/s00454-016-9852-9","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,12]]}}}