{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T20:49:43Z","timestamp":1762980583329,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1823267"],"award-info":[{"award-number":["1823267"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3221269.3221301","type":"proceedings-article","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T16:26:42Z","timestamp":1531240002000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximizing area-range sum for spatial shapes (MAxRS\n            <sup>3<\/sup>\n            )"],"prefix":"10.1145","author":[{"given":"Muhammed Mas-ud","family":"Hussain","sequence":"first","affiliation":[{"name":"Northwestern University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goce","family":"Trajcevski","sequence":"additional","affiliation":[{"name":"Iowa State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"volume-title":"19th EDBT.","author":"Amagata Daichi","key":"e_1_3_2_1_1_1","unstructured":"Daichi Amagata and Takahiro Hara . 2016. Monitoring MaxRS in Spatial Data Streams . In 19th EDBT. Daichi Amagata and Takahiro Hara. 2016. Monitoring MaxRS in Spatial Data Streams. In 19th EDBT."},{"key":"e_1_3_2_1_2_1","unstructured":"Ulrike Bartuschka Kurt Mehlhorn and Stefan N\u00e4her. 1997. A robust and efficient implementation of a sweep line algorithm for the straight line segment intersection problem. In IN PROC. WORKSHOP ON ALGORITHM ENGINEERING. Citeseer.  Ulrike Bartuschka Kurt Mehlhorn and Stefan N\u00e4her. 1997. A robust and efficient implementation of a sweep line algorithm for the straight line segment intersection problem. In IN PROC. WORKSHOP ON ALGORITHM ENGINEERING. Citeseer."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629477"},{"key":"e_1_3_2_1_4_1","volume-title":"Kazi Ashik Islam, and Mohammed Eunus Ali","author":"Hussain Muhammed","year":"2017","unstructured":"Muhammed Mas-ud Hussain , Goce Trajcevski , Kazi Ashik Islam, and Mohammed Eunus Ali . 2017 . Visualization of Range-Constrained Optimal Density Clustering of Trajectories. In SSTD. 427--432. Muhammed Mas-ud Hussain, Goce Trajcevski, Kazi Ashik Islam, and Mohammed Eunus Ali. 2017. Visualization of Range-Constrained Optimal Density Clustering of Trajectories. In SSTD. 427--432."},{"key":"e_1_3_2_1_5_1","volume-title":"Mohammed Eunus Ali, and Goce Trajcevski.","author":"Mostafiz Mir Imtiaz","year":"2017","unstructured":"Mir Imtiaz Mostafiz , S. M. Farabi Mahmud , Muhammed Mas-ud Hussain , Mohammed Eunus Ali, and Goce Trajcevski. 2017 . Class-based Conditional MaxRS Query in Spatial Data Streams. In SSDBM. Mir Imtiaz Mostafiz, S. M. Farabi Mahmud, Muhammed Mas-ud Hussain, Mohammed Eunus Ali, and Goce Trajcevski. 2017. Class-based Conditional MaxRS Query in Spatial Data Streams. In SSDBM."},{"key":"e_1_3_2_1_6_1","volume-title":"A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Computers & Mathematics with Applications 29, 8","author":"Nandy Subhas C","year":"1995","unstructured":"Subhas C Nandy and Bhargab B Bhattacharya . 1995. A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Computers & Mathematics with Applications 29, 8 ( 1995 ). Subhas C Nandy and Bhargab B Bhattacharya. 1995. A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Computers & Mathematics with Applications 29, 8 (1995)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Michael Ian Shamos and Dan Hoey. 1976. Geometric Intersection Problems. In FOCS.  Michael Ian Shamos and Dan Hoey. 1976. Geometric Intersection Problems. In FOCS.","DOI":"10.1109\/SFCS.1976.16"}],"event":{"name":"SSDBM '18: 30th International Conference on Scientific and Statistical Database Management","acronym":"SSDBM '18","location":"Bozen-Bolzano Italy"},"container-title":["Proceedings of the 30th International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3221269.3221301","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3221269.3221301","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3221269.3221301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:29Z","timestamp":1750286609000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3221269.3221301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":7,"alternative-id":["10.1145\/3221269.3221301","10.1145\/3221269"],"URL":"https:\/\/doi.org\/10.1145\/3221269.3221301","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}