{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:56Z","timestamp":1759847396431},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1007\/bf01228511","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T19:18:45Z","timestamp":1109359125000},"page":"398-423","source":"Crossref","is-referenced-by-count":46,"title":["The searching over separators strategy to solve some NP-hard problems in subexponential time"],"prefix":"10.1007","volume":"9","author":[{"given":"R. Z.","family":"Hwang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. C.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. C. T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1976","unstructured":"Aho, A. V., Hopcroft, J. E., and Ullman, J. D.,The Design and Analysis of Computer Algorithms, Bell Telephone Laboratories, Inc., New York, 1976."},{"key":"CR2","unstructured":"Bentley, J. L., Divide and Conquer Algorithms for Closest Point Problems in Multidimensional Space, Ph.D. Thesis, Department of Computer Science, University of North Carolina, 1976."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J. L. Bentley","year":"1980","unstructured":"Bentley, J. L., Multidimensional Divide-and-Conquer,Communications of the Association for Computing Machinery, Vol. 23, 1980, pp. 214?229.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"CR4","first-page":"793","volume":"7","author":"B. Delaunay","year":"1934","unstructured":"Delaunay, B., Sur la sph\u00e8re vide,Izvestiya Akademii Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk, Vol. 7, 1934, pp. 793?800.","journal-title":"Izvestiya Akademii Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk"},{"issue":"No. 8","key":"CR5","first-page":"741","volume":"35","author":"Z. Drezner","year":"1984","unstructured":"Drezner, Z., TheP-Center Problem ? Heuristics and Optimal Algorithms,Journal of the Operational Research Society, Vol. 35, No. 8, 1984, pp. 741?748.","journal-title":"Journal of the Operational Research Society"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/1520-6750(198704)34:2<229::AID-NAV3220340207>3.0.CO;2-1","volume":"34","author":"Z. Drezner","year":"1987","unstructured":"Drezner, Z., On the RectangularP-Center Problem,Naval Research Logistics, Vol. 34, 1987, pp. 229?234.","journal-title":"Naval Research Logistics"},{"key":"CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.,Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., and Karp, R. M., A Dynamic Programming Approach to Sequencing Problems,SIAM Journal on Applied Mathematics, Vol. 10, 1962, pp. 196?210.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR9","volume-title":"Fundamentals of Computer Algorithms","author":"E. Horowitz","year":"1978","unstructured":"Horowitz, E., and Sahni, S.,Fundamentals of Computer Algorithms, Computer Science Press, Rockville, MD, 1978."},{"key":"CR10","volume-title":"The Traveling Salesman Problem ? A Guided Tour of Combinatorial Optimization","author":"E. L. Lawler","year":"1985","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., and Shmoys, D. B.,The Traveling Salesman Problem ? A Guided Tour of Combinatorial Optimization, Wiley-Interscience, New York, 1985."},{"issue":"No. 2","key":"CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. Lipton","year":"1979","unstructured":"Lipton, R., and Tarjan, R. E., A Separator Theorem for Planar Graphs,SIAM Journal on Applied Mathematics, Vol. 36, No. 2, 1979, pp. 177?189.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"No. 4","key":"CR12","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., Linear-Time Algorithms for Linear Programming inR 3 and Related Problems,SIAM Journal on Computing, Vol. 12, No. 4, 1983, pp. 759?776.","journal-title":"SIAM Journal on Computing"},{"issue":"No. 1","key":"CR13","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N., and Supowit, K. J., On the Complexity of Some Common Geometric Location Problems,SIAM Journal on Computing, Vol. 13, No. 1, 1984, pp. 182?196.","journal-title":"SIAM Journal on Computing"},{"key":"CR14","volume-title":"Data Structure and Algorithms 3: Multi-dimensional Search and Computational Geometry","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.,Data Structure and Algorithms 3: Multi-dimensional Search and Computational Geometry, Springer-Verlag, Berlin, 1984."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"G. L. Miller","year":"1986","unstructured":"Miller, G. L., Finding Small Simple Cycle Separators for 2-Connected Planar Graphs,Journal of Computer and System Sciences, Vol. 32, 1986, pp. 265?279.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR16","volume-title":"Planar Graphs, Theory and Algorithms","author":"T. Nishizeki","year":"1988","unstructured":"Nishizeki, T., and Chiba, N.,Planar Graphs, Theory and Algorithms, Elsevier, Amsterdam, 1988."},{"key":"CR17","first-page":"275","volume-title":"Proceedings of the Conference on Theoretical Computer Science","author":"C. H. Papadimitriou","year":"1977","unstructured":"Papadimitriou, C. H., Some Computational Problems Related to Database Concurrent Control,Proceedings of the Conference on Theoretical Computer Science, University of Waterloo, Waterloo, Ontario, 1977, pp. 275?282."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1137\/0210040","volume":"10","author":"C. H. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C. H., Worst-Case and Probabilistic Analysis of a Geometric Location Problem,SIAM Journal on Computing, Vol. 10, 1981, pp. 542?557.","journal-title":"SIAM Journal on Computing"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C. H., and Steiglitz, K., Some Complexity Results for the Traveling Salesman Problem,Proceedings of the 8th Annual ACM Symposium on Theory of Computing, New York, 1976, pp. 1?9.","DOI":"10.1145\/800113.803625"},{"key":"CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"Preparata, F. P., and Shamos M. I.,Computational Geometry, Springer-Verlag, New York, 1985."},{"key":"CR21","unstructured":"Smith, W. D., Studies in Computational Geometry Motivated by Mesh Generation, accepted byAlgorithmica, 1991."},{"key":"CR22","first-page":"97","volume":"133","author":"G. Voronoi","year":"1907","unstructured":"Voronoi, G., Nouvelles applications des param\u00e8tres continus \u00e0 la th\u00e9orie des formes quadratiques. Premier M\u00e9moire: Sur quelques propri\u00e9t\u00e9s des formes quadratiques positives parfaites,Journal f\u00fcr die Reine und Angewandte Mathematik, Vol. 133, 1907, pp. 97?178.","journal-title":"Journal f\u00fcr die Reine und Angewandte Mathematik"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01228511.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01228511\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01228511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:01:00Z","timestamp":1556625660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01228511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["BF01228511"],"URL":"https:\/\/doi.org\/10.1007\/bf01228511","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}