{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:40:28Z","timestamp":1737592828198,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_11","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T09:37:43Z","timestamp":1196329063000},"page":"105-114","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for Independent Sets in Map Graphs"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"B.S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41 (1994) 153\u2013180.","journal-title":"J. ACM"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"H.L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 (1996) 1305\u20131317.","journal-title":"SIAM J. Comput."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0012-365X(92)90647-X","volume":"100","author":"O.V. Borodin","year":"1992","unstructured":"O.V. Borodin. Cyclic coloring of plane graphs. Discrete Math. 100 (1992) 281\u2013289.","journal-title":"Discrete Math."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/jagm.1997.0894","volume":"26","author":"Z.-Z. Chen","year":"1998","unstructured":"Z.-Z. Chen. Efficient approximation schemes for maximization problems on K3,3-free or K5-free graphs. J. Algorithms 26 (1998) 166\u2013187.","journal-title":"J. Algorithms"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Z.-Z. Chen, M. Grigni, and C.H. Papadimitriou. Planar map graphs. STOC\u201998, 514\u2013523. See http:\/\/rnc2.r.dendai.ac.jp\/~chen\/papers\/mg2.ps.gz for a full version.","DOI":"10.1145\/276698.276865"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"J. H\u00e4stad. Clique is hard to approximate within n1-\u2208. STOC\u201996, 627\u2013636.","DOI":"10.1109\/SFCS.1996.548522"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math. 36 (1979) 177\u2013189.","journal-title":"SIAM J. Appl. Math."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R.J. Lipton","year":"1980","unstructured":"R.J. Lipton and R.E. Tarjan. Applications of a planar separator theorem. SIAM J. Computing 9 (1980) 615\u2013627.","journal-title":"SIAM J. Computing"},{"key":"11_CR9","unstructured":"O. Ore and M.D. Plummer. Cyclic coloration of plane graphs. Recent Progress in Combinatorics, pp. 287\u2013293, Academic Press, 1969."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"M. Thorup. Map graphs in polynomial time. FOCS\u201998, 396\u2013405.","DOI":"10.1109\/SFCS.1998.743490"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:21:48Z","timestamp":1737591708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}