{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:08:44Z","timestamp":1743077324697,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_18","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"231-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Box Problem on Stochastic Points"],"prefix":"10.1007","author":[{"given":"Luis Evaristo","family":"Caraballo","sequence":"first","affiliation":[]},{"given":"Pablo","family":"P\u00e9rez-Lantero","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0095-1725","authenticated-orcid":false,"given":"Carlos","family":"Seara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1217-3913","authenticated-orcid":false,"given":"Inmaculada","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Kumar, N., Sintos, S., Suri, S.: Range-max queries on uncertain data. J. Comput. Syst. Sci. (2017)","DOI":"10.1145\/2902251.2902281"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1009942427413","volume":"6","author":"P Alliez","year":"2000","unstructured":"Alliez, P., Devillers, O., Snoeyink, J.: Removing degeneracies by perturbing the problem or perturbing the world. Reliab. Comput. 6(1), 61\u201379 (2000)","journal-title":"Reliab. Comput."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-12200-2_3","volume-title":"LATIN 2010: Theoretical Informatics","author":"J Backer","year":"2010","unstructured":"Backer, J., Keil, J.M.: The mono- and bichromatic empty rectangle and square problems in all dimensions. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 14\u201325. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12200-2_3"},{"issue":"8","key":"18_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ipl.2014.03.007","volume":"114","author":"J Barbay","year":"2014","unstructured":"Barbay, J., Chan, T.M., Navarro, G., P\u00e9rez-Lantero, P.: Maximum-weight planar boxes in $${O}(n^2)$$ time (and better). Inf. Process. Lett. 114(8), 437\u2013445 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10878-015-9971-x","volume":"33","author":"LE Caraballo","year":"2017","unstructured":"Caraballo, L.E., Ochoa, C., P\u00e9rez-Lantero, P., Rojas-Ledesma, J.: Matching colored points with rectangles. J. Comb. Optim. 33(2), 403\u2013421 (2017)","journal-title":"J. Comb. Optim."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Kamousi, P., Suri, S.: Stochastic minimum spanning trees in Euclidean spaces. In: SoCG 2011, pp. 65\u201374 (2011)","DOI":"10.1137\/1.9781611973013.12"},{"issue":"2\u20133","key":"18_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jalgor.2009.01.001","volume":"64","author":"C Cort\u00e9s","year":"2009","unstructured":"Cort\u00e9s, C., D\u00edaz-B\u00e1\u00f1ez, J.M., P\u00e9rez-Lantero, P., Seara, C., Urrutia, J., Ventura, I.: Bichromatic separability with two boxes: a general approach. J. Algorithms 64(2\u20133), 79\u201388 (2009)","journal-title":"J. Algorithms"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2008.09.034","volume":"410","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, L.: The complexity of power-index comparison. Theor. Comput. Sci. 410(1), 101\u2013107 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, D., Munteanu, A., Sohler, C.: Smallest enclosing ball for probabilistic data. In: SoCG 2014, pp. 214\u2013223 (2014)","DOI":"10.1145\/2582112.2582114"},{"issue":"2","key":"18_CR10","first-page":"32","volume":"8","author":"M Fink","year":"2017","unstructured":"Fink, M., Hershberger, J., Kumar, N., Suri, S.: Hyperplane separability and convexity of probabilistic point sets. JCG 8(2), 32\u201357 (2017)","journal-title":"JCG"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.comgeo.2012.10.010","volume":"47","author":"P Kamousi","year":"2014","unstructured":"Kamousi, P., Chan, T.M., Suri, S.: Closest pair and the post office problem for stochastic points. Comput. Geom. 47(2), 214\u2013223 (2014)","journal-title":"Comput. Geom."},{"issue":"8","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1093\/comjnl\/bxv124","volume":"59","author":"P P\u00e9rez-Lantero","year":"2016","unstructured":"P\u00e9rez-Lantero, P.: Area and perimeter of the convex hull of stochastic points. Comput. J. 59(8), 1144\u20131154 (2016)","journal-title":"Comput. J."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/978-3-642-40450-4_67","volume-title":"Algorithms \u2013 ESA 2013","author":"S Suri","year":"2013","unstructured":"Suri, S., Verbeek, K., Y\u0131ld\u0131z, H.: On the most likely convex hull of uncertain points. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 791\u2013802. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_67"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"SP Vadhan","year":"2001","unstructured":"Vadhan, S.P.: The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput. 31(2), 398\u2013427 (2001)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"100","author":"LG Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 100(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:01:56Z","timestamp":1709827316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}