{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:22:09Z","timestamp":1760440929346},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_22","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:46:01Z","timestamp":1280378761000},"page":"238-246","source":"Crossref","is-referenced-by-count":6,"title":["Drawing Series-Parallel Graphs on Restricted Integer 3D Grids"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","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: Ala yout problem with applications to VLSI design. SIAM J. on Alg. and Disc. Methods\u00a08, 33\u201358 (1987)","journal-title":"SIAM J. on Alg. and Disc. Methods"},{"key":"22_CR2","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica\u00a015(4), 302\u2013318 (1996)","journal-title":"Algorithmica"},{"key":"22_CR4","unstructured":"Di Giacomo, E., Liotta, G., Meijer, H.: 3D straight-line drawings of k-trees (submitted for publication)"},{"key":"22_CR5","unstructured":"Di Giacomo, E., Liotta, G., Wismath, S.K.: Drawing series-parallel graphs on a box. In: Proc. CCCG 2002 (2002)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-36151-0_5","volume-title":"Graph Drawing","author":"V. Dujmovi\u0107","year":"2002","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.: Pathwidth and three-dimensional straight line grid drawings of graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 42\u201353. Springer, Heidelberg (2002)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-39890-5_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"V. Dujmovi\u0107","year":"2003","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Tree-partitions of k-trees with application in graph layout. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 205\u2013217. Springer, Heidelberg (2003)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-45848-4_26","volume-title":"Graph Drawing","author":"S. Felsner","year":"2002","unstructured":"Felsner, S., Liotta, G., Wismath, S.K.: Straight line drawings on restricted integer grids in two and three dimensions. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 328\u2013342. Springer, Heidelberg (2002)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-36206-1_31","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"D.R. Wood","year":"2002","unstructured":"Wood, D.R.: Queue layouts, tree-width, and three-dimensional graph drawing. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 348\u2013359. Springer, Heidelberg (2002)"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T11:22:46Z","timestamp":1552821766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}