{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:44:21Z","timestamp":1743147861713,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030115081"},{"type":"electronic","value":"9783030115098"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-11509-8_13","type":"book-chapter","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T14:54:48Z","timestamp":1547823288000},"page":"150-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Localized Query: Color Spanning Variations"],"prefix":"10.1007","author":[{"given":"Ankush","family":"Acharyya","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,19]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-44676-1_23","volume-title":"Algorithms \u2014 ESA 2001","author":"M Abellanas","year":"2001","unstructured":"Abellanas, M., et al.: Smallest color-spanning objects. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 278\u2013289. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_23"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.comgeo.2012.09.009","volume":"46","author":"J Augustine","year":"2013","unstructured":"Augustine, J., Das, S., Maheshwari, A., Nandy, S.C., Roy, S., Sarvattomananda, S.: Localized geometric query problems. Comput. Geom. 46(3), 340\u2013357 (2013)","journal-title":"Comput. Geom."},{"key":"13_CR3","unstructured":"Augustine, J., Das, S., Maheshwari, A., Nandy, S.C., Roy, S., Sarvattomananda, S.: Recognizing the largest empty circle and axis-parallel rectangle in a desired location. arXiv preprint arXiv:1004.0558 (2010)"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jda.2009.10.002","volume":"8","author":"J Augustine","year":"2010","unstructured":"Augustine, J., Putnam, B., Roy, S.: Largest empty circle centered on a query line. J. Discret. Algorithms 8(2), 143\u2013153 (2010)","journal-title":"J. Discret. Algorithms"},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"key":"13_CR6","unstructured":"Bint, G., Maheshwari, A., Nandy, S.C., Smid, M.: Partial enclosure range searching. Preprint"},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s00454-012-9410-z","volume":"47","author":"TM Chan","year":"2012","unstructured":"Chan, T.M.: Optimal partition trees. Discret. Comput. Geom. 47(4), 661\u2013690 (2012)","journal-title":"Discret. Comput. Geom."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2011.12.075","volume":"508","author":"DZ Chen","year":"2013","unstructured":"Chen, D.Z., Misio\u0142ek, E.: Algorithms for interval structures with applications. Theoret. Comput. Sci. 508, 41\u201353 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"13_CR9","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1142\/S0218195909003076","volume":"19","author":"S Das","year":"2009","unstructured":"Das, S., Goswami, P.P., Nandy, S.C.: Smallest color-spanning object revisited. Int. J. Comput. Geom. Appl. 19(5), 457\u2013478 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-21404-7_20","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"M Gester","year":"2015","unstructured":"Gester, M., H\u00e4hnle, N., Schneider, J.: Largest empty square queries in rectilinear polygons. In: Gervasi, O., et al. (eds.) ICCSA 2015. LNCS, vol. 9155, pp. 267\u2013282. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21404-7_20"},{"key":"13_CR11","unstructured":"Hasheminejad, J., Khanteimouri, P., Mohades, A.: Computing the smallest color spanning equilateral triangle. In: Proceedings of 31st EuroCG, pp. 32\u201335 (2015)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"DP Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of voronoi surfaces and its applications. Discret. Comput. Geom. 9, 267\u2013291 (1993)","journal-title":"Discret. Comput. Geom."},{"key":"13_CR13","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 JaJa","year":"2004","unstructured":"JaJa, 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. 3341, pp. 558\u2013568. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30551-4_49"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.tcs.2015.01.039","volume":"609","author":"M Jiang","year":"2016","unstructured":"Jiang, M., Wang, H.: Shortest color-spanning intervals. Theoret. Comput. Sci. 609, 561\u2013568 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"13_CR15","first-page":"3","volume":"6","author":"T Kaminker","year":"2015","unstructured":"Kaminker, T., Sharir, M.: Finding the largest disk containing a query point in logarithmic time with linear storage. JoCG 6(2), 3\u201318 (2015)","journal-title":"JoCG"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Sharir, M.: Finding the maximal empty rectangle containing a query point. arXiv preprint arXiv:1106.3628 (2011)","DOI":"10.1145\/2261250.2261292"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-642-45030-3_59","volume-title":"Algorithms and Computation","author":"P Khanteimouri","year":"2013","unstructured":"Khanteimouri, P., Mohades, A., Abam, M.A., Kazemi, M.R.: Computing the smallest color-spanning axis-parallel square. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 634\u2013643. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_59"},{"key":"13_CR18","unstructured":"Khanteimouri, P., Mohades, A., Abam, M.A., Kazemi, M.R.: Spanning colored points with intervals. In: CCCG (2013)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11509-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:20:43Z","timestamp":1710264043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-11509-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030115081","9783030115098"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11509-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kharagpur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cse.iitkgp.ac.in\/conf\/CALDAM\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}