{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:36:00Z","timestamp":1766378160261},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002253"},{"type":"electronic","value":"9783540362067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36206-1_31","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:23:08Z","timestamp":1187248988000},"page":"348-359","source":"Crossref","is-referenced-by-count":16,"title":["Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing"],"prefix":"10.1007","author":[{"given":"David R.","family":"Wood","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"2","author":"N. Alon","year":"1991","unstructured":"N. Alon, C. McDiarmid, and B. Reed, Acyclic coloring of graphs. Random Structures Algorithms, 2(3):277\u2013288, 1991.","journal-title":"Random Structures Algorithms"},{"issue":"1\u20132","key":"31_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":"H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1\u20132):1\u201345, 1998.","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jagm.1996.0854","volume":"24","author":"H. L. Bodlaender","year":"1997","unstructured":"H. L. Bodlaender and J. Engelfriet, Domino treewidth. J. Algorithms, 24(1):94\u2013123, 1997.","journal-title":"J. Algorithms"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0020-0190(97)00098-7","volume":"63","author":"T. Calamoneri","year":"1997","unstructured":"T. Calamoneri and A. Sterbini, 3D straight-line grid drawing of 4-colorable graphs. Inform. Process. Lett., 63(2):97\u2013102, 1997.","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"31_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R. F. Cohen","year":"1996","unstructured":"R. F. Cohen, P. Eades, T. Lin, and F. Ruskey, Three-dimensional graph drawing. Algorithmica, 17(2):199\u2013208, 1996.","journal-title":"Algorithmica"},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack, How to draw a planar graph on a grid. Combinatorica, 10(1):41\u201351, 1990.","journal-title":"Combinatorica"},{"key":"31_CR7","unstructured":"E. di Giacomo, G. Liotta, and S. Wismath, Drawing series-parallel graphs on a box. In S. Wismath, ed., Proc. 14th Canadian Conf. on Computational Geometry (CCCG\u2019 02), The University of Lethbridge, Canada, 2002."},{"key":"31_CR8","unstructured":"J. D\u00edaz, J. Petit, and M. Serna, A survey of graph layout problems. ACM Comput. Surveys, to appear."},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"R. P. Dilworth, A decomposition theorem for partially ordered sets. Ann. of Math. (2), 51:161\u2013166, 1950.","journal-title":"Ann. of Math. (2)"},{"issue":"4","key":"31_CR10","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/jgt.3190200412","volume":"20","author":"G. Ding","year":"1995","unstructured":"G. Ding and B. Oporowski, Some results on tree decomposition of graphs. J. Graph Theory, 20(4):481\u2013499, 1995.","journal-title":"J. Graph Theory"},{"issue":"1\u20133","key":"31_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0012-365X(94)00337-I","volume":"149","author":"G. Ding","year":"1996","unstructured":"G. Ding and B. Oporowski, On tree-partitions of graphs. Discrete Math., 149(1\u20133):45\u201358, 1996.","journal-title":"Discrete Math."},{"key":"31_CR12","unstructured":"V. Dujmovi\u0107, P. Morin, and D. R. Wood, Path-width and three-dimensional straight-line grid drawings of graphs. In M. Goodrich, ed., Proc. 10th International Symp. on Graph Drawing (GD\u2019 02), Lecture Notes in Comput. Sci., Springer, to appear."},{"key":"31_CR13","series-title":"Tech. Rep.","volume-title":"Tree-partitions of k-trees with applications in graph layout","author":"V. Dujmovi\u0107","year":"2002","unstructured":"V. Dujmovi\u0107 and D. R. Wood, Tree-partitions of k-trees with applications in graph layout. Tech. Rep. TR-02-03, School of Computer Science, Carleton University, Ottawa, Canada, 2002."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"S. Felsner, S. Wismath, and G. Liotta, Straight-line drawings on restricted integer grids in two and three dimensions. In P. Mutzel, M. J\u00fcnger, and S. Leipert, eds., Proc. 9th International Symp. on Graph Drawing (GD\u2019 01), vol. 2265 of Lecture Notes in Comput. Sci., pp. 328\u2013342, Springer, 2002.","DOI":"10.1007\/3-540-45848-4_26"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"G. Fertin, A. Raspaud, and B. Reed, On star coloring of graphs. In A. Branst\u00e4dt and V. B. Le, eds., Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG\u2019 01), vol. 2204 of Lecture Notes in Comput. Sci., pp. 140\u2013153, Springer, 2001.","DOI":"10.1007\/3-540-45477-2_14"},{"issue":"3","key":"31_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(00)00178-5","volume":"109","author":"J. L. Ganley","year":"2001","unstructured":"J. L. Ganley and L. S. Heath, The pagenumber of k-trees is O(k). Discrete Appl. Math., 109(3):215\u2013221, 2001.","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M. R. Garey","year":"1980","unstructured":"M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou, The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discrete Methods, 1(2):216\u2013227, 1980.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0012-365X(91)90436-6","volume":"97","author":"R. Halin","year":"1991","unstructured":"R. Halin, Tree-partitions of infinite graphs. Discrete Math., 97:203\u2013217, 1991.","journal-title":"Discrete Math."},{"issue":"3","key":"31_CR19","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0405031","volume":"5","author":"L. S. Heath","year":"1992","unstructured":"L. S. Heath, F. T. Leighton, and A. L. Rosenberg, Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math., 5(3):398\u2013412, 1992.","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"31_CR20","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"L. S. Heath","year":"1992","unstructured":"L. S. Heath and A. L. Rosenberg, Laying out graphs using queues. SIAM J. Comput., 21(5):927\u2013958, 1992.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"31_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jagm.1994.1027","volume":"17","author":"S. M. Malitz","year":"1994","unstructured":"S. M. Malitz, Graphs with E edges have pagenumber O(\u221aE). J. Algorithms, 17(1):71\u201384, 1994.","journal-title":"J. Algorithms"},{"key":"31_CR22","series-title":"Tech. Rep.","volume-title":"Colorings and homomorphisms of minor closed classes","author":"J. Nesetril","year":"2001","unstructured":"J. Nesetril and P. Ossona de Mendez, Colorings and homomorphisms of minor closed classes. Tech. Rep. 2001-025, Institut Teoretick\u00e9 Informatiky, Universita Karlova v Praze, Czech Republic, 2001."},{"key":"31_CR23","unstructured":"J. Pach, T. Thiele, and G. T\u00f3th, Three-dimensional grid drawings of graphs. In G. Di Battista, ed., Proc. 5th International Symp. on Graph Drawing (GD\u2019 97), vol. 1353 of Lecture Notes in Comput. Sci., pp. 47\u201351, Springer, 1998."},{"key":"31_CR24","volume-title":"Exploring the Powers of Stacks and Queues via Graph Layouts","author":"S. V. Pemmaraju","year":"1992","unstructured":"S. V. Pemmaraju, Exploring the Powers of Stacks and Queues via Graph Layouts. Ph.D. thesis, Virginia Polytechnic Institute and State University, Virginia, U.S.A., 1992."},{"key":"31_CR25","series-title":"Tech. Rep.","volume-title":"A new algorithm for drawing series-parallel digraphs in 3D","author":"T. Poranen","year":"2000","unstructured":"T. Poranen, A new algorithm for drawing series-parallel digraphs in 3D. Tech. Rep. A-2000-16, Dept. of Computer and Information Sciences, University of Tampere, Finland, 2000."},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"S. Rengarajan and C. E. Veni Madhavan, Stack and queue number of 2-trees. In D. Ding-Zhu and L. Ming, eds., Proc. 1st Annual International Conf. on Computing and Combinatorics (COCOON\u2019 95), vol. 959 of Lecture Notes in Comput. Sci., pp. 203\u2013212, Springer, 1995.","DOI":"10.1007\/BFb0030834"},{"issue":"4","key":"31_CR27","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W. Schnyder","year":"1989","unstructured":"W. Schnyder, Planar graphs and poset dimension. Order, 5(4):323\u2013343, 1989.","journal-title":"Order"},{"key":"31_CR28","doi-asserted-by":"crossref","unstructured":"D. Seese, Tree-partite graphs and the complexity of algorithms. In L. Budach, ed., Proc. International Conf. on Fundamentals of Computation Theory, vol. 199 of Lecture Notes in Comput. Sci., pp. 412\u2013421, Springer, 1985.","DOI":"10.1007\/BFb0028825"},{"issue":"1","key":"31_CR29","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1006\/jagm.1999.1049","volume":"34","author":"F. Shahrokhi","year":"2000","unstructured":"F. Shahrokhi and W. Shi, On crossing sets, disjoint sets, and pagenumber. J. Algorithms, 34(1):40\u201353, 2000.","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36206-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:07:53Z","timestamp":1556770073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36206-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002253","9783540362067"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-36206-1_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}