{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:50Z","timestamp":1725663290105},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540102915"},{"type":"electronic","value":"9783540384359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10291-4_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:09:05Z","timestamp":1330189745000},"page":"1-19","source":"Crossref","is-referenced-by-count":0,"title":["The post-office problem and related questions"],"prefix":"10.1007","author":[{"given":"H.","family":"Maurer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J. L. Bentley","year":"1979","unstructured":"Bentley, J.L.: Decomposable searching problems; Information Processing Letters 8(1979), 244\u2013251.","journal-title":"Information Processing Letters"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J. L. Bentley","year":"1979","unstructured":"Bentley, J.L., Maurer, H.A.: A note on Euclidean near neighbor searching in the plane; Information Processing Letters 8(1979), 133\u2013136.","journal-title":"Information Processing Letters"},{"key":"1_CR3","unstructured":"Bentley, J.L., Saxe, J.B.: Decomposable searching problemsI: Static to-Dynamic translations; to appear in: Journal of Algorithms."},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0205015","volume":"5","author":"D. P. Dobkin","year":"1976","unstructured":"Dobkin, D.P., Lipton, R.J.: Multidimensional searching problems; SIAM Journal on Computing 5(1976), 181\u2013186.","journal-title":"SIAM Journal on Computing"},{"key":"1_CR5","first-page":"46","volume":"11","author":"H. Edelsbrunner","year":"1980","unstructured":"Edelsbrunner, H., van Leeuwen, J.: Multidimensional algorithms and data structures \u2014 a bibliography; Bulletin of the EATCS 11 (1980), 46\u201374.","journal-title":"Bulletin of the EATCS"},{"key":"1_CR6","unstructured":"Edelsbrunner, H., Maurer, H.A.: On region location in the plane; Report 52, Institut f\u00fcr Informationsverarbeitung Graz (1980)."},{"key":"1_CR7","unstructured":"Kirkpatrick, D.G.: Optimal searching in planar subdivisions; University of British Columbia, Department of Computer Science Report (1979)."},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0206043","volume":"6","author":"D. T. Lee","year":"1977","unstructured":"Lee, D.T., Preparata, F.P.: Location of a point in a planar subdivision and its applications; SIAM Journal on computing 6 (1977), 594\u2013606.","journal-title":"SIAM Journal on computing"},{"key":"1_CR9","unstructured":"Leeuwen, J.v., Maurer, H.A.: Dynamic systems of static data-structures; Report 42, Institut f\u00fcr Informationsverarbeitung Graz (1980)."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem; Proc. of the 18th Annual FOCS Symposium (1977), 162\u2013170.","DOI":"10.1109\/SFCS.1977.6"},{"key":"1_CR11","volume-title":"Datenstrukturen und Programmierverfahren","author":"H. A. Maurer","year":"1974","unstructured":"Maurer, H.A.: Datenstrukturen und Programmierverfahren; Teubner, Stuttgart (1974)."},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-08353-7_131","volume":"53","author":"H. A. Maurer","year":"1977","unstructured":"Maurer, H.A., Ottmann, Th.: Tree-structures for set manipulation problems; Lecture Notes on Computer Science 53 (1977), 108\u2013121.","journal-title":"Lecture Notes on Computer Science"},{"key":"1_CR13","unstructured":"Maurer, H.A., Ottmann, Th.: Manipulating sets of points \u2014 a survey; Applied Computer Science 13, Carl Hanser (1979), 9\u201329."},{"key":"1_CR14","unstructured":"Maurer, H.A., Ottmann, Th.: Dynamic solutions of decomposable searching problems; Discrete Structures and Algorithms, Carl Hanser (1980), 17\u201324."},{"key":"1_CR15","volume-title":"Effiziente Algorithmen","author":"K. Mehlhorn","year":"1977","unstructured":"Mehlhorn, K.: Effiziente Algorithmen; Teubner, Stuttgart (1977)."},{"key":"1_CR16","unstructured":"Mehlhorn, K.: Private Communication (1980)."},{"key":"1_CR17","unstructured":"Preparata, F.P.: A new approach to planar point location; University of Illionois at Urbana \u2014 Champain, Report R \u2014 829 (1978)."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Shamos, M.I.: Geometric complexity, Proc. of the 7th Annual Symposium on Theory of Computing (1975), 224\u2013233.","DOI":"10.1145\/800116.803772"}],"container-title":["Lecture Notes in Computer Science","Graphtheoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10291-4_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:36:51Z","timestamp":1619555811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10291-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540102915","9783540384359"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-10291-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}