{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:17:48Z","timestamp":1726409868293},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_22","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"203-212","source":"Crossref","is-referenced-by-count":0,"title":["Untangled Monotonic Chains and Adaptive Range Search"],"prefix":"10.1007","author":[{"given":"Diego","family":"Arroyuelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Claude","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Dorrigiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick K.","family":"Nicholson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Salinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Skala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Arge, L., de Berg, M., Haverkort, H.J., Yi, K.: The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Transactions on Algorithms\u00a04(1) (2008)","DOI":"10.1145\/1328911.1328920"},{"issue":"9","key":"22_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"issue":"6","key":"22_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0020-0190(89)90095-1","volume":"31","author":"P.A. Bloniarz","year":"1989","unstructured":"Bloniarz, P.A., Ravi, S.S.: An \u03a9(n logn) lower bound for decomposing a set of points into chains. Information Processing Letters\u00a031(6), 319\u2013322 (1989)","journal-title":"Information Processing Letters"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional cascading: I. a data structuring technique. Algorithmica\u00a01(2), 133\u2013162 (1986)","journal-title":"Algorithmica"},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.jda.2008.01.002","volume":"6","author":"G. Stefano Di","year":"2008","unstructured":"Di Stefano, G., Krause, S., L\u00fcbbecke, M.E., Zimmermann, U.T.: On minimum k-modal partitions of permutations. Journal of Discrete Algorithms\u00a06(3), 381\u2013392 (2008)","journal-title":"Journal of Discrete Algorithms"},{"issue":"5","key":"22_CR6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0020-0190(02)00288-0","volume":"84","author":"F.V. Fomin","year":"2002","unstructured":"Fomin, F.V., Kratsch, D., Novelli, J.C.: Approximating minimum cocolorings. Information Processing Letters\u00a084(5), 285\u2013290 (2002)","journal-title":"Information Processing Letters"},{"issue":"2","key":"22_CR7","first-page":"47","volume":"14","author":"A. Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Record (ACM Special Interest Group on Management of Data)\u00a014(2), 47\u201357 (1984)","journal-title":"SIGMOD Record (ACM Special Interest Group on Management of Data)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-49257-7_17","volume-title":"Database Theory - ICDT\u201999","author":"K.V.R. Kanth","year":"1999","unstructured":"Kanth, K.V.R., Singh, A.: Optimal dynamic range searching in non-replicating index structures. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 257\u2013276. Springer, Heidelberg (1999)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/SFCS.1978.1","volume-title":"19th Annual Symposium on Foundations of Computer Science (FOCS 1978)","author":"G.S. Lueker","year":"1978","unstructured":"Lueker, G.S.: A data structure for orthogonal range queries. In: 19th Annual Symposium on Foundations of Computer Science (FOCS 1978), Long Beach, Ca., USA, pp. 28\u201334. IEEE Computer Society Press, Los Alamitos (1978)"},{"key":"22_CR10","unstructured":"Munro, J.I.: A multikey search problem. In: Proceedings of the 17th Allerton Conference on Communication, Control and Computing, University of Illinois, pp. 241\u2013244 (1979)"},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.comgeo.2008.09.001","volume":"42","author":"Y. Nekrich","year":"2009","unstructured":"Nekrich, Y.: Orthogonal range searching in linear and almost-linear space. Computational Geometry\u00a042(4), 342\u2013351 (2009)","journal-title":"Computational Geometry"},{"issue":"5","key":"22_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(85)90093-6","volume":"21","author":"K.J. Supowit","year":"1985","unstructured":"Supowit, K.J.: Decomposing a set of points into chains, with applications to permutation and circle graphs. Information Processing Letters\u00a021(5), 249\u2013252 (1985)","journal-title":"Information Processing Letters"},{"key":"22_CR13","unstructured":"van Leeuwen, J., Schoone, A.A.: Untangling a traveling salesman tour in the plane. In: Proceedings of the 7th Conference on Graphtheoretic Concepts in Computer Science (WG 1981), M\u00fcnchen, Germany, pp. 87\u201398. Hanser Verlag (1981)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-72504-6_4","volume-title":"Theory and Applications of Models of Computation","author":"B. Yang","year":"2007","unstructured":"Yang, B., Chen, J., Lu, E., Zheng, S.Q.: A comparative study of efficient algorithms for partitioning a sequence into monotone subsequences. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 46\u201357. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:58:29Z","timestamp":1558285109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}