{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:59:36Z","timestamp":1725469176596},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_45","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"529-540","source":"Crossref","is-referenced-by-count":2,"title":["Maximal Empty Boxes Amidst Random Points"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"Minghui","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Suri, S.: Fast algorithms for computing the largest empty rectangle. In: Proceedings of the 3rd Annual Symposium on Computational Geometry, pp. 278\u2013290 (1987)","DOI":"10.1145\/41958.41988"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0166-218X(86)90071-5","volume":"13","author":"M. Atallah","year":"1986","unstructured":"Atallah, M., Frederickson, G.: A note on finding the maximum empty rectangle. Discrete Applied Mathematics\u00a013, 87\u201391 (1986)","journal-title":"Discrete Applied Mathematics"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF01553888","volume":"4","author":"M. Atallah","year":"1989","unstructured":"Atallah, M., Kosaraju, S.R.: An efficient algorithm for maxdominance, with applications. Algorithmica\u00a04, 221\u2013236 (1989)","journal-title":"Algorithmica"},{"key":"45_CR4","unstructured":"Backer, J., Keil, M.: The bichromatic rectangle problem in high dimensions. In: Proceedings of the 21st Canadian Conference on Computational Geometry, pp. 157\u2013160 (2009)"},{"key":"45_CR5","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.\u00a06034, pp. 14\u201325. Springer, Heidelberg (2010)"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1145\/322092.322095","volume":"25","author":"J.L. Bentley","year":"1978","unstructured":"Bentley, J.L., Kung, H.T., Schkolnick, M., Thompson, C.D.: On the average number of maxima in a set of vectors and applications. Journal of the ACM\u00a025, 536\u2013543 (1978)","journal-title":"Journal of the ACM"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0215022","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Drysdale, R., Lee, D.T.: Computing the largest empty rectangle. SIAM Journal on Computing\u00a015, 300\u2013315 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR8","volume-title":"Principles and Techniques in Combinatorics","author":"C. Chuan-Chong","year":"1996","unstructured":"Chuan-Chong, C., Khee-Meng, K.: Principles and Techniques in Combinatorics. World Scientific, Singapore (1996)"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0255(92)90115-O","volume":"64","author":"A. Datta","year":"1992","unstructured":"Datta, A.: Efficient algorithms for the largest empty rectangle problem. Information Sciences\u00a064, 121\u2013141 (1992)","journal-title":"Information Sciences"},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0020-0255(00)00047-5","volume":"128","author":"A. Datta","year":"2000","unstructured":"Datta, A., Soundaralakshmi, S.: An efficient algorithm for computing the maximum empty rectangle in three dimensions. Information Sciences\u00a0128, 43\u201365 (2000)","journal-title":"Information Sciences"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., Jiang, M.: On the largest empty axis-parallel box amidst n points. Algorithmica (2012), doi:10.1007\/s00453-012-9635-5","DOI":"10.1007\/s00453-012-9635-5"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0304-3975(02)00738-7","volume":"296","author":"J. Edmonds","year":"2003","unstructured":"Edmonds, J., Gryz, J., Liang, D., Miller, R.: Mining for empty spaces in large data sets. Theoretical Computer Science\u00a0296, 435\u2013452 (2003)","journal-title":"Theoretical Computer Science"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Giannopoulos, P., Knauer, C., Wahlstr\u00f6m, M., Werner, D.: Hardness of discrepancy computation and \u03b5-net verification in high dimension. Journal of Complexity (2011), doi:10.1016\/j.jco.2011.09.001","DOI":"10.1016\/j.jco.2011.09.001"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1137\/070684483","volume":"38","author":"H. Kaplan","year":"2008","unstructured":"Kaplan, H., Rubin, N., Sharir, M., Verbin, E.: Efficient colored orthogonal range counting. SIAM Journal on Computing\u00a038, 982\u20131011 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/00207168608803518","volume":"19","author":"R. Klein","year":"1986","unstructured":"Klein, R.: Direct dominance of points. International Journal of Computer Mathematics\u00a019, 225\u2013244 (1986)","journal-title":"International Journal of Computer Mathematics"},{"key":"45_CR16","unstructured":"Kudryavtsev, L.D.: The method of undetermined coefficients. In: Hazewinkel, M. (ed.) Encyclopaedia of Mathematics. Springer (2001)"},{"key":"45_CR17","volume-title":"Higher Algebra","author":"A. Kurosh","year":"1975","unstructured":"Kurosh, A.: Higher Algebra. Mir Publishers, Moscow (1975)"},{"key":"45_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Computer Journal\u00a051, 60\u201378 (2008)","journal-title":"Computer Journal"},{"key":"45_CR19","unstructured":"McKenna, M., O\u2019Rourke, J., Suri, S.: Finding the largest rectangle in an orthogonal polygon. In: Proceedings of the 23rd Annual Allerton Conference on Communication, Control and Computing, Urbana-Champaign, Illinois (October 1985)"},{"key":"45_CR20","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0166-218X(84)90124-0","volume":"8","author":"A. Naamad","year":"1984","unstructured":"Naamad, A., Lee, D.T., Hsu, W.-L.: On the maximum empty rectangle problem. Discrete Applied Mathematics\u00a08, 267\u2013277 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"45_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01840377","volume":"5","author":"M. Orlowski","year":"1990","unstructured":"Orlowski, M.: A new algorithm for the largest empty rectangle problem. Algorithmica\u00a05, 65\u201373 (1990)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:05:36Z","timestamp":1620129936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}