{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:18:21Z","timestamp":1725891501009},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303463"},{"type":"electronic","value":"9783642303470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30347-0_9","type":"book-chapter","created":{"date-parts":[[2012,5,31]],"date-time":"2012-05-31T02:27:55Z","timestamp":1338431275000},"page":"57-68","source":"Crossref","is-referenced-by-count":2,"title":["Conflict-Free Graph Orientations with Parity Constraints"],"prefix":"10.1007","author":[{"given":"Sarah","family":"Cannon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mashhood","family":"Ishaque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (February 1993)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge Univ. Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Cannon, S., Ishaque, M., T\u00f3th, C.D.: Conflict-free graph orientations with parity and degree constraints, arXiv:1203.3256 (2012) (manuscript)","DOI":"10.1007\/978-3-642-30347-0_9"},{"issue":"16","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.dam.2010.12.016","volume":"159","author":"A. Darmann","year":"2011","unstructured":"Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.J.: Paths, trees, and matchings under disjunctive constraints. Discrete Appl. Math.\u00a0159(16), 1726\u20131735 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9_CR5","first-page":"249","volume":"12","author":"S. Felsner","year":"2010","unstructured":"Felsner, S., Fusy, \u00c9., Noy, M.: Asymptotic enumeration of orientations. Discrete Math. Theor. Comp. Sci.\u00a012(2), 249\u2013262 (2010)","journal-title":"Discrete Math. Theor. Comp. Sci."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Felsner, S., Zickfeld, F.: On the number of planar orientations with prescribed degrees. Electron. J. Comb.\u00a015(1), article R77 (2008)","DOI":"10.37236\/801"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","volume":"28","author":"A. Frank","year":"1980","unstructured":"Frank, A.: On the orientaiton of graphs. J. Combin. Theor. B\u00a028, 251\u2013261 (1980)","journal-title":"J. Combin. Theor. B"},{"key":"9_CR8","first-page":"353","volume":"18","author":"A. Frank","year":"1976","unstructured":"Frank, A., Gy\u00e1rf\u00e1s, A.: How to orient the edges of a graph. Coll. Math. Soc. J. Bolyai\u00a018, 353\u2013364 (1976)","journal-title":"Coll. Math. Soc. J. Bolyai"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0166-218X(01)00213-X","volume":"115","author":"A. Frank","year":"2001","unstructured":"Frank, A., Jord\u00e1n, T., Szigeti, Z.: An orientation theorem with parity conditions. Discrete Appl. Math.\u00a0115, 37\u201347 (2001)","journal-title":"Discrete Appl. Math."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s004930200003","volume":"22","author":"A. Frank","year":"2002","unstructured":"Frank, A., Kir\u00e1ly, Z.: Graph orientations with edge-connection and parity constraints. Combinatorica\u00a022, 47\u201370 (2002)","journal-title":"Combinatorica"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BFb0121011","volume":"22","author":"A. Frank","year":"1984","unstructured":"Frank, A., Tardos, \u00c9., Seb\u0151, A.: Covering directed and odd cuts. Math Prog. Stud.\u00a022, 99\u2013112 (1984)","journal-title":"Math Prog. Stud."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"S.L. Hakimi","year":"1965","unstructured":"Hakimi, S.L.: On the degrees of the vertices of a directed graph. J. Franklin Inst.\u00a0279, 280\u2013308 (1965)","journal-title":"J. Franklin Inst."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/S0895480100380112","volume":"19","author":"S. Khanna","year":"2005","unstructured":"Khanna, S., Naor, J., Shepherd, F.B.: Directed network design with orientation constraints. SIAM J. Discre. Math.\u00a019, 245\u2013257 (2005)","journal-title":"SIAM J. Discre. Math."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. AMS Chelsea (2009)","DOI":"10.1090\/chel\/367"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Szab\u00f3, T., Welzl, E.: Unique sink orientations of cubes. In: Proc. 42nd FOCS, pp. 547\u2013555. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959931"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30347-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:37:24Z","timestamp":1620128244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30347-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303463","9783642303470"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30347-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}