{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:43:07Z","timestamp":1725892987702},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660194"},{"type":"electronic","value":"9783540487777"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48777-8_15","type":"book-chapter","created":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T13:43:11Z","timestamp":1172842991000},"page":"191-201","source":"Crossref","is-referenced-by-count":3,"title":["Parity Constrained k-Edge-Connected Orientations"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"Kir\u00e1ly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01215915","volume":"17","author":"W. Cunningham","year":"1997","unstructured":"W. Cunningham and J. Geelen: The optimal path-matching problem, Combinatorica, Vol. 17, No. 3 (1997) pp. 315\u2013338.","journal-title":"Combinatorica"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","volume":"28","author":"A. Frank","year":"1980","unstructured":"A. Frank: On the orientation of graphs, J. Combinatorial Theory, Ser B., Vol. 28, No. 3 (1980) pp. 251\u2013261.","journal-title":"J. Combinatorial Theory, Ser B."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121011","volume":"22","author":"A. Frank","year":"1984","unstructured":"A. Frank, A. Seb\u00f6 and \u00c9. Tardos: Covering directed and odd cuts, Mathematical Programming Studies 22 (1984) pp. 99\u2013112.","journal-title":"Mathematical Programming Studies"},{"key":"15_CR4","unstructured":"A. Frank, T. Jord\u00e1n and Z. Szigeti: An orientation theorem with parity constraints, to appear in IPCO\u2019 99."},{"key":"15_CR5","unstructured":"A. Frank: Connectivity augmentation problems in network design, in: Mathematical Programming: State of the Art 1994, eds. J.R. Birge and K.G. Murty, The University of Michigan, pp. 34\u201363."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01581022","volume":"22","author":"R. Giles","year":"1982","unstructured":"R. Giles: Optimum matching forests, I-II-III, Mathematical Programming, 22 (1982) pp. 1\u201351.","journal-title":"Mathematical Programming"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0021-9800(70)80033-3","volume":"8","author":"L. Lov\u00e1sz","year":"1970","unstructured":"L. Lov\u00e1sz: Subgraphs with prescribed valencies, J. Combin. Theory, 8 (1970) pp. 391\u2013416.","journal-title":"J. Combin. Theory"},{"key":"15_CR8","first-page":"121","volume":"43","author":"L. Lov\u00e1sz","year":"1980","unstructured":"L. Lov\u00e1sz: Selecting independent lines from a family of lines in a space, Acta Sci. Univ. Szeged, 43 (1980) pp. 121\u2013131.","journal-title":"Acta Sci. Univ. Szeged"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01226062","volume":"30","author":"W. Mader","year":"1978","unstructured":"W. Mader: \u00dcber die Maximalzahl kantendisjunkter A-Wege, Archiv derMathematik (Basel) 30 (1978) pp. 325\u2013336.","journal-title":"Archiv derMathematik"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0195-6698(82)80009-7","volume":"3","author":"W. Mader","year":"1982","unstructured":"W. Mader: Konstruktion aller n-fach kantenzusammenh\u00e4ngenden Digraphen, Europ. J. Combinatorics 3 (1982) pp. 63\u201367.","journal-title":"Europ. J. Combinatorics"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","volume":"12","author":"C.St.J.A. Nash-Williams","year":"1960","unstructured":"C.St.J.A. Nash-Williams: On orientations, connectivity, and odd vertex pairings in finite graphs, Canad. J. Math. 12 (1960) pp. 555\u2013567.","journal-title":"Canad. J. Math."},{"issue":"106","key":"15_CR12","doi-asserted-by":"crossref","first-page":"604","DOI":"10.21136\/CMJ.1981.101776","volume":"31","author":"L. Nebesk\u00fd","year":"1981","unstructured":"L. Nebesk\u00fd: A new characterization of the maximum genus of a graph, Czechoslovak Mathematical Journal, 31(106), (1981) pp. 604\u2013613","journal-title":"Czechoslovak Mathematical Journal"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1112\/plms\/s3-42.1.178","volume":"42","author":"P.D. Seymour","year":"1981","unstructured":"P.D. Seymour: On odd cuts and plane multicommodity flows, Proceedings of the London Math.Soc. 42 (1981) pp. 178\u2013192.","journal-title":"Proceedings of the London Math.Soc."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W.T. Tutte","year":"1961","unstructured":"W.T. Tutte: On the problem of decomposing a graph into n connected factors, J. London Math. Soc. 36 (1961) pp. 221\u2013230.","journal-title":"J. London Math. Soc."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"W.T. Tutte","year":"1947","unstructured":"W.T. Tutte: The factorization of linear graphs, J. London Math. Soc. 22 (1947) pp. 107\u2013111.","journal-title":"J. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48777-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T10:44:06Z","timestamp":1628505846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48777-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660194","9783540487777"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48777-8_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}