{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:03:17Z","timestamp":1725552197967},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_13","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"129-140","source":"Crossref","is-referenced-by-count":3,"title":["Graph Treewidth and Geometric Thickness Parameters"],"prefix":"10.1007","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0012-365X(90)90142-5","volume":"81","author":"Y. Aoki","year":"1990","unstructured":"Aoki, Y.: The star-arboricity of the complete regular multipartite graphs. Discrete Math.\u00a081(2), 115\u2013122 (1990)","journal-title":"Discrete Math."},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F.R. Bernhart","year":"1979","unstructured":"Bernhart, F.R., Kainen, P.C.: The book thickness of a graph. J. Combin. Theory Ser. B\u00a027(3), 320\u2013331 (1979)","journal-title":"J. Combin. Theory Ser. B"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-36151-0_16","volume-title":"Graph Drawing","author":"W.E. Giacomo Di","year":"2002","unstructured":"Di Giacomo, W.E., Didimo, G., Liotta, S.K.: Book embeddings and point-set embeddings of series-parallel digraphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 162\u2013173. Springer, Heidelberg (2002)"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s004930050001","volume":"18","author":"G. Ding","year":"1998","unstructured":"Ding, G., Oporowski, B., Sanders, D.P., Vertigan, D.: Partitioning graphs of bounded tree-width. Combinatorica\u00a018(1), 1\u201312 (1998)","journal-title":"Combinatorica"},{"issue":"2","key":"13_CR5","first-page":"339","volume":"6","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci.\u00a06(2), 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. arXiv.org:math.CO\/0503553 (2005)","DOI":"10.1007\/11618058_13"},{"issue":"3","key":"13_CR7","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":"13_CR8","series-title":"London Math. Soc. Lecture Note Ser.","first-page":"57","volume-title":"Proc. British Combinatorial Conf.","author":"R.K. Guy","year":"1974","unstructured":"Guy, R.K.: Outerthickness and outercoarseness of graphs. In: Proc. British Combinatorial Conf. London Math. Soc. Lecture Note Ser., vol.\u00a013, pp. 57\u201360. Cambridge Univ. Press, Cambridge (1974)"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0255(91)90052-V","volume":"54","author":"J.H. Halton","year":"1991","unstructured":"Halton, J.H.: On the thickness of graphs of given degree. Inform. Sci.\u00a054(3), 219\u2013238 (1991)","journal-title":"Inform. Sci."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF02992822","volume":"39","author":"P.C. Kainen","year":"1973","unstructured":"Kainen, P.C.: Thickness and coarseness of graphs. Abh. Math. Sem. Univ. Hamburg\u00a039, 88\u201395 (1973)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P. Mutzel","year":"1998","unstructured":"Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: a survey. Graphs Combin.\u00a014(1), 59\u201373 (1998)","journal-title":"Graphs Combin."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"C.S..J.A. Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. J. London Math. Soc.\u00a039, 12 (1964)","journal-title":"J. London Math. Soc."},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J. Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs Combin.\u00a017(4), 717\u2013728 (2001)","journal-title":"Graphs Combin."},{"key":"13_CR14","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":"13_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M. Yannakakis","year":"1986","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. System Sci.\u00a038, 36\u201367 (1986)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:04:11Z","timestamp":1605643451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11618058_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}