{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:18Z","timestamp":1725542058732},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_118","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"1175-1184","source":"Crossref","is-referenced-by-count":0,"title":["I\/O and Space-Efficient Path Traversal in Planar Graphs"],"prefix":"10.1007","author":[{"given":"Craig","family":"Dillabaugh","sequence":"first","affiliation":[]},{"given":"Meng","family":"He","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"118_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-92182-0_13","volume-title":"Algorithms and Computation","author":"C. Dillabaugh","year":"2008","unstructured":"Dillabaugh, C., He, M., Maheshwari, A.: Succinct and I\/O efficient data structures for traversal in trees. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 112\u2013123. Springer, Heidelberg (2008)"},{"key":"118_CR2","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: SODA, pp. 383\u2013391 (1996)"},{"key":"118_CR3","doi-asserted-by":"crossref","unstructured":"Chien, Y.F., Hon, W.K., Shah, R., Vitter, J.S.: Geometric Burrows-Wheeler transform: Linking range searching and text indexing. In: DCC, pp. 252\u2013261 (2008)","DOI":"10.1109\/DCC.2008.67"},{"issue":"9","key":"118_CR4","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Jeffrey, S.V.: The input\/output complexity of sorting and related problems. Commun. ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"issue":"2","key":"118_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01940646","volume":"16","author":"M.H. Nodine","year":"1996","unstructured":"Nodine, M.H., Goodrich, M.T., Vitter, J.S.: Blocking for external graph searching. Algorithmica\u00a016(2), 181\u2013214 (1996)","journal-title":"Algorithmica"},{"key":"118_CR6","unstructured":"Agarwal, P.K., Arge, L., Murali, T.M., Varadarajan, K.R., Vitter, J.S.: I\/O-efficient algorithms for contour-line extraction and planar graph blocking (extended abstract). In: SODA, pp. 117\u2013126 (1998)"},{"key":"118_CR7","first-page":"549","volume":"42","author":"G. Jacobson","year":"1989","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. FOCS\u00a042, 549\u2013554 (1989)","journal-title":"FOCS"},{"key":"118_CR8","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. In: FOCS, pp. 118\u2013126 (1997)","DOI":"10.1109\/SFCS.1997.646100"},{"key":"118_CR9","unstructured":"Chuang, R.C.N., Garg, A., He, X., Kao, M.Y., Lu, H.I.: Compact encodings of planar graphs via canonical orderings and multiple parentheses. CoRR\u00a0cs.DS\/0102005 (2001)"},{"issue":"4","key":"118_CR10","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1137\/S0097539702411381","volume":"34","author":"Y.T. Chiang","year":"2005","unstructured":"Chiang, Y.T., Lin, C.C., Lu, H.I.: Orderly spanning trees with applications. SIAM J. Comput.\u00a034(4), 924\u2013945 (2005)","journal-title":"SIAM J. Comput."},{"key":"118_CR11","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA, pp. 233\u2013242 (2002)"},{"issue":"6","key":"118_CR12","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput.\u00a016(6), 1004\u20131022 (1987)","journal-title":"SIAM J. Comput."},{"key":"118_CR13","doi-asserted-by":"crossref","unstructured":"Bose, P., Chen, E.Y., He, M., Maheshwari, A., Morin, P.: Succinct geometric indexes supporting point location queries. In: SODA, pp. 635\u2013644 (2009)","DOI":"10.1137\/1.9781611973068.70"},{"key":"118_CR14","doi-asserted-by":"crossref","unstructured":"de Berg, M., Bose, P., Dobrindt, K., van Kreveld, M.J., Overmars, M.H., de Groot, M., Roos, T., Snoeyink, J., Yu, S.: The complexity of rivers in triangulated terrains. In: CCCG, pp. 325\u2013330 (1996)","DOI":"10.1515\/9780773591134-057"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_118.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T00:20:10Z","timestamp":1710721210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_118","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}