{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:47Z","timestamp":1725664067607},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562795"},{"type":"electronic","value":"9783540475019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56279-6_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:59:10Z","timestamp":1330253950000},"page":"51-60","source":"Crossref","is-referenced-by-count":0,"title":["The application of the searching over separators strategy to solve some NP-complete problems on planar graphs"],"prefix":"10.1007","author":[{"given":"R. Z.","family":"Hwang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. C. T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"6_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1976","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Bell Telephone Laboratories, Inc., New York, 1976."},{"key":"6_CR2","unstructured":"J. L. Bentley. Divide and Conquer Algorithms for Closest Point Problems in Multidimensional Space. PhD thesis, Department of Cimputer Science, University of North Carolina, 1976."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J. L. Bently","year":"1980","unstructured":"J. L. Bently. Multidimensional Divide-and-Conquer. Communications of the ACM, 23:214\u2013229, 1980.","journal-title":"Communications of the ACM"},{"key":"6_CR4","volume-title":"Nonserial Dynamic Programming","author":"U. Bertele","year":"1972","unstructured":"U. Bertele and F. Brioschi. Nonserial Dynamic Programming. Academic Press, New York, 1972."},{"key":"6_CR5","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York, 1979."},{"key":"6_CR6","volume-title":"Fundamentals of Computer Algorithms","author":"E. Horowitz","year":"1978","unstructured":"E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, Inc., New York, 1978."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"R. Z. Hwang, R. C. T. Lee, and R. C. Chang. The Searching over Separators Strategy to Solve Some NP-hard Problems in Subexponential Time. Accepted by Algorithmica, 1992.","DOI":"10.1007\/BF01228511"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"D. S. Johnson","year":"1985","unstructured":"D. S. Johnson. The NP-Completeness Column: an Ongoing Guide. Journal of Algorithms, 6:434\u2013451, 1985.","journal-title":"Journal of Algorithms"},{"key":"6_CR9","volume-title":"The Traveling Salesman Problem \u2014 A Guided Tour of Combinatorial Optimization","author":"E. L. Lawler","year":"1985","unstructured":"E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. The Traveling Salesman Problem \u2014 A Guided Tour of Combinatorial Optimization. Wiley-Interscience, New York, 1985."},{"issue":"2","key":"6_CR10","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 Journal on Applied Mathematics, 36(2):177\u2013189, 1979.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N. Megiddo","year":"1984","unstructured":"N. Megiddo and K. J. Supowit. On the Complexity of Some Common Geometric Location Problems. SIAM Journal on Computing, 13(1):182\u2013196, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"G. L. Miller","year":"1986","unstructured":"G. L. Miller. Finding Small Simple Cycle Separators for 2-Connected Planar Graphs. Journal of Computer and System Sciences, 32:265\u2013279, 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR13","volume-title":"Planar Graphs, Theory and Algorithms","author":"T. Nishizeki","year":"1988","unstructured":"T. Nishizeki and N. Chiba. Planar Graphs, Theory and Algorithms. Elsevier Science Publisher B.V., Amsterdam, 1988."},{"key":"6_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, New York, 1985."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:57Z","timestamp":1605646977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}