{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:05Z","timestamp":1725489485548},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_20","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:26:08Z","timestamp":1187238368000},"page":"252-263","source":"Crossref","is-referenced-by-count":0,"title":["Planar Graph Blocking for External Searching"],"prefix":"10.1007","author":[{"given":"Surender","family":"Baswana","sequence":"first","affiliation":[]},{"given":"Sandeep","family":"Sen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"20_CR1","unstructured":"Pankaj K. Agarwal, Lars Arge, T.M. Murli, Kasturi R. Varadarajan, J.S. Vitter. I\/O-efficient algorithms for contour-line extraction and planar graph blocking. 9th ACM-SIAM Symposium on Discrete Algorithms, 1998."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G.N. Fredrickson","year":"1987","unstructured":"G.N. Fredrickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal of Computing, 16, pp. 1004\u20131022, 1987.","journal-title":"SIAM Journal of Computing"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01940646","volume":"16","author":"M.T. Goodrich","year":"1996","unstructured":"M.T. Goodrich, M.H. Nodine and J.S. Vitter. Blocking for external graph searching. Algorithmica, 16, pp. 181\u2013214, August 1996.","journal-title":"Algorithmica"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J. Hershberger","year":"1995","unstructured":"John Hershberger and Subhash Suri. A pedestrian approach to ray shooting: shoot a ray, take a walk. Journal of Algorithms, 18, pp. 403\u2013432, 1995.","journal-title":"Journal of Algorithms"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM journal of Applied Math., 36, pp. 177\u2013189, 1979.","journal-title":"SIAM journal of Applied Math."},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"G. Miller","year":"1986","unstructured":"G. Miller. Balanced cyclic separator for 2-connected planar graphs. Journal of Computer and System Sciences, 32(3), pp. 265\u2013279, 1986.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T18:07:33Z","timestamp":1550858853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}