{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:27:04Z","timestamp":1725456424830},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002769","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"450-457","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new staircase separator theorem"],"prefix":"10.1007","author":[{"given":"Viet Hai","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01762120","volume":"3","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal, B. Chazelle, L. Guibas, C. \u00d3'D\u00fanlaing, and C. Yap. Parallel computational geometry. Algorithmica, 3:293\u2013327, 1988.","journal-title":"Algorithmica"},{"key":"57_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0925-7721(91)90002-V","volume":"1","author":"M. J. Atallah","year":"1991","unstructured":"M. J. Atallah and D. Z. Chen. Parallel rectilinear shortest paths with rectangular obstacles. Comput. Geom. Theory Appl., 1:79\u2013113, 1991.","journal-title":"Comput. Geom. Theory Appl."},{"key":"57_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0925-7721(93)90004-P","volume":"3","author":"M. J. Atallah","year":"1993","unstructured":"M. J. Atallah and D. Z. Chen. On parallel rectilinear obstacle-avoiding paths. Comput. Geom. Theory Appl., 3:307\u2013313, 1993.","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"57_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0218035","volume":"18","author":"M. J. Atallah","year":"1989","unstructured":"M. J. Atallah, R. Cole, and M. T. Goodrich. Cascading divide-and-conquer: A technique for designing parallel algorithms. SIAM J. Comput., 18(3):499\u2013532, 1989.","journal-title":"SIAM J. Comput."},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"D. Z. Chen and K. S. Klenk. Rectilinear shortest path queries among rectangular obstacles. In Proc. 5th Canad. Conf. Comput. Geom., Quebec, Canada, 1995.","DOI":"10.1145\/220279.220319"},{"key":"57_CR6","unstructured":"J. Ja'Ja'. An Introduction to Parallel Algorithms. Addison-Wesley, 1992."},{"issue":"4","key":"57_CR7","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fischer. Parallel prefix computation. JACM, 27(4):831\u2013838, 1980.","journal-title":"JACM"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"P. Mitra and B. Bhattacharya. Efficient approximate shortest-path queries among isothetic rectangular obstacles. In Proc. 3rd WADS, LNCS 709, Springer-Verlag, pages 518\u2013529, 1993.","DOI":"10.1007\/3-540-57155-8_276"},{"key":"57_CR9","unstructured":"V. H. Nguyen. Optimal binary space partitions for orthogonal objects. Diss. ETH No. 11818, Dept. of Comput. Sci., ETH Z\u00fcrich, ETH-Zentrum, CH-8092 Z\u00fcrich, Switzerland, 1996."},{"issue":"4","key":"57_CR10","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM J. Comput., 14(4):862\u2013874, 1985.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:05:42Z","timestamp":1587341142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0002769","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}