{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:21Z","timestamp":1725515301043},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727910"},{"type":"electronic","value":"9783540727927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72792-7_13","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T08:07:11Z","timestamp":1182758831000},"page":"158-166","source":"Crossref","is-referenced-by-count":8,"title":["On Integer Programming and the Branch-Width of the Constraint Matrix"],"prefix":"10.1007","author":[{"given":"William H.","family":"Cunningham","sequence":"first","affiliation":[]},{"given":"Jim","family":"Geelen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Handbook of Theoretical Computer Science, vol. B","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logical approach. In: van Leeuwnen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, North-Holland, Amsterdam (1990)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/0215066","volume":"15","author":"W.H. Cunningham","year":"1986","unstructured":"Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput.\u00a015, 948\u2013957 (1986)","journal-title":"SIAM J. Comput."},{"key":"13_CR3","series-title":"A series of books in the mathematical sciences","volume-title":"Computers and Intractability. A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A guide to the theory of NP-completeness. A series of books in the mathematical sciences. H. Freeman and Co., San Francisco (1979)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Hlin\u011bn\u00fd, P.: Branch-width, parse trees and monadic second-order logic for matroids. Manuscript (2002)","DOI":"10.1007\/3-540-36494-3_29"},{"key":"13_CR5","unstructured":"Lueker, G.S.: Two NP-complete problems in non-negative integer programming. Report No. 178, Department of Computer Science, Princeton University, Princeton, N.J. (1975)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Combin. Theory, Ser. B\u00a096, 514\u2013528 (2006)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"13_CR7","unstructured":"Oum, S., Seymour, P.D.: Testing branch-width. To appear in J. Combin. Theory, Ser. B"},{"key":"13_CR8","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, New York (1992)"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"C.H. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. Assoc. Comput. Mach.\u00a028, 765\u2013768 (1981)","journal-title":"J. Assoc. Comput. Mach."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. X. Obstructions to tree-decomposition. J. Combin. Theory, Ser. B\u00a052, 153\u2013190 (1991)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"89","author":"N. Robertson","year":"2003","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. XVI. Excluding a non-planar graph. J. Combin. Theory, Ser. B\u00a089, 43\u201376 (2003)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P.D. Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of regular matroids. J. Combin. Theory, Ser. B\u00a028, 305\u2013359 (1980)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"144","DOI":"10.2307\/1993243","volume":"88","author":"W.T. Tutte","year":"1958","unstructured":"Tutte, W.T.: A homotopy theorem for matroids, I, II. Trans. Amer. Math. Soc.\u00a088, 144\u2013174 (1958)","journal-title":"Trans. Amer. Math. Soc."}],"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-540-72792-7_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:05:17Z","timestamp":1605744317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727910","9783540727927"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_13","relation":{},"subject":[]}}