{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T14:16:13Z","timestamp":1673014573039},"reference-count":28,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3516,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0012-365x(03)00240-1","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T10:49:36Z","timestamp":1063363776000},"page":"221-234","source":"Crossref","is-referenced-by-count":3,"title":["Geometric thickness in a grid"],"prefix":"10.1016","volume":"273","author":[{"given":"David R.","family":"Wood","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20133","key":"10.1016\/S0012-365X(03)00240-1_BIB1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0255(91)90012-J","article-title":"Complexities of layouts in three-dimensional VLSI circuits","volume":"55","author":"Aboelaze","year":"1991","journal-title":"Inform. Sci."},{"issue":"1","key":"10.1016\/S0012-365X(03)00240-1_BIB2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01759038","article-title":"Multilayer grid embeddings for VLSI","volume":"6","author":"Aggarwal","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0012-365X(03)00240-1_BIB3","first-page":"212","article-title":"Thickness of arbitrary complete graphs","volume":"101","author":"Alekseev","year":"1976","journal-title":"Mat. Sb."},{"key":"10.1016\/S0012-365X(03)00240-1_BIB4","doi-asserted-by":"crossref","first-page":"850","DOI":"10.4153\/CJM-1965-084-2","article-title":"The thickness of the complete graph","volume":"17","author":"Beineke","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(03)00240-1_BIB5","series-title":"Graph Theory and Theoretical Physics","first-page":"139","article-title":"The decomposition of complete graphs into planar subgraphs","author":"Beineke","year":"1967"},{"issue":"11","key":"10.1016\/S0012-365X(03)00240-1_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0898-1221(97)00214-9","article-title":"Biplanar graphs","volume":"34","author":"Beineke","year":"1997","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"10.1016\/S0012-365X(03)00240-1_BIB7","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","article-title":"The book thickness of a graph","volume":"27","author":"Bernhart","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/S0012-365X(03)00240-1_BIB8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0608002","article-title":"Embedding graphs in books","volume":"8","author":"Chung","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0012-365X(03)00240-1_BIB9","series-title":"Proceedings of the 21st Midwest Symposium on Circuits and Systems","first-page":"32","article-title":"The fixed outerthickness of graphs","author":"Cottafava","year":"1978"},{"key":"10.1016\/S0012-365X(03)00240-1_BIB10","unstructured":"A.M. Dean, J.P. Hutchinson, Relations among embedding parameters for graphs, in: Graph Theory, Combinatorics, and Applications, Vol. 1, Wiley, New York, 1991, pp. 287\u2013296."},{"issue":"1","key":"10.1016\/S0012-365X(03)00240-1_BIB11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0095-8956(91)90100-X","article-title":"On the thickness and arboricity of a graph","volume":"52","author":"Dean","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"10.1016\/S0012-365X(03)00240-1_BIB12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7155\/jgaa.00023","article-title":"Geometric thickness of complete graphs","volume":"4","author":"Dillencourt","year":"2000","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"10.1016\/S0012-365X(03)00240-1_BIB13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. Math."},{"key":"10.1016\/S0012-365X(03)00240-1_BIB14","series-title":"Proceedings of the 10th International Symposium on Graph Drawing (GD \u201902)","first-page":"150","article-title":"Separating thickness from geometric thickness","volume":"Vol. 2528","author":"Eppstein","year":"2002"},{"key":"10.1016\/S0012-365X(03)00240-1_BIB15","first-page":"229","article-title":"On straight line representation of planar graphs","volume":"11","author":"F\u00e1ry","year":"1948","journal-title":"Acta Univ. Szeged. Sect. Sci. Math."},{"issue":"3","key":"10.1016\/S0012-365X(03)00240-1_BIB16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0255(91)90052-V","article-title":"On the thickness of graphs of given degree","volume":"54","author":"Halton","year":"1991","journal-title":"Inform. Sci."},{"issue":"5","key":"10.1016\/S0012-365X(03)00240-1_BIB17","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/0221055","article-title":"Laying out graphs using queues","volume":"21","author":"Heath","year":"1992","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0012-365X(03)00240-1_BIB18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","article-title":"On representations of some thickness-two graphs","volume":"13","author":"Hutchinson","year":"1999","journal-title":"Comput. Geom."},{"key":"10.1016\/S0012-365X(03)00240-1_BIB19","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF02992822","article-title":"Thickness and coarseness of graphs","volume":"39","author":"Kainen","year":"1973","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/S0012-365X(03)00240-1_BIB20","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"issue":"1","key":"10.1016\/S0012-365X(03)00240-1_BIB21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/jagm.1994.1028","article-title":"Genus g graphs have pagenumber O(g)","volume":"17","author":"Malitz","year":"1994","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/S0012-365X(03)00240-1_BIB22","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/jagm.1994.1027","article-title":"Graphs with E edges have pagenumber O(E)","volume":"17","author":"Malitz","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(03)00240-1_BIB23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0095-8956(72)90010-X","article-title":"D\u00e9composition de K16 en trois graphes planaires","volume":"13","author":"Mayer","year":"1972","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/S0012-365X(03)00240-1_BIB24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/PL00007219","article-title":"The thickness of graphs","volume":"14","author":"Mutzel","year":"1998","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(03)00240-1_BIB25","doi-asserted-by":"crossref","first-page":"26","DOI":"10.2307\/2308012","article-title":"A remark on Stirling's formula","volume":"62","author":"Robbins","year":"1955","journal-title":"Amer. Math. Monthly"},{"issue":"1","key":"10.1016\/S0012-365X(03)00240-1_BIB26","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1006\/jagm.1999.1049","article-title":"On crossing sets, disjoint sets, and pagenumber","volume":"34","author":"Shahrokhi","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(03)00240-1_BIB27","first-page":"26","article-title":"Bemerkung zum Vierfarbenproblem","volume":"46","author":"Wagner","year":"1936","journal-title":"Jber. Deutsch. Math.-Verein."},{"issue":"2","key":"10.1016\/S0012-365X(03)00240-1_BIB28","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0196-6774(02)00249-3","article-title":"Degree constrained book embeddings","volume":"45","author":"Wood","year":"2002","journal-title":"J. Algorithms"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002401?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002401?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T08:21:19Z","timestamp":1550996479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0012365X03002401"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00240-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}