{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:02Z","timestamp":1725561242905},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208310"},{"type":"electronic","value":"9783540245957"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24595-7_39","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:46:01Z","timestamp":1280393161000},"page":"419-424","source":"Crossref","is-referenced-by-count":1,"title":["Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. JACM\u00a041(1), 153\u2013180 (1994)","journal-title":"JACM"},{"key":"39_CR2","unstructured":"Bodlander, H.L.: Some classes of graphs with bounded tree width. In: Bulletin of the European Association for Theoretical Computer Science, pp. 116\u2013126 (1988)"},{"key":"39_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36151-0_4","volume-title":"Graph Drawing","author":"S. Cornelsen","year":"2002","unstructured":"Cornelsen, S., Schank, T., Wagner, D.: Drawing graphs on two and three lines. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 31\u201341. Springer, Heidelberg (2002)"},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"C.M.D. Bienstock","year":"1990","unstructured":"Bienstock, C.M.D.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica\u00a05(1), 93\u2013109 (1990)","journal-title":"Algorithmica"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-39890-5_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Giacomo Di","year":"2003","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Drawing planar graphs on a curve. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 192\u2013204. Springer, Heidelberg (2003) (to appear)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24595-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:21:59Z","timestamp":1552836119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}