{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:51Z","timestamp":1725488511096},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424239"},{"type":"electronic","value":"9783540446347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44634-6_27","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:20:48Z","timestamp":1186741248000},"page":"287-299","source":"Crossref","is-referenced-by-count":1,"title":["I\/O-Efficient Shortest Path Queries in Geometric Spanners"],"prefix":"10.1007","author":[{"given":"Anil","family":"Maheshwari","sequence":"first","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"27_CR1","unstructured":"P.K. Agarwal, L. Arge, M. Murali, K.R. Varadarajan, J.S. Vitter. I\/O-efficient algorithms for contour-line extraction and planar graph blocking. SODA\u201998, 1998."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"L. Arge. The buffer tree: A new technique for optimal I\/O-algorithms. WADS\u201995, pp. 334\u2013345, 1995.","DOI":"10.1007\/3-540-60220-8_74"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"L. Arge, G.S. Brodal, L. Toma. On external memory MST, SSSP, and multi-way planar separators. SWAT\u20192000, 2000.","DOI":"10.1007\/3-540-44985-X_37"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"L. Arge, D.E. Vengroff, J.S. Vitter. External-memory algorithms for processing line segments in geographic information systems. ESA\u201995, pp. 295\u2013310, 1995.","DOI":"10.1007\/3-540-60313-1_151"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"S. Arikati, D.Z. Chen, L.P. Chew, G. Das, M. Smid, C.D. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. ESA\u201996, pp. 514\u2013528, 1996.","DOI":"10.1007\/3-540-61680-2_79"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"S. Arya, G. Das, D.M. Mount, J.S. Salowe, M. Smid. Euclidean spanners: Short, thin, and lanky. STOC\u201995, pp. 489\u2013498, 1995.","DOI":"10.1145\/225058.225191"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"P.B. Callahan, M. Goodrich, K. Ramaiyer. Topology B-trees and their applications. WADS\u201995, pp. 381\u2013392, 1995.","DOI":"10.1007\/3-540-60220-8_78"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"P.B. Callahan, S.R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest neighbors and n-body potential fields. J. ACM, 42:67\u201390, 1995.","journal-title":"J. ACM"},{"key":"27_CR9","series-title":"PhD thesis","volume-title":"Dealing with Higher Dimensions: The Well-Separated Pair Decomposition and Its Applications","author":"P.B. Callahan","year":"1995","unstructured":"P.B. Callahan. Dealing with Higher Dimensions: The Well-Separated Pair Decomposition and Its Applications. PhD thesis, Johns Hopkins, Baltimore, 1995."},{"key":"27_CR10","unstructured":"Y.-J. Chiang, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, J.S. Vitter. External-memory graph algorithms. SODA\u201995, 1995."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/jagm.1996.0835","volume":"24","author":"G. N. Frederickson","year":"1997","unstructured":"Greg N. Frederickson. A data structure for dynamically maintaining rooted trees. J. of Algorithms, 24:37\u201365, 1997.","journal-title":"J. of Algorithms"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh. I\/O-efficient well-separated pair decomposition and its applications. ESA\u20192000, pp. 220\u2013231, 2000.","DOI":"10.1007\/3-540-45253-2_21"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"D. Hutchinson, A. Maheshwari, N. Zeh. An external memory data structure for shortest path queries. COCOON\u201999, pp. 51\u201360, 1999 (to appear in Disc. App. Maths).","DOI":"10.1007\/3-540-48686-0_5"},{"key":"27_CR14","unstructured":"V. Kumar, E.J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. SPDC\u201996, 1996."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"M. Smid. Closest-point problems in computational geometry. J.-R. Sack, J. Urrutia (eds.), Handbook of Computational Geometry, pp. 877\u2013936. North-Holland, 2000.","DOI":"10.1016\/B978-044482537-7\/50021-8"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1006\/jagm.1996.0829","volume":"23","author":"M. Thorup","year":"1997","unstructured":"M. Thorup. Parallel shortcutting of rooted trees. J. of Algorithms., 23:123\u2013159, 1997.","journal-title":"J. of Algorithms."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"J.S. Vitter. External memory algorithms and data structures. J. Abello, J.S. Vitter (eds.), External Memory Algorithms and Visualization, AMS, 1999.","DOI":"10.1145\/275487.275501"}],"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-44634-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:12:19Z","timestamp":1556748739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}