{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:30Z","timestamp":1725564750069},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_18","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T01:16:57Z","timestamp":1283563017000},"page":"205-217","source":"Crossref","is-referenced-by-count":8,"title":["Tree-Partitions of k-Trees with Applications in Graph Layout"],"prefix":"10.1007","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math.\u00a023(1), 11\u201324 (1989)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"18_CR2","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.: Three-dimensional graph drawing. Algorithmica\u00a017(2), 199\u2013208 (1996)","journal-title":"Algorithmica"},{"key":"18_CR3","first-page":"149","volume-title":"Proc. 14th Canadian Conf. on Computational Geometry (CCCG 2002)","author":"E. Giacomo Di","year":"2002","unstructured":"Di Giacomo, E., Liotta, G., Wismath, S.: Drawing series-parallel graphs on a box. In: Proc. 14th Canadian Conf. on Computational Geometry (CCCG 2002), pp. 149\u2013153. The Univ. of Lethbridge, Canada (2002)"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/jgt.3190200412","volume":"20","author":"G. Ding","year":"1995","unstructured":"Ding, G., Oporowski, B.: Some results on tree decomposition of graphs. J. Graph Theory\u00a020(4), 481\u2013499 (1995)","journal-title":"J. Graph Theory"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Path-width and three-dimensional straight-line grid drawings of graphs. In: Advanced Symbolic Analysis for Compilers. LNCS, vol.\u00a02628, pp. 42\u201353. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-36151-0_5"},{"key":"18_CR6","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Tree-partitions of k-trees with applications in graph layout. Technical Report TR-02-03, School of Computer Science, Carleton Univ., Ottawa, Canada (2002)"},{"key":"18_CR7","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":"18_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.: 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)"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(00)00178-5","volume":"109","author":"J.L. Ganley","year":"2001","unstructured":"Ganley, J.L., Heath, L.S.: The pagenumber of k-trees is O(k). Discrete Appl. Math.\u00a0109(3), 215\u2013221 (2001)","journal-title":"Discrete Appl. Math."},{"key":"18_CR10","unstructured":"Gy\u00e1rf\u00e1s, A., West, D.: Multitrack interval graphs. In: 26th Southeastern Conf. on Combinat, Graph Theory and Comput., Congr. Numer, vol.\u00a0109, pp. 109\u2013116 (1995)"},{"key":"18_CR11","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. Disc. Math.\u00a05, 398\u2013412 (1992)","journal-title":"SIAM J. Disc. Math."},{"issue":"5","key":"18_CR12","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"L.S. Heath","year":"1992","unstructured":"Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput.\u00a021(5), 927\u2013958 (1992)","journal-title":"SIAM J. Comput."},{"key":"18_CR13","unstructured":"Lin, Y., Li, X.: Pagenumber and treewidth. Disc. Applied Math. (to appear)"},{"key":"18_CR14","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 Advances in discrete and computational geometry, Contemporary Mathematics 223, 251\u2013255, Amer. Math. Soc. (1999)"},{"key":"18_CR15","unstructured":"Pemmaraju, S.V.: Exploring the Powers of Stacks and Queues via Graph Layouts. PhD thesis, Virginia Polytechnic Institute and State Univ., Virginia, U.S.A (1992)"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/0-387-22444-0_4","volume-title":"Recent advances in algorithms and combinatorics","author":"B.A. Reed","year":"2003","unstructured":"Reed, B.A.: Algorithmic aspects of tree width. In: Recent advances in algorithms and combinatorics, pp. 85\u2013107. Springer, Heidelberg (2003)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0030834","volume-title":"Computing and Combinatorics","author":"S. Rengarajan","year":"1995","unstructured":"Rengarajan, S., Veni Madhavan, C.E.: Stack and queue number of 2- trees. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 203\u2013212. Springer, Heidelberg (1995)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Leuker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput.\u00a05, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/BFb0028825","volume-title":"Fundamentals of Computation Theory","author":"D. Seese","year":"1985","unstructured":"Seese, D.: Tree-partite graphs and the complexity of algorithms. In: Budach, L. (ed.) FCT 1985. LNCS, vol.\u00a0199, pp. 412\u2013421. Springer, Heidelberg (1985)"},{"key":"18_CR20","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-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T23:49:17Z","timestamp":1553039357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}