{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T01:16:13Z","timestamp":1674177373088},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0167-6377(02)00119-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T23:55:37Z","timestamp":1034639737000},"page":"167-168","source":"Crossref","is-referenced-by-count":1,"title":["Embeddings of planar graphs that minimize the number of long-face cycles"],"prefix":"10.1016","volume":"30","author":[{"given":"Gerhard J","family":"Woeginger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00119-0_BIB1","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/jctb.2000.2026","article-title":"Face covers and the genus problem for apex graphs","volume":"82","author":"Mohar","year":"2001","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0167-6377(02)00119-0_BIB2","unstructured":"P. Mutzel, R. Weiskircher, Optimizing over all combinatorial embeddings of a planar graph, Proceedings of the Seventh Conference on Integer Programming and Combinatorial Optimization (IPCO\u20191999), Lecture Notes in Computer Science, Vol. 1610, Springer, Berlin, 1999, pp. 361\u2013376."},{"key":"10.1016\/S0167-6377(02)00119-0_BIB3","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","article-title":"How to draw a graph","volume":"13","author":"Tutte","year":"1963","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0167-6377(02)00119-0_BIB4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","article-title":"Non-separable and planar graphs","volume":"34","author":"Whitney","year":"1932","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001190?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001190?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T09:54:35Z","timestamp":1554717275000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0167637702001190"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00119-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}