{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:51:17Z","timestamp":1725540677393},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_28","type":"book-chapter","created":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T04:32:11Z","timestamp":1356064331000},"page":"263-273","source":"Crossref","is-referenced-by-count":4,"title":["On Counting Range Maxima Points in Plane"],"prefix":"10.1007","author":[{"given":"Anil Kishore","family":"Kalavagattu","sequence":"first","affiliation":[]},{"given":"Jatin","family":"Agarwal","sequence":"additional","affiliation":[]},{"given":"Ananda Swarup","family":"Das","sequence":"additional","affiliation":[]},{"given":"Kishore","family":"Kothapalli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional divide-and-conquer. Communications of the ACM\u00a023(4), 214\u2013229 (1980)","journal-title":"Communications of the ACM"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-30551-4_49","volume-title":"Algorithms and Computation","author":"J. J\u00e1J\u00e1","year":"2004","unstructured":"J\u00e1J\u00e1, J., Mortensen, C.W., Shi, Q.: Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 558\u2013568. Springer, Heidelberg (2004)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Chan, C.-Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (2006)","DOI":"10.1145\/1142473.1142530"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H.T. Kung","year":"1975","unstructured":"Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. Journal of the ACM\u00a022(4), 469\u2013476 (1975)","journal-title":"Journal of the ACM"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02187797","volume":"5","author":"G.N. Frederickson","year":"1990","unstructured":"Frederickson, G.N., Rodger, S.H.: A New Approach to the Dynamic Maintenance of Maximal Points in a Plane. Discrete & Comp. Geom.\u00a05, 365\u2013374 (1990)","journal-title":"Discrete & Comp. Geom."},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0020-0190(91)90010-F","volume":"40","author":"R. Janardan","year":"1991","unstructured":"Janardan, R.: On the Dynamic Maintenance of Maximal Points in the Plane. Information Processing Letters\u00a040(2), 59\u201364 (1991)","journal-title":"Information Processing Letters"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-22006-7_22","volume-title":"Automata, Languages and Programming","author":"G.S. Brodal","year":"2011","unstructured":"Brodal, G.S., Tsakalidis, K.: Dynamic Planar Range Maxima Queries. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 256\u2013267. Springer, Heidelberg (2011)"},{"key":"28_CR8","unstructured":"Kalavagattu, A.K., Das, A.S., Kothapalli, K., Srinathan, K.: On Finding Skyline Points for Range Queries in Plane. In: Proceedings of 23rd Canadian Conference on Computational Geometry (CCCG), pp. 343\u2013346 (2011)"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms. Acta Informatica\u00a01, 290\u2013306 (1972)","journal-title":"Acta Informatica"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.E.: Planar point location using persistent search trees. Communications of the ACM\u00a029, 669\u2013679 (1986)","journal-title":"Communications of the ACM"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-28076-4_8","volume-title":"WALCOM: Algorithms and Computation","author":"A.S. Das","year":"2012","unstructured":"Das, A.S., Gupta, P., Kalavagattu, A.K., Agarwal, J., Srinathan, K., Kothapalli, K.: Range Aggregate Maximal Points in the Plane. In: Rahman, M. S., Nakano, S.-i. (eds.) WALCOM 2012. LNCS, vol.\u00a07157, pp. 52\u201363. Springer, Heidelberg (2012)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer (2000) ISBN 3-540-65620-0","DOI":"10.1007\/978-3-662-04245-8"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.comgeo.2010.09.001","volume":"44","author":"C.C. Yu","year":"2011","unstructured":"Yu, C.C., Hon, W.K., Wang, B.F.: Improved Data Structures for Orthogonal Range Successor Queries. Computational Geometry: Theory and Applications\u00a044, 148\u2013159 (2011)","journal-title":"Computational Geometry: Theory and Applications"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:33:52Z","timestamp":1620135232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}