{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:12:46Z","timestamp":1758823966731},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00493-008-2157-8","type":"journal-article","created":{"date-parts":[[2008,4,26]],"date-time":"2008-04-26T11:55:19Z","timestamp":1209210919000},"page":"145-161","source":"Crossref","is-referenced-by-count":20,"title":["An algorithm for packing non-zero A-paths in group-labelled graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Maria","family":"Chudnovsky","sequence":"first","affiliation":[]},{"given":"William H.","family":"Cunningham","sequence":"additional","affiliation":[]},{"given":"Jim","family":"Geelen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,27]]},"reference":[{"issue":"5","key":"2157_CR1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00493-006-0030-1","volume":"26","author":"M. Chudnovsky","year":"2006","unstructured":"M. Chudnovsky, J. Geelen, B. Gerards, L. Goddyn, M. Lohman and P. Seymour: Packing non-zero A-paths in group-labelled graphs, Combinatorica 26(5) (2006), 521\u2013532.","journal-title":"Combinatorica"},{"key":"2157_CR2","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L. Lov\u00e1sz","year":"1980","unstructured":"L. Lov\u00e1sz: Matroid matching and some applications, J. Combin. Theory Ser. B 28 (1980), 208\u2013236.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2157_CR3","unstructured":"L. Lov\u00e1sz and M. D. Plummer: Matching Theory, North-Holland, 1986."},{"key":"2157_CR4","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/BF01226464","volume":"31","author":"W. Mader","year":"1978","unstructured":"W. Mader: \u00dcber die Maximalzahl kreuzungsfreier H-Wege, Archiv der Mathematik (Basel) 31 (1978), 382\u2013402.","journal-title":"Archiv der Mathematik (Basel)"},{"key":"2157_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/978-3-540-25960-2_20","volume-title":"Integer Programming and Combinatorial Optimization (Proceedings 10th IPCO Conference, New York, 2004; D. Bienstock, G. Nemhauser, eds.)","author":"A. Seb\u0151","year":"2004","unstructured":"A. Seb\u0151 and L. Szeg\u0151: The path-packing structure of graphs, in: Integer Programming and Combinatorial Optimization (Proceedings 10th IPCO Conference, New York, 2004; D. Bienstock, G. Nemhauser, eds.) [Lecture Notes in Computer Science 3064], Springer, Berlin, 2004, pp. 256\u2013270."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2157-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-008-2157-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2157-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:45Z","timestamp":1559093565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-008-2157-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["2157"],"URL":"https:\/\/doi.org\/10.1007\/s00493-008-2157-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}