{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:04Z","timestamp":1759639024582,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_25","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"301-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Straight-Line Drawability of a Planar Graph Plus an Edge"],"prefix":"10.1007","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)","key":"25_CR1"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G Di Battista","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discrete & Computational Geometry 7, 381\u2013401 (1992)","journal-title":"Discrete & Computational Geometry"},{"issue":"5","key":"25_CR3","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/120872310","volume":"42","author":"S Cabello","year":"2013","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803\u20131829 (2013)","journal-title":"SIAM J. Comput."},{"unstructured":"Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear algorithms for convex drawings of planar graphs. In: Progress in Graph Theory, pp. 153\u2013173. Academic Press, London (1984)","key":"25_CR4"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","volume":"86","author":"M Chrobak","year":"1991","unstructured":"Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci. 86(2), 243\u2013266 (1991)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Eades, P., Hong, S.H., Liotta, G., Katoh, N., Poon, S.H.: Straight-line drawability of a planar graph plus an edge (2015). ArXiv, 1504.06540","key":"25_CR6","DOI":"10.1007\/978-3-319-21840-3_25"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-004-1144-8","volume":"44","author":"P Eades","year":"2006","unstructured":"Eades, P., Feng, Q.-W., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica 44(1), 1\u201332 (2006)","journal-title":"Algorithmica"},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00453-004-1128-8","volume":"41","author":"C Gutwenger","year":"2005","unstructured":"Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. Algorithmica 41(4), 289\u2013308 (2005)","journal-title":"Algorithmica"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-32241-9_29","volume-title":"Computing and Combinatorics","author":"SH Hong","year":"2012","unstructured":"Hong, S.H., Eades, P., Liotta, G., Poon, S.H.: F\u00e1ry\u2019s theorem for 1-planar graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 335\u2013346. Springer, Heidelberg (2012)"},{"issue":"12","key":"25_CR10","doi-asserted-by":"publisher","first-page":"2368","DOI":"10.1016\/j.dam.2007.10.012","volume":"156","author":"SH Hong","year":"2008","unstructured":"Hong, S.H., Nagamochi, H.: Convex drawings of graphs with non-convex boundary constraints. Discrete Applied Mathematics 156(12), 2368\u20132380 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.7155\/jgaa.00045","volume":"6","author":"M J\u00fcnger","year":"2002","unstructured":"J\u00fcnger, M., Leipert, S.: Level planar embedding in linear time. J. Graph Algorithms Appl. 6(1), 67\u2013113 (2002)","journal-title":"J. Graph Algorithms Appl."},{"unstructured":"Nagamochi, H.: Straight-line drawability of embedded graphs. Technical Report 2013\u2013005, Graduate School of Informatics, Kyoto University (2013)","key":"25_CR12"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/jgt.3190120306","volume":"12","author":"C Thomassen","year":"1988","unstructured":"Thomassen, C.: Rectilinear drawings of graphs. Journal of Graph Theory 12(3), 335\u2013341 (1988)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T14:11:13Z","timestamp":1675865473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}