{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:04:36Z","timestamp":1648685076866},"reference-count":17,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":[[2001,10]]},"DOI":"10.1016\/s0020-0255(01)00126-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:19:59Z","timestamp":1027603199000},"page":"155-164","source":"Crossref","is-referenced-by-count":3,"title":["A genetic algorithm for determining the thickness of a graph"],"prefix":"10.1016","volume":"138","author":[{"given":"Erkki","family":"M\u00e4kinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"Poranen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petri","family":"Vuorenmaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(01)00126-8_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0255(97)10059-7","article-title":"Remarks on the thickness of a graph","volume":"108","author":"Aho","year":"1998","journal-title":"Info. Sci."},{"key":"10.1016\/S0020-0255(01)00126-8_BIB2","first-page":"212","article-title":"Thickness for arbitrary complete graphs","volume":"143","author":"Alekseev","year":"1976","journal-title":"Mat. Sbornik."},{"key":"10.1016\/S0020-0255(01)00126-8_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0305004100037385","article-title":"On the thickness of the complete bipartite graphs","volume":"60","author":"Beineke","year":"1964","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"10.1016\/S0020-0255(01)00126-8_BIB4","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 testing using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comp. System Sci."},{"key":"10.1016\/S0020-0255(01)00126-8_BIB5","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1137\/0222068","article-title":"An O(mlogn)-time algorithm for maximal planar subgraph problem","volume":"22","author":"Cai","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0255(01)00126-8_BIB6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0255(95)00011-D","article-title":"On heuristics for determining the thickness of a graph","volume":"85","author":"Cimikowski","year":"1995","journal-title":"Info. Sci."},{"key":"10.1016\/S0020-0255(01)00126-8_BIB7","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 (B)"},{"key":"10.1016\/S0020-0255(01)00126-8_BIB8","unstructured":"galib, software available in http:\/\/lancet.mit.edu\/ga\/"},{"key":"10.1016\/S0020-0255(01)00126-8_BIB9","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":"Info. Sci."},{"key":"10.1016\/S0020-0255(01)00126-8_BIB10","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. ACM"},{"key":"10.1016\/S0020-0255(01)00126-8_BIB11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02086607","article-title":"Maximum planar subgraph and nice embeddings: practical layout tools","volume":"16","author":"J\u00fcnger","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0255(01)00126-8_BIB12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0012-365X(97)00146-5","article-title":"The thickness of a minor-excluded class of graphs","volume":"182","author":"J\u00fcnger","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0255(01)00126-8_BIB13","unstructured":"G. Kant, An O(n2) maximal planarization algorithm based on PQ-trees, Utrecht University, Technical Report RUU-CS-92-03 (1992)"},{"key":"10.1016\/S0020-0255(01)00126-8_BIB14","unstructured":"LEDA, software available in http:\/\/www.mpi-sb.mpg.de\/LEDA\/"},{"key":"10.1016\/S0020-0255(01)00126-8_BIB15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1017\/S030500410006028X","article-title":"Determining the thickness of graphs is NP-hard","volume":"93","author":"Mansfield","year":"1983","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"10.1016\/S0020-0255(01)00126-8_BIB16","series-title":"An Introduction to Genetic Algorithms","author":"Mitchell","year":"1996"},{"key":"10.1016\/S0020-0255(01)00126-8_BIB17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/PL00007219","article-title":"The thickness of graphs: a survey","volume":"14","author":"Mutzel","year":"1998","journal-title":"Graphs and Combinatorics"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025501001268?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025501001268?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T22:21:22Z","timestamp":1556144482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025501001268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":17,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0020025501001268"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(01)00126-8","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}