{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:33:55Z","timestamp":1725561235495},"publisher-location":"Berlin, Heidelberg","reference-count":27,"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_18","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:46:01Z","timestamp":1280393161000},"page":"190-201","source":"Crossref","is-referenced-by-count":4,"title":["Three-Dimensional Grid Drawings with Sub-quadratic Volume"],"prefix":"10.1007","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1090\/S0894-0347-1990-1065053-0","volume":"3","author":"N. Alon","year":"1990","unstructured":"Alon, N., Seymour, P., Thomas, R.: A separator theorem for nonplanar graphs. J. Amer. Math. Soc.\u00a03(4), 801\u2013808 (1990)","journal-title":"J. Amer. Math. Soc."},{"issue":"1-2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR3","unstructured":"Bose, P., Czyzowicz, J., Morin, P., Wood, D.R.: The maximum number of edges in a three-dimensional grid-drawing. In: Proc. 19th European Workshop on Computational Geometry, Germany, pp. 101\u2013103. Univ. of Bonn. (2003)"},{"issue":"2","key":"18_CR4","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. Inform. Process. Lett.\u00a063(2), 97\u2013102 (1997)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R.F. Cohen","year":"1996","unstructured":"Cohen, R.F., Eades, P., Lin, T., Ruskey, F.: Threedimensional graph drawing. Algorithmica\u00a017(2), 199\u2013208 (1996)","journal-title":"Algorithmica"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-24595-7_22","volume-title":"Graph Drawing","author":"E. Giacomo Di","year":"2004","unstructured":"Di Giacomo, E.: Drawing series-parallel graphs on restricted integer 3D grids. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 238\u2013246. Springer, Heidelberg (2004)"},{"key":"18_CR7","first-page":"149","volume-title":"Proc. 14th Canadian Conf. on Computational Geometry (CCCG 2002)","author":"E.D. Giacomo","year":"2002","unstructured":"Giacomo, E.D., Liotta, G., Wismath, S.: Drawing seriesparallel graphs on a box. In: Proc. 14th Canadian Conf. on Computational Geometry (CCCG 2002), pp. 149\u2013153. The Univ. of Lethbridge, Canada (2002)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-24595-7_20","volume-title":"Graph Drawing","author":"E.D. Giacomo","year":"2004","unstructured":"Giacomo, E.D., Meijer, H.: Track drawings of graphs with constant queue number. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 214\u2013225. Springer, Heidelberg (2004)"},{"issue":"5","key":"18_CR9","first-page":"643","volume":"34","author":"H.N. Djidjev","year":"1981","unstructured":"Djidjev, H.N.: A separator theorem. C. R. Acad. Bulgare Sci.\u00a034(5), 643\u2013645 (1981)","journal-title":"C. R. Acad. Bulgare Sci."},{"key":"18_CR10","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.R.: Path-width and threedimensional 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":"18_CR11","unstructured":"Dujmovi\u0107, V., Wood, D.R.: New results in graph layout. Tech. Report TR-2003-04, School of Computer Science, Carleton Univ., Ottawa, Canada (2003)"},{"key":"18_CR12","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 applications in graph layout. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 205\u2013217. Springer, Heidelberg (2003) (to appear)"},{"key":"18_CR13","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"609","volume-title":"Infinite and Finite Sets","author":"P. Erd\u0151s","year":"1975","unstructured":"Erd\u0151s, P., Lov\u00e1sz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Infinite and Finite Sets. Colloq. Math. Soc. J\u00e1nos Bolyai, vol.\u00a010, pp. 609\u2013627. North-Holland, Amsterdam (1975)"},{"key":"18_CR14","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.: 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":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-45477-2_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Fertin","year":"2001","unstructured":"Fertin, G., Raspaud, A., Reed, B.: On star coloring of graphs. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 140\u2013153. Springer, Heidelberg (2001)"},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","volume":"5","author":"J.R. Gilbert","year":"1984","unstructured":"Gilbert, J.R., Hutchinson, J.P., Tarjan, R.E.: A separator theorem for graphs of bounded genus. J. Algorithms\u00a05(3), 391\u2013407 (1984)","journal-title":"J. Algorithms"},{"key":"18_CR17","unstructured":"Gy\u00e1rf\u00e1s, A., West, D.: Multitrack interval graphs. In: Proc. 26th Southeastern Int\u2019l Conf. on Combinatorics, Graph Theory and Computing. Congr. Numer., vol.\u00a0109, pp. 109\u2013116 (1995)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-24595-7_19","volume-title":"Graph Drawing","author":"T. Hasunuma","year":"2004","unstructured":"Hasunuma, T.: Laying out iterated line digraphs using queues. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 202\u2013213. Springer, Heidelberg (2004)"},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0405031","volume":"5","author":"L.S. Heath","year":"1992","unstructured":"Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math.\u00a05(3), 398\u2013412 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"18_CR20","first-page":"332","volume":"24","author":"P.J. Heawood","year":"1890","unstructured":"Heawood, P.J.: Map colour theorem. Quart. J. Pure Appl. Math.\u00a024, 332\u2013338 (1890)","journal-title":"Quart. J. Pure Appl. Math."},{"key":"18_CR21","first-page":"37","volume":"38","author":"A.V. Kostochka","year":"1982","unstructured":"Kostochka, A.V.: The minimum Hadwiger number for graphs with a given mean degree of vertices. Metody Diskret. Analiz.\u00a038, 37\u201358 (1982)","journal-title":"Metody Diskret. Analiz."},{"key":"18_CR22","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph colouring and the probabilistic method","author":"M. Molloy","year":"2002","unstructured":"Molloy, M., Reed, B.: Graph colouring and the probabilistic method. Algorithms and Combinatorics, vol.\u00a023. Springer, Heidelberg (2002)"},{"key":"18_CR23","series-title":"Algorithms and Combinatorics","volume-title":"Discrete and Computational Geometry, The Goodman-Pollack Festschrift","author":"J. Ne\u0161et\u0159il","year":"2003","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Colorings and homomorphisms of minor closed classes. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry, The Goodman-Pollack Festschrift. Algorithms and Combinatorics, vol.\u00a025, Springer, Heidelberg (2003)"},{"key":"18_CR24","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); Also in Chazelle, B., Goodman, J.E., Pollack, R. (eds.): Advances in discrete and computational geometry. Contempory Mathematics, vol. 223, pp. 251\u2013255. Amer. Math. Soc., Providence (1999)"},{"key":"18_CR25","unstructured":"Poranen, T.: A new algorithm for drawing series-parallel digraphs in 3D. Tech. Report A-2000-16, Dept. of Computer and Information Sciences, Univ. of Tampere, Finland (2000)"},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A. Thomason","year":"1984","unstructured":"Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc.\u00a095(2), 261\u2013265 (1984)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"18_CR27","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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:20:35Z","timestamp":1552836035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}