{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:17:58Z","timestamp":1765545478421},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669166"},{"type":"electronic","value":"9783540466321"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46632-0_31","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T19:45:01Z","timestamp":1195933501000},"page":"307-316","source":"Crossref","is-referenced-by-count":11,"title":["External Memory Algorithms for Outerplanar Graphs"],"prefix":"10.1007","author":[{"given":"Anil","family":"Maheshwari","sequence":"first","affiliation":[]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"31_CR1","unstructured":"Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, J. S. Vitter. External-memory graph algorithms. Proc. 6th SODA, Jan. 1995."},{"key":"31_CR2","unstructured":"T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to Algorithms. MIT Press, 1990."},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BF01955044","volume":"15","author":"G. N. Frederickson","year":"1996","unstructured":"G. N. Frederickson. Searching among intervals in compact routing tables. Algorithmica, 15:448\u2013466, 1996.","journal-title":"Algorithmica"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"F. Harary. Graph Theory. Addison-Wesley, 1969.","DOI":"10.21236\/AD0705364"},{"key":"31_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-48686-0_5","volume-title":"Proc. COCOON\u201999","author":"D. Hutchinson","year":"1999","unstructured":"D. Hutchinson, A. Maheshwari, N. Zeh. An external memory data structure for shortest path queries. Proc. COCOON\u201999, LNCS 1627, pp. 51\u201350, July 1999."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen. Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity. MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50015-1"},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton, R. E. Tarjan. A separator theorem for planar graphs. SIAM J. on Applied Mathematics, 36(2):177\u2013189, 1979.","journal-title":"SIAM J. on Applied Mathematics"},{"issue":"5","key":"31_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"S. L. Mitchell","year":"1979","unstructured":"S. L. Mitchell. Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inf. Proc. Letters, 9(5):229\u2013232, Dec. 1979.","journal-title":"Inf. Proc. Letters"},{"key":"31_CR9","unstructured":"K. Munagala, A. Ranade. I\/O-complexity of graph algorithms. Proc. 10th SODA, Jan. 1999."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"J. S. Vitter. External memory algorithms. Proc. 17th ACM Symp. on Principles of Database Systems, June 1998.","DOI":"10.1145\/275487.275501"},{"issue":"2-3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J. S. Vitter","year":"1994","unstructured":"J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110\u2013147, 1994.","journal-title":"Algorithmica"},{"key":"31_CR12","unstructured":"N. Zeh. An External-Memory Data Structure for Shortest Path Queries. Diplomarbeit, Fak. f. Math. und Inf. Friedrich-Schiller-Univ. Jena, Nov. 1998."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46632-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T02:04:43Z","timestamp":1557021883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46632-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669166","9783540466321"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46632-0_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}