{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:21Z","timestamp":1725558861214},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_27","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"262-272","source":"Crossref","is-referenced-by-count":0,"title":["Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Suderman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"27_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.: The book thickness of a graph. Journal Combinatorial Theory, Series B\u00a027(3), 320\u2013331 (1979)","journal-title":"Journal Combinatorial Theory, Series B"},{"key":"27_CR2","unstructured":"Cahit, I., Ozel, M.: The characterization of all maximal planar graphs. Manuscript (2003), http:\/\/www.emu.edu.tr\/~cahit\/prprnt.html"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"F.R.K. Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.: Embedding graphs in books: A layout problem with applications to VLSI design. SIAM Journal on Algebraic and Discrete Methods\u00a08, 33\u201358 (1987)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"27_CR4","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":"27_CR5","unstructured":"Eades, P., McKay, B.D., Wormald, N.C.: On an edge crossing problem. In: Proc. of the 9th Australian Computer Science Conference, ACSC9, pp. 327\u2013334 (1986)"},{"issue":"4","key":"27_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.7155\/jgaa.00075","volume":"7","author":"S. Felsner","year":"2003","unstructured":"Felsner, S., Liotta, G., Wismath, S.K.: Straight-line drawings on restricted integer grids in two and three dimensions. Journal of Graph Algorithms and Appl.\u00a07(4), 363\u2013398 (2003)","journal-title":"Journal of Graph Algorithms and Appl"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-62592-5_66","volume-title":"Algorithms and Complexity","author":"U. F\u00f6\u00dfmeier","year":"1997","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Nice drawings for planar bipartite graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol.\u00a01203, pp. 122\u2013134. Springer, Heidelberg (1997)"},{"key":"27_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley, Chichester (1990)"},{"issue":"3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1142\/S0218195904001433","volume":"14","author":"M. Suderman","year":"2004","unstructured":"Suderman, M.: Pathwidth and layered drawings of trees. Int. Journal of Comp. Geometry\u00a014(3), 203\u2013225 (2004)","journal-title":"Int. Journal of Comp. Geometry"},{"issue":"2","key":"27_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02460022","volume":"48","author":"M.S. Waterman","year":"1986","unstructured":"Waterman, M.S., Griggs, J.R.: Interval graphs and maps of DNA. Bulletin of Mathematical Biology\u00a048(2), 189\u2013195 (1986)","journal-title":"Bulletin of Mathematical Biology"},{"key":"27_CR11","unstructured":"Wigderson, A.: The complexity of the hamiltonian circuit problem for maximal planar graphs. Technical Report 298, Princeton University, EECS Department (1982)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T14:46:22Z","timestamp":1591454782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}