{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:39:43Z","timestamp":1762270783108},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf01553888","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T18:07:35Z","timestamp":1114020455000},"page":"221-236","source":"Crossref","is-referenced-by-count":44,"title":["An efficient algorithm for maxdominance, with applications"],"prefix":"10.1007","volume":"4","author":[{"given":"Mikhail J.","family":"Atallah","sequence":"first","affiliation":[]},{"given":"S. Rao","family":"Kosaraju","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"No. 1","key":"BF01553888_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(86)90071-5","volume":"13","author":"M. J. Atallah","year":"1986","unstructured":"M. J. Atallah and G. N. Frederickson, A Note on Finding a Maximum Empty Rectangle,Discrete Applied Mathematics, Vol. 13, No. 1, pp. 87\u201391 (1986).","journal-title":"Discrete Applied Mathematics"},{"key":"BF01553888_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"BF01553888_CR3","unstructured":"M. J. Atallah, G. K. Manacher, and J. Urrutia, Finding a Minimum Independent Dominating Set in a Permutation Graph, Purdue C.S. Tech. Rept."},{"key":"BF01553888_CR4","doi-asserted-by":"crossref","unstructured":"A. Aggarwal and S. Suri, Fast Algorithms for Computing the Largest Empty Rectangle,Proc. 3rd ACM Symposium on Computational Geomtry, June 1987 (to appear).","DOI":"10.1145\/41958.41988"},{"key":"BF01553888_CR5","unstructured":"B. Bhattacharya and H. ElGindy, Fast Algorithms for the Maximum Empty Rectangle Problem, University of Pennsylvania and Simon Fraser University Tech. Repts., March 1987."},{"key":"BF01553888_CR6","doi-asserted-by":"crossref","unstructured":"B. Chazelle, Computing on a Free Tree via Complexity-Preserving Mappings,Proc. 25th Annual IEEE Symposium on Foundations of Computer Science, pp. 358\u2013368, 1984.","DOI":"10.1109\/SFCS.1984.715936"},{"issue":"No. 1","key":"BF01553888_CR7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0215022","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle, R. L. Drysdale, and D. T. Lee, Computing the Largest Empty Rectangle,SIAM Journal on Computing, Vol. 15, No. 1, pp. 300\u2013315 (1986).","journal-title":"SIAM Journal on Computing"},{"issue":"No. 1","key":"BF01553888_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288531","volume":"13","author":"E. W. Dijkstra","year":"1980","unstructured":"E. W. Dijkstra, Some Beautiful Arguments Using Mathematical Induction,Acta Informatica, Vol. 13, No. 1, pp. 1\u20138 (1980).","journal-title":"Acta Informatica"},{"issue":"No. 1","key":"BF01553888_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00625277","volume":"18","author":"R. B. K. Dewar","year":"1982","unstructured":"R. B. K. Dewar, S. M. Merritt, and M. Sharir, Some Modified Algorithms for Dijkstra's Longest Upsequence Problem,Acta Informatica, Vol. 18, No. 1, pp. 1\u201315 (1982).","journal-title":"Acta Informatica"},{"key":"BF01553888_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","volume":"6","author":"M. Farber","year":"1985","unstructured":"M. Farber and J. M. Keil, Domination in Permutation Graphs,Journal of Algorithms, 6, pp. 309\u2013321 (1985).","journal-title":"Journal of Algorithms"},{"key":"BF01553888_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(84)90124-0","volume":"8","author":"A. Naamad","year":"1984","unstructured":"A. Naamad, D. T. Lee, and W.-L. Hsu, On the Maximum Empty Rectangle Problem,Discrete Applied Mathematics, Vol. 8, pp. 267\u2013277 (1984).","journal-title":"Discrete Applied Mathematics"},{"key":"BF01553888_CR12","unstructured":"M. Orlowski, A New Algorithm for the Largest Empty Rectangle Problem, manuscript."},{"key":"BF01553888_CR13","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M. H. Overmars","year":"1981","unstructured":"M. H. Overmars and J. Van Leeuwen, Maintenance of Configurations in the Plane,Journal of Computer and Systems Sciences, Vol. 23, pp. 166\u2013204 (1981).","journal-title":"Journal of Computer and Systems Sciences"},{"key":"BF01553888_CR14","unstructured":"T. H. K. Prasad and C. P. Rangan, An Improved Algorithm for the Maximum Empty Rectangle Problem, IIT Madras Tech. Rept., March 1987."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553888.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553888\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:21:13Z","timestamp":1556878873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":14,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553888"],"URL":"https:\/\/doi.org\/10.1007\/bf01553888","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}