{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:24:27Z","timestamp":1725888267211},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"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-59250-3_23","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T09:04:39Z","timestamp":1495530279000},"page":"279-291","source":"Crossref","is-referenced-by-count":0,"title":["Min-Max Theorems for Packing and Covering Odd (u,\u00a0v)-trails"],"prefix":"10.1007","author":[{"given":"Sharat","family":"Ibrahimpur","sequence":"first","affiliation":[]},{"given":"Chaitanya","family":"Swamy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s00493-008-2157-8","volume":"28","author":"M Chudnovsky","year":"2008","unstructured":"Chudnovsky, M., Cunningham, W.H., Geelen, J.: An algorithm for packing non-zero A-paths in group-labelled graphs. Combinatorica 28(2), 145\u2013161 (2008)","journal-title":"Combinatorica"},{"issue":"5","key":"23_CR2","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00493-006-0030-1","volume":"26","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Geelen, J., Gerards, B., Goddyn, L.A., Lohman, M., Seymour, P.D.: Packing non-zero A-paths in group-labelled graphs. Combinatorica 26(5), 521\u2013532 (2006)","journal-title":"Combinatorica"},{"key":"23_CR3","unstructured":"Churchley, R.: Personal communication (2016)"},{"key":"23_CR4","unstructured":"Churchley, R.: Odd disjoint trails and totally odd graph immersions. Ph.D. thesis, Simon Fraser University (2017). https:\/\/theses.lib.sfu.ca\/sites\/all\/files\/public_copies\/etd9973-thesis.pdf"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Churchley, R., Mohar, B., Wu, H.: Weak duality for packing edge-disjoint odd $$(u, v)$$ -trails. In: Proceedings of the 27th SODA, pp. 2086\u20132094 (2016)","DOI":"10.1137\/1.9781611974331.ch145"},{"key":"23_CR6","unstructured":"Geelen, J.: Personal communication (2016)"},{"key":"23_CR7","unstructured":"Ibrahimpur, S.: Packing and covering odd $$(u, v)$$ -trails in a graph. Master\u2019s thesis, University of Waterloo (2016). https:\/\/uwspace.uwaterloo.ca\/handle\/10012\/10939"},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"CL Lucchesi","year":"1978","unstructured":"Lucchesi, C.L., Younger, D.H.: A minimax theorem for directed graphs. J. Lond. Math. Soc. 17, 369\u2013374 (1978)","journal-title":"J. Lond. Math. Soc."},{"issue":"1","key":"23_CR9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF01226465","volume":"31","author":"W Mader","year":"1978","unstructured":"Mader, W.: \u00dcber die maximalzahl kreuzungsfreier $$H$$ -Wege. Archiv der Math. 31(1), 387\u2013402 (1978)","journal-title":"Archiv der Math."},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fund. Math. 10, 96\u2013115 (1927)","journal-title":"Fund. Math."},{"issue":"2","key":"23_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.jctb.2009.07.003","volume":"100","author":"N Robertson","year":"2010","unstructured":"Robertson, N., Seymour, P.: Graph minors XXIII. Nash-Williams\u2019 immersion conjecture. J. Combin. Theory Ser. B 100(2), 181\u2013205 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Schrijver, A.: A short proof of Mader\u2019 $$\\cal{S}$$ -paths theorem. JCTB 82, 319\u2013321 (2001)","DOI":"10.1006\/jctb.2000.2029"},{"key":"23_CR13","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics. Springer, Heidelberg (2003)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Schrijver, A., Seymour, P.D.: Packing odd paths. JCTB 62, 280\u2013288 (1994)","DOI":"10.1006\/jctb.1994.1070"},{"key":"23_CR15","unstructured":"Zaslavsky, T., Glossary of signed, gain graphs, allied areas. Electron. J. Combin., Dynamic Survey 9 5, 41 pp. (electronic) (1998)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T19:50:06Z","timestamp":1569354606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}