{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T15:48:03Z","timestamp":1744904883073},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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 Processing Letters"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0020-0190(97)00203-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"317-322","source":"Crossref","is-referenced-by-count":13,"title":["A note on approximating graph genus"],"prefix":"10.1016","volume":"61","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saroja P.","family":"Kanchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arkady","family":"Kanevsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00203-2_BIB1","series-title":"Proc. 33rd IEEE Symp. on Foundation of Computer Science","first-page":"14","article-title":"Proof verification and intractability of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/S0020-0190(97)00203-2_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(96)00273-3","article-title":"Algorithmic graph embeddings","author":"Chen","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00203-2_BIB3","series-title":"WADS'93","first-page":"234","article-title":"On the complexity of graph embeddings","volume":"Vol. 709","author":"Chen","year":"1993"},{"key":"10.1016\/S0020-0190(97)00203-2_BIB4","first-page":"319","article-title":"A separator theorem for graphs of fixed genus","volume":"11","author":"Djidjev","year":"1985","journal-title":"Serdica Bulgar. Math. Publ."},{"key":"10.1016\/S0020-0190(97)00203-2_BIB5","first-page":"62","article-title":"Planarization of graphs embedded on surfaces","volume":"Vol. 1017","author":"Djidjev","year":"1995"},{"key":"10.1016\/S0020-0190(97)00203-2_BIB6","series-title":"Proc. 12th Ann. ACM Symp. on Theory of Computing","first-page":"236","article-title":"A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus","author":"Filotti","year":"1980"},{"key":"10.1016\/S0020-0190(97)00203-2_BIB7","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(97)00203-2_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.3190110211","article-title":"Hierarchy of imbedding-distribution invariants of a graph","volume":"11","author":"Gross","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(97)00203-2_BIB9","series-title":"Topological Graph Theory","author":"Gross","year":"1987"},{"key":"10.1016\/S0020-0190(97)00203-2_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-0190(97)00203-2_BIB11","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","article-title":"On the hardness of approximating minimization problems","volume":"41","author":"Lund","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(97)00203-2_BIB12","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0020-0190(97)00203-2_BIB13","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/0196-6774(89)90006-0","article-title":"The graph genus problem is NP-complete","volume":"10","author":"Thomassen","year":"1989","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002032?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002032?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:25:33Z","timestamp":1556043933000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0020019097002032"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00203-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}