{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:38Z","timestamp":1725663758347},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_240","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:08Z","timestamp":1330257908000},"page":"107-118","source":"Crossref","is-referenced-by-count":1,"title":["A dynamic separator algorithm"],"prefix":"10.1007","author":[{"given":"Deganit","family":"Armon","sequence":"first","affiliation":[]},{"given":"John","family":"Reif","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Cole R, Goodrich MT. Optimal parallel algorithms for polygon and pointset problems. Department of computer science, 88\u201314, Johns Hopkins University, 1988.","DOI":"10.1145\/73393.73414"},{"key":"12_CR2","unstructured":"Chiang Y, Tamassia R. Dynamic algorithms in computational geometry. Tech Report CS-91-24, Department of Computer Science, Brown University, 1991."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/102782.102788","volume":"38","author":"G. Frederickson","year":"1991","unstructured":"Frederickson G.. Planar graph decomposition and all pairs shortest paths. JACM 38:162\u2013204, January 1991","journal-title":"JACM"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Frieze A, Miller GM, Teng S-H. Separator based Parallel divide and conquer in computational geometry. Proceedings, Symposium on Parallel Algorithms and Architectures, 1992.","DOI":"10.1145\/140901.141934"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Gazit H, Miller GL A parallel algorithm for finding a separator in planar graphs. Proceedings, Twenty-Eighth Annual Symposium on Foundations of Computer Science 238\u2013248, 1987.","DOI":"10.1109\/SFCS.1987.3"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton RJ, Tarjan RE. A separator theorem for planar graphs. SIAM J of Appl Math, 36:177\u2013189, April 1979.","journal-title":"SIAM J of Appl Math"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Miller GL, Teng S-H, Thurston W, Vavasis SA. Automatic mesh partitioning. To appear, 1992.","DOI":"10.1007\/978-1-4613-8369-7_3"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Miller GL, Teng S-H, Vavasis SA. A unified geometric approach to graph separators. Proceedings, Thirty Second Annual Symposium on Foundations of Computer Science, 538\u2013547, 1991.","DOI":"10.1109\/SFCS.1991.185417"},{"key":"12_CR9","unstructured":"Overmars M. The design of dynamic data structures. Lecture Notes in Computer Science, 156, 1983."},{"key":"12_CR10","volume-title":"Lecture Notes in Computer Science, vol. 241","author":"V Pan","year":"1986","unstructured":"Pan V, Reif JH. Extension of the parallel nested dissection algorithm to path algebra problems. Proc Sixth Conference on Foundation of Software Technology and Theoretical Computer Science, New Delhi, India, Lecture Notes in Computer Science, vol. 241, Springer-Verlag, 1986; also full version as Fast and Efficient Solution of Path Algebra Problems. Journal of Computer and Systems Sciences 38:494\u2013510, June 1989."},{"key":"12_CR11","unstructured":"Pan V, Reif JH. Acceleration of minimum cost path calculations in graphs having small separator families. TR 1989."},{"key":"12_CR12","unstructured":"Teng S-H. Points, spheres and separators: a unified geometric approach to graph partitioning. PhD thesis, Carnegie-Mellon University, School of Computer Science, 1991. CMU-CS-91-184"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"PM Vaidya","year":"1989","unstructured":"Vaidya PM. An O(n log n) algorithm for the all-nearest-neighbor problem. Discrete and Computational Geometry 4:101\u2013105, 1989.","journal-title":"Discrete and Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_240.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:14Z","timestamp":1605647294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_240","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}