{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:34:22Z","timestamp":1743104062289,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_13","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"165-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cause I\u2019m a Genial Imprecise Point: Outlier Detection for Uncertain Data"],"prefix":"10.1007","author":[{"given":"Vahideh","family":"Keikha","sequence":"first","affiliation":[]},{"given":"Hamidreza","family":"Keikha","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Mohades","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. J. Algorithms 12(1), 38\u201356 (1991)","journal-title":"J. Algorithms"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.comgeo.2010.10.002","volume":"44","author":"H-K Ahn","year":"2011","unstructured":"Ahn, H.-K., et al.: Covering points by disjoint boxes with outliers. Comput. Geom. 44(3), 178\u2013190 (2011)","journal-title":"Comput. Geom."},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.jda.2008.12.002","volume":"7","author":"R Atanassov","year":"2009","unstructured":"Atanassov, R., et al.: Algorithms for optimal outlier removal. J. Discret. Algorithms 7(2), 239\u2013248 (2009)","journal-title":"J. Discret. Algorithms"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.comgeo.2018.08.002","volume":"76","author":"SW Bae","year":"2019","unstructured":"Bae, S.W.: Computing a minimum-width square or rectangular annulus with outliers. Comput. Geom. 76, 33\u201345 (2019)","journal-title":"Comput. Geom."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Har-Peled, S.: Smallest k-enclosing rectangle revisited. Discret. Computat. Geom. 1\u201323 (2020)","DOI":"10.1007\/s00454-020-00239-3"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1137\/070697720","volume":"40","author":"C Daskalakis","year":"2011","unstructured":"Daskalakis, C., Karp, R.M., Mossel, E., Riesenfeld, S.J., Verbin, E.: Sorting and selection in posets. SIAM J. Comput. 40(3), 597\u2013622 (2011)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0925-7721(94)90003-5","volume":"4","author":"A Efrat","year":"1994","unstructured":"Efrat, A., Sharir, M., Ziv, A.: Computing the smallest k-enclosing circle and related problems. Comput. Geom. 4(3), 119\u2013136 (1994)","journal-title":"Comput. Geom."},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D., Erickson, J.: Iterated nearest neighbors and finding minimal polytopes. Discret. Comput. Geom. 11(3), 321\u2013350 (1994). https:\/\/doi.org\/10.1007\/BF02574012","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00453-004-1123-0","volume":"41","author":"S Har-Peled","year":"2005","unstructured":"Har-Peled, S., Mazumdar, S.: Fast algorithms for computing the smallest k-enclosing circle. Algorithmica 41(3), 147\u2013157 (2005)","journal-title":"Algorithmica"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2019.01.007","volume":"81","author":"H Kaplan","year":"2019","unstructured":"Kaplan, H., Roy, S., Sharir, M.: Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. Comput. Geom. 81, 1\u201311 (2019)","journal-title":"Comput. Geom."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.tcs.2020.02.006","volume":"814","author":"V Keikha","year":"2020","unstructured":"Keikha, V., L\u00f6ffler, M., Mohades, A.: A fully polynomial time approximation scheme for the smallest diameter of imprecise points. Theor. Comput. Sci. 814, 259\u2013270 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom. 43(4), 419\u2013433 (2010). Special Issue: 10th Workshop on Algorithms and Data Structures (WADS 2007)","DOI":"10.1016\/j.comgeo.2009.03.007"},{"key":"13_CR13","unstructured":"L\u00f6ffler, M.: Data imprecision in computational geometry. Ph.D. thesis, Utrecht University (2009)"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02570713","volume":"14","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On geometric optimization with few violated constraints. Discret. Comput. Geom. 14(4), 365\u2013384 (1995). https:\/\/doi.org\/10.1007\/BF02570713","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1134\/S1990478913030186","volume":"7","author":"V Shenmaier","year":"2013","unstructured":"Shenmaier, V.: The problem of a minimal ball enclosing k points. J. Appl. Ind. Math. 7(3), 444\u2013448 (2013)","journal-title":"J. Appl. Ind. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:09:56Z","timestamp":1611792596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","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":"Rupnagar","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","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":"39","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":"0","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":"48% - 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":"2,8","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":"2,21","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)"}}]}}