{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:57:01Z","timestamp":1725559021207},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_42","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"493-503","source":"Crossref","is-referenced-by-count":2,"title":["Simplified External Memory Algorithms for Planar DAGs"],"prefix":"10.1007","author":[{"given":"Lars","family":"Arge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Toma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"NASA Earth Observing System (EOS) project , http:\/\/eos.nasa.gov\/"},{"issue":"9","key":"42_CR2","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The Input\/Output complexity of sorting and related problems. Communications of the ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-44985-X_37","volume-title":"Algorithm Theory - SWAT 2000","author":"L. Arge","year":"2000","unstructured":"Arge, L., Brodal, G.S., Toma, L.: On external memory MST, SSSP and multiway planar graph separation. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 433\u2013447. Springer, Heidelberg (2000)"},{"issue":"2","key":"42_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.7155\/jgaa.00063","volume":"7","author":"L. Arge","year":"2003","unstructured":"Arge, L., Meyer, U., Toma, L., Zeh, N.: On external-memory planar depth first search. Journal of Graph Algorithms\u00a07(2), 105\u2013129 (2003)","journal-title":"Journal of Graph Algorithms"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Arge, L., Toma, L., Vitter, J.S.: I\/O-efficient algorithms for problems on gridbased terrains. ACM Journal on Experimental Algorithmics\u00a06(1) (2001)","DOI":"10.1145\/945394.945395"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Arge, L., Toma, L., Zeh, N.: I\/O-efficient topological sorting of planar DAGs. In: Proc. ACM Symposium on Parallel Algorithms and Architectures, pp. 85\u201393 (2003)","DOI":"10.1145\/777412.777427"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Arge, L., Zeh, N.: I\/O-efficient strong connectivity and depth-first search for directed planar graphs. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 261\u2013270 (2003)","DOI":"10.1109\/SFCS.2003.1238200"},{"key":"42_CR8","unstructured":"Buchsbaum, L., Goldwasser, M., Venkatasubramanian, S., Westbrook, J.R.: On external memory graph traversal. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 859\u2013860 (2000)"},{"key":"42_CR9","unstructured":"Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 139\u2013149 (1995)"},{"key":"42_CR10","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge"},{"key":"42_CR11","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 Journal on Computing\u00a016, 1004\u20131022 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Kumar, V., Schwabe, E.: Improved algorithms and data structures for solving graph problems in external memory. In: Proc. IEEE Symp. on Parallel and Distributed Processing, pp. 169\u2013177 (1996)","DOI":"10.1109\/SPDP.1996.570330"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal of Applied Math\u00a036, 177\u2013189 (1979)","journal-title":"SIAM Journal of Applied Math"},{"key":"42_CR14","unstructured":"Maheshwari, A., Zeh, N.: I\/O-optimal algorithms for planar graphs using separators. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 372\u2013381 (2002)"},{"key":"42_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms for Memory Hierarchies","year":"2003","unstructured":"Meyer, U., Sanders, P., Sibeyn, J.F. (eds.): Algorithms for Memory Hierarchies. LNCS, vol.\u00a02625. Springer, Heidelberg (2003)"},{"key":"42_CR16","unstructured":"NASA Jet Propulsion Laboratory.: NASA Shuttle Radar Topography Mission (SRTM) , http:\/\/www.jpl.nasa.gov\/srtm\/"},{"key":"42_CR17","unstructured":"Toma, L.: External Memory Graph Algorithms and Applications to Geographic Information Systems. PhD thesis, Duke University (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:46Z","timestamp":1605759706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}