{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:09:14Z","timestamp":1752984554473},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540557067"},{"type":"electronic","value":"9783540472759"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55706-7_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:32:37Z","timestamp":1330252357000},"page":"245-257","source":"Crossref","is-referenced-by-count":6,"title":["Non-interfering network flows"],"prefix":"10.1007","author":[{"given":"C.","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Reed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Schrijver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Shepherd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0602044","volume":"2","author":"S. Baum","year":"1981","unstructured":"S. Baum, L.E. Trotter Jr., Integer rounding for polymatroid and branching optimization problems, SIAM Journal on Algebraic and Discrete Methods 2, (1981), 416\u2013425.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"M. R. Fellows, The Robertson-Seymour theorems: a survey of applications, Contemporary Mathematics, 89, 1989.","DOI":"10.1090\/conm\/089\/1006472"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","volume":"B 12","author":"D.R. Fulkerson","year":"1972","unstructured":"D.R. Fulkerson, Anti-blocking polyhedra, Journal of Combinatorial Theory, B 12, (1972), 50\u201371.","journal-title":"Journal of Combinatorial Theory"},{"key":"21_CR4","unstructured":"M. Fellows, J. Kratochvil, Personal communication, (1991)."},{"key":"21_CR5","unstructured":"R. Giles, J.B. Orlin, Verifying total dual integrality, manuscript (1981)."},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lovasz, and A. Schrijver (1981), The ellipsoid method and its consequences in Combinatorial Optimization, Combinatorica 1, 169\u2013197.","journal-title":"Combinatorica"},{"key":"21_CR7","first-page":"255","volume":"34","author":"W.-L. Hsu","year":"1987","unstructured":"W.-L. Hsu, Recognizing planar perfect graphs, J. of the A.C.M. 34, (1987), 255\u2013288.","journal-title":"J. of the A.C.M."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lovasz, and A. Schrijver (1988), Geometric algorithms and combinatorial optimization, Springer.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"21_CR9","unstructured":"C. McDiarmid, B. Reed, A. Schrijver and B. Shepherd, Non-interfering dipaths in planar digraphs, Centrum voor Wiskunde en Informatica Technical Report (1991)."},{"key":"21_CR10","unstructured":"C. McDiarmid, B. Reed, A. Schrijver and B. Shepherd, Induced circuits planar graphs, submitted to Journal of Combinatorial Theory."},{"key":"21_CR11","unstructured":"C. McDiarmid, B. Reed, A. Schrijver and B. Shepherd, Packing induced paths in planar graphs, University of Waterloo Technical Report (1990)."},{"key":"21_CR12","unstructured":"W.S. Massey, Algebraic Topology: An Introduction, Graduate texts in mathematics, 56, Springer-Verlag, (1967)."},{"key":"21_CR13","unstructured":"A. Schrijver, Theory of Integer and Linear Programming, Wiley, (1986)."},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0095-8956(91)90009-9","volume":"Bs 51","author":"A. Schrijver","year":"1991","unstructured":"A. Schrijver, Disjoint circuits of prescribed homotopies in a graph on a compact surface, J. Combinatorial Theory, Bs 51 (1991), 127\u2013159.","journal-title":"J. Combinatorial Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55706-7_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:01:24Z","timestamp":1605646884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55706-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557067","9783540472759"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-55706-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}