{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:18Z","timestamp":1725535998972},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_2","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T07:56:42Z","timestamp":1248076602000},"page":"13-24","source":"Crossref","is-referenced-by-count":3,"title":["Plane Graphs with Parity Constraints"],"prefix":"10.1007","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Hackl","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Pilz","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]},{"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Vogtenhuber, B.: Large bichromatic point sets admit empty monochromatic 4-gons (submitted) (2008)"},{"key":"2_CR2","unstructured":"Aichholzer, O., Krasser, H.: The point set order type data base: A collection of applications and results. In: Proc. 13th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, pp. 17\u201320 (2001)"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(01)00069-4","volume":"23","author":"P. Bose","year":"2002","unstructured":"Bose, P.: On embedding an outer-planar graph in a point set. Computational Geometry: Theory and Applications\u00a023(3), 303\u2013312 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00002","volume":"1","author":"P. Bose","year":"1997","unstructured":"Bose, P., McAllister, M., Snoeyink, J.: Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications\u00a01(2), 1\u201315 (1997)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1137\/0210015","volume":"10","author":"C. Colbourn","year":"1981","unstructured":"Colbourn, C., Booth, K.: Linear time automorphism algorithms for trees, interval graphs, and planar graphs. SIAM Journal on Computing\u00a010(1), 203\u2013225 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR6","first-page":"264","volume":"11","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degree of vertices. Mat. Lapok\u00a011, 264\u2013274 (1960)","journal-title":"Mat. Lapok"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0925-7721(93)90003-O","volume":"3","author":"K. Jansen","year":"1993","unstructured":"Jansen, K.: One strike against the min-max degree triangulation problem. Computational Geometry: Theory and Applications\u00a03(2), 107\u2013120 (1993)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1&2","key":"2_CR8","first-page":"1","volume":"25","author":"L. Kettner","year":"2003","unstructured":"Kettner, L., Kirkpatrick, D., Mantler, A., Snoeyink, J., Speckmann, B., Takeuchi, F.: Tight degree bounds for pseudo-triangulations of points. Computational Geometry: Theory and Applications\u00a025(1&2), 1\u201312 (2003)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM Journal on Computing\u00a011(2), 329\u2013343 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR10","unstructured":"Pilz, A.: Parity properties of geometric graphs. Master\u2019s thesis, Graz University of Technology, Austria (in preparation, 2009)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0020-0190(92)90087-C","volume":"44","author":"A. Tamura","year":"1992","unstructured":"Tamura, A., Tamura, Y.: Degree constrained tree embedding into points in the plane. Information Processing Letters\u00a044, 211\u2013214 (1992)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T06:25:55Z","timestamp":1552112755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}