{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:46Z","timestamp":1725662926601},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108566"},{"type":"electronic","value":"9783540387695"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10856-4_78","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:34:22Z","timestamp":1330173262000},"page":"121-131","source":"Crossref","is-referenced-by-count":4,"title":["The art of dynamizing"],"prefix":"10.1007","author":[{"given":"Jan","family":"Leeuwen","sequence":"first","affiliation":[]},{"given":"Mark H.","family":"Overmars","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"9_CR1","volume-title":"Algorithms for Klee's rectangle problems","author":"J.L. Bentley","year":"1977","unstructured":"Bentley, J.L., Algorithms for Klee's rectangle problems, unpubl. notes, Dept. of Computer Science, Carnegie Mellon University, Pittsburgh, 1977."},{"key":"9_CR2","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, Inf. Proc. Lett. 8 (1979) 244\u2013251.","journal-title":"Inf. Proc. Lett."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TC.1980.1675628","volume":"C-29","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L. and D. Wood, An optimal worst-case algorithm for reporting intersections of rectangles, IEEE Transactions on Computers, C-29 (1980) 571\u2013577.","journal-title":"IEEE Transactions on Computers"},{"key":"9_CR4","volume-title":"Dynamic data structures for orthogonal intersection queries","author":"H. Edelsbrunner","year":"1980","unstructured":"Edelsbrunner, H., Dynamic data structures for orthogonal intersection queries, Bericht 59, Inst. f. Informationsverarb., TU Graz, Graz, 1980."},{"key":"9_CR5","volume-title":"On the intersection of orthogonal objects","author":"H. Edelsbrunner","year":"1980","unstructured":"Edelsbrunner, H. and H.A. Maurer, On the intersection of orthogonal objects, Bericht 60, Inst. f. Informationsverarb., TU Graz, Graz, 1980."},{"key":"9_CR6","volume-title":"Dynamic problems in computational geometry","author":"I.G. Gowda","year":"1980","unstructured":"Gowda, I.G., Dynamic problems in computational geometry, M.Sc. Thesis, Dept. of Computer Science, University of British Columbia, Vancouver, 1980."},{"unstructured":"Gowda, I.G. and D.G. Kirkpatrick, Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures, in: Proc. 18th Annual Allerton Conf. on Communication, Control and Computing, 1980.","key":"9_CR7"},{"key":"9_CR8","volume-title":"Optimal search in planar subdivisions, preprint","author":"D.G. Kirkpatrick","year":"1979","unstructured":"Kirkpatrick, D.G., Optimal search in planar subdivisions, preprint, Dept. of Computer Science, University of British Columbia, Vancouver, 1979."},{"key":"9_CR9","volume-title":"A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems","author":"G.S. Lueker","year":"1978","unstructured":"Lueker, G.S., A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems, Techn. Rep., Dept. of Computer Science, University of California at Irvine, Irvine, 1978."},{"key":"9_CR10","volume-title":"Dynamic solutions of decomposable searching problems","author":"H.A. Maurer","year":"1979","unstructured":"Maurer, H.A. and Th. Ottmann, Dynamic solutions of decomposable searching problems, Bericht 33, Inst. f. Informationsverarb., TU Graz, Graz, 1979."},{"key":"9_CR11","volume-title":"Lower bounds on the efficiency of static to dynamic transforms of data structures, preprint, Fachbereich 10","author":"K. Mehlhorn","year":"1980","unstructured":"Mehlhorn, K., Lower bounds on the efficiency of static to dynamic transforms of data structures, preprint, Fachbereich 10, University of Saarland, Saarbr\u00fccken, 1980."},{"key":"9_CR12","volume-title":"Optimal dynamization of decomposable searching problems, preprint, Fachbereich 10","author":"K. Mehlhorn","year":"1980","unstructured":"Mehlhorn, K. and M.H. Overmars, Optimal dynamization of decomposable searching problems, preprint, Fachbereich 10, University of Saarland, Saarbr\u00fccken, 1980 (to appear in Inf. Proc. Lett.)."},{"key":"9_CR13","series-title":"Techn. Rep.","volume-title":"Dynamization of order decomposable set problems","author":"M.H. Overmars","year":"1980","unstructured":"Overmars, M.H., Dynamization of order decomposable set problems, Techn. Rep. RUU-CS-80-9, Dept. of Computer Science, University of Utrecht, Utrecht, 1980 (to appear in J. Algor.)."},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02241781","volume":"26","author":"M.H. Overmars","year":"1981","unstructured":"Overmars, M.H. and J. van Leeuwen, Two general methods for dynamizing decomposable searching problems, Computing 26 (1981) 155\u2013166.","journal-title":"Computing"},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0020-0190(81)90077-6","volume":"12","author":"M.H. Overmars","year":"1981","unstructured":"Overmars, M.H. and J. van Leeuwen, Some principles for dynamizing decomposable searching problems, Inf. Proc. Lett. 12 (1981) 49\u201354.","journal-title":"Inf. Proc. Lett."},{"unstructured":"Overmars, M.H. and J. van Leeuwen, Maintenance of configurations in the plane, Techn. Rep. RUU-CS-79-9, Dept. of Computer Science, University of Utrecht, 1979 (revised as Techn. Rep. RUU-CS-81-3, to appear in J. Comp. Syst. Sci.).","key":"9_CR16"},{"key":"9_CR17","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BFb0017314","volume-title":"Theoretical Computer Science","author":"M.H. Overmars","year":"1981","unstructured":"Overmars, M.H. and J. van Leeuwen, Dynamization of decomposable searching problems yielding good worst-case bounds, in: P. Deussen (ed.), Theoretical Computer Science (5th GI-Conf.), Lect. Notes in Comp. Sci. 104, Springer Verlag, Berlin, 1981, pp. 224\u2013233."},{"key":"9_CR18","series-title":"Techn. Rep.","volume-title":"Worst-case optimal insertion and deletion methods for decomposable searching problems","author":"M.H. Overmars","year":"1980","unstructured":"Overmars, M.H. and J. van Leeuwen, Worst-case optimal insertion and deletion methods for decomposable searching problems, Techn. Rep. RUU-CS-80-10, Dept. of Computer Science, University of Utrecht, Utrecht, 1980 (to appear in Inf. Proc. Lett.)."},{"key":"9_CR19","first-page":"148","volume-title":"Transforming static data structures into dynamic structures","author":"J.B. Saxe","year":"1979","unstructured":"Saxe, J.B. and J.L. Bentley, Transforming static data structures into dynamic structures, Proc. 20th Ann. IEEE Symp. Found. of Comp. Sci., Mayaquez and Rio Piedras, Puerto Rico, 1979, pp. 148\u2013168."},{"key":"9_CR20","volume-title":"Computational geometry","author":"M.I. Shamos","year":"1978","unstructured":"Shamos, M.I., Computational geometry, Ph.D. Thesis, Dept. of Computer Science, Yale University, New Haven, 1978 (to be published by Springer Verlag)."},{"key":"9_CR21","volume-title":"Dynamic systems of static data structures","author":"J. Leeuwen van","year":"1980","unstructured":"van Leeuwen, J. and H.A. Maurer, Dynamic systems of static data structures, Bericht 42, Inst. f. Informationsverarb., TU Graz, Graz, 1980."},{"key":"9_CR22","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0020-0190(80)90073-3","volume":"10","author":"J. Leeuwen van","year":"1980","unstructured":"van Leeuwen, J. and D. Wood, Dynamization of decomposable searching problems, Inf. Proc. Lett. 10 (1980) 51\u201356.","journal-title":"Inf. Proc. Lett."},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"Vuillemin, J., A data structure for maintaining priority queues, C.ACM 21 (1978) 309\u2013315.","journal-title":"C.ACM"},{"key":"9_CR24","volume-title":"The super B-tree algorithm","author":"D.E. Willard","year":"1979","unstructured":"Willard, D.E., The super B-tree algorithm, TR-03-79, The Aiken Comput. Lab., Harvard University, Cambridge (USA), 1979."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1981"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10856-4_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:40:02Z","timestamp":1619541602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10856-4_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108566","9783540387695"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-10856-4_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}