{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:56Z","timestamp":1725552176714},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_8","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"83-88","source":"Crossref","is-referenced-by-count":1,"title":["Drawing K n in Three Dimensions with One Bend Per Edge"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Devillers","sequence":"first","affiliation":[]},{"given":"Hazel","family":"Everett","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Lazard","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Pentcheva","sequence":"additional","affiliation":[]},{"given":"Stephen K.","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.7155\/jgaa.00079","volume":"8","author":"P. Bose","year":"2004","unstructured":"Bose, P., Czyzowicz, J., Morin, P., Wood, D.R.: The maximum number of edges in a three-dimensional grid-drawing. JGAA\u00a08(1), 21\u201326 (2004)","journal-title":"JGAA"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0020-0190(97)00098-7","volume":"63","author":"T. Calamoneri","year":"1997","unstructured":"Calamoneri, T., Sterbini, A.: 3D straight-line grid drawing of 4-colorable graphs. Information Processing Letters\u00a063(2), 97\u2013102 (1997)","journal-title":"Information Processing Letters"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R.F. Cohen","year":"1997","unstructured":"Cohen, R.F., Eades, P., Lin, T., Ruskey, F.: Three-dimensional graph drawing. Algorithmica\u00a017, 199\u2013208 (1997)","journal-title":"Algorithmica"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/S0097539702416141","volume":"34","author":"V. Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. of Computing\u00a034(3), 553\u2013579 (2005)","journal-title":"SIAM J. of Computing"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-24595-7_18","volume-title":"Graph Drawing","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Three-dimensional grid drawings with sub-quadratic volume. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 190\u2013201. Springer, Heidelberg (2004)"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.46298\/dmtcs.346","volume":"7","author":"V. Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Stacks, Queues and Tracks: Layouts of Graph Subdivisions. Discrete Math and Theoretical Computer Science\u00a07, 155\u2013202 (2005)","journal-title":"Discrete Math and Theoretical Computer Science"},{"key":"8_CR7","unstructured":"Dyck, B., Joevenazzo, J., Nickle, E., Wilsdon, J., Wismath, S.: Drawing K n in 3D with 2 Bends Per Edge, U. of Lethbridge Tech. Rep. #CS-01-04: 2\u20137 (January 2004)"},{"issue":"4","key":"8_CR8","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.: Straight-line drawings on restricted integer grids in two and three dimensions. JGAA\u00a07(4), 363\u2013398 (2003)","journal-title":"JGAA"},{"issue":"1","key":"8_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: few bends suffice for planar graphs. JGAA\u00a06(1), 115\u2013129 (2002)","journal-title":"JGAA"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Morin, P., Wood, D.R.: Three-dimensional 1-bend graph drawings. JGAA\u00a08(3) (2004)","DOI":"10.7155\/jgaa.00095"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-63938-1_49","volume-title":"Graph Drawing","author":"J. Pach","year":"1997","unstructured":"Pach, J., Thiele, T., T\u00f3th, G.: Three-dimensional grid drawings of graphs. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 47\u201351. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T07:07:15Z","timestamp":1683356835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11618058_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}