{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:26Z","timestamp":1725564746790},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_17","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T01:16:57Z","timestamp":1283563017000},"page":"192-204","source":"Crossref","is-referenced-by-count":1,"title":["Drawing Planar Graphs on a Curve"],"prefix":"10.1007","author":[{"given":"E.","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"W.","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"G.","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"S. K.","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F. Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Combin. Theory, Ser. B\u00a027, 320\u2013331 (1979)","journal-title":"J. Combin. Theory, Ser. B"},{"doi-asserted-by":"crossref","unstructured":"Biedl, T.C.: Drawing planar partitions i: LL-drawings and LH-drawings. In: Symposium on Computational Geometry, pp. 287\u2013296 (1998)","key":"17_CR2","DOI":"10.1145\/276884.276917"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-63938-1_47","volume-title":"Graph Drawing","author":"P. Bose","year":"1997","unstructured":"Bose, P.: On embedding an outer-planar graph on a point set. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 25\u201336. Springer, Heidelberg (1997)"},{"issue":"1","key":"17_CR4","first-page":"1","volume":"2","author":"P. Bose","year":"1997","unstructured":"Bose, P., McAllister, M., Snoeyink, J.: Optimal algorithms to embed trees in a point set. J. of Graph Alg. and Appl.\u00a02(1), 1\u201315 (1997)","journal-title":"J. of Graph Alg. and Appl."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM Journal on Computing\u00a014, 210\u2013223 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0196-6774(89)90012-6","volume":"10","author":"N. Chiba","year":"1989","unstructured":"Chiba, N., Nishizeki, T.: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. Journal of Algorithms\u00a010, 189\u2013211 (1989)","journal-title":"Journal of Algorithms"},{"key":"17_CR7","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)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010, 41\u201351 (1990)","journal-title":"Combinatorica"},{"volume-title":"Graph Drawing","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G. (eds.): Graph Drawing. Prentice Hall, Upper Saddle River (1999)","key":"17_CR9"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)90179-1","volume":"131","author":"P. Eades","year":"1994","unstructured":"Eades, P., Whitesides, S.: Drawing graphs in two layers. Theoretical Computer Science\u00a0131(2), 361\u2013374 (1994)","journal-title":"Theoretical Computer Science"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(99)00044-X","volume":"92","author":"H. Enomoto","year":"1999","unstructured":"Enomoto, H., Miyauchi, M., Ota, K.: Lower bounds for the number of edgecrossings over the spine in a topological book embedding of a graph. Discrete Applied Mathematics\u00a092, 149\u2013155 (1999)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"17_CR12","first-page":"1","volume":"1","author":"M. J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Mutzel, P.: 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. J. of Graph Alg. and Appl.\u00a01(1), 1\u201325 (1997)","journal-title":"J. of Graph Alg. and Appl."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44969-8_1","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025, p. 1. Springer, Heidelberg (2001)"},{"issue":"1","key":"17_CR14","first-page":"115","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. J. of Graph Alg. and Appl.\u00a06(1), 115\u2013129 (2002)","journal-title":"J. of Graph Alg. and Appl."},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. on Syst., Man and Cybern.\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. on Syst., Man and Cybern."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T23:28:43Z","timestamp":1553038123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}