{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,8]],"date-time":"2023-10-08T10:51:01Z","timestamp":1696762261697},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0020-0255(95)00011-d","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"87-98","source":"Crossref","is-referenced-by-count":8,"title":["On heuristics for determining the thickness of a graph"],"prefix":"10.1016","volume":"85","author":[{"given":"Robert","family":"Cimikowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(95)00011-D_BIB1","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","article-title":"A linear algorithm for embedding planar graphs using PQ-trees","volume":"30","author":"Abe","year":"1985","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/0020-0255(95)00011-D_BIB2","first-page":"212","article-title":"Thickness of arbitrary complete graphs","volume":"143","author":"Alekseev","year":"1976","journal-title":"Mat. Sbornik"},{"key":"10.1016\/0020-0255(95)00011-D_BIB3","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\/0020-0255(95)00011-D_BIB4","first-page":"1","article-title":"On the thickness of the complete bipartite graph","volume":"60","author":"Beineke","year":"1964"},{"key":"10.1016\/0020-0255(95)00011-D_BIB5","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comp. Sys. Sci."},{"key":"10.1016\/0020-0255(95)00011-D_BIB6","series-title":"Proc. 1979 IEEE Int. Symp. Circuits and Sys.","first-page":"649","article-title":"An algorithm of maximal planarization of graphs","author":"Chiba","year":"1979"},{"key":"10.1016\/0020-0255(95)00011-D_BIB7","unstructured":"R. J. Cimikowski, An empirical analysis of some graph planarization heuristics. Unpublished."},{"key":"10.1016\/0020-0255(95)00011-D_BIB8","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. Comb. Theory Ser. B"},{"key":"10.1016\/0020-0255(95)00011-D_BIB9","series-title":"Proc. 24th ACM Symp. Theory of Comp.","first-page":"301","article-title":"Fully dynamic planarity testing","author":"Galil","year":"1992"},{"key":"10.1016\/0020-0255(95)00011-D_BIB10","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."},{"key":"10.1016\/0020-0255(95)00011-D_BIB11","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0255(95)00011-D_BIB12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0305-0483(87)90017-X","article-title":"A review of graph theory application to the facilities layout problem","volume":"15","author":"Hassan","year":"1987","journal-title":"OMEGA Int. J. Management"},{"key":"10.1016\/0020-0255(95)00011-D_BIB13","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/0020-0255(95)00011-D_BIB14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/43.21845","article-title":"O(n2) algorithms for graph planarization","volume":"8","author":"Jayakumar","year":"1989","journal-title":"IEEE Trans. Comp.-Aided Design"},{"key":"10.1016\/0020-0255(95)00011-D_BIB15","series-title":"Technical Report RUU-CS-92-03","article-title":"An O(n2) maximal planarization algorithm based on PQ-trees","author":"Kant","year":"1992"},{"key":"10.1016\/0020-0255(95)00011-D_BIB16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Sys. Tech. J."},{"key":"10.1016\/0020-0255(95)00011-D_BIB17","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/S0021-9800(67)80010-3","article-title":"The thickness of the n-dimensional cube","volume":"3","author":"Kleinert","year":"1967","journal-title":"J. Comb. Theory"},{"key":"10.1016\/0020-0255(95)00011-D_BIB18","series-title":"Proc. Int. Symp. Theory of Graphs","first-page":"215","article-title":"An algorithm for planarity testing of graphs","author":"Lempel","year":"1967"},{"key":"10.1016\/0020-0255(95)00011-D_BIB19","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/0020-0255(95)00011-D_BIB20","first-page":"9","article-title":"Determining the thickness of graphs is NP-hard","volume":"9","author":"Mansfield","year":"1983"},{"key":"10.1016\/0020-0255(95)00011-D_BIB21","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0095-8956(72)90010-X","article-title":"Decomposition de K16 en trois graphes planaires","volume":"13","author":"Mayer","year":"1972","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/0020-0255(95)00011-D_BIB22","first-page":"95","article-title":"A graph planarization algorithm and its application to random graphs","volume":"108","author":"Ozawa","year":"1981"},{"key":"10.1016\/0020-0255(95)00011-D_BIB23","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","article-title":"Automatic graph drawing and readability of diagrams","volume":"18","author":"Tamassia","year":"1988","journal-title":"IEEE Trans. Sys. Man Cyber."},{"key":"10.1016\/0020-0255(95)00011-D_BIB24","first-page":"A","article-title":"The thickness of the complete graph","volume":"23","author":"Vasak","year":"1976","journal-title":"Not. Amer. Math. Soc."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559500011D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559500011D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T17:50:37Z","timestamp":1555264237000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559500011D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["002002559500011D"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(95)00011-d","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}