{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:32:11Z","timestamp":1649028731640},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":[[1996,8]]},"DOI":"10.1007\/bf01940645","type":"journal-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T14:52:21Z","timestamp":1123080741000},"page":"161-180","source":"Crossref","is-referenced-by-count":3,"title":["A New combinatorial approach to optimal embeddings of rectangles"],"prefix":"10.1007","volume":"16","author":[{"given":"Shou-Hsuan S.","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongfei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rakesh M.","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"No. 9","key":"BF01940645_CR1","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1982.1676109","volume":"31","author":"R. Aleliunas","year":"1982","unstructured":"R. Aleliunas and A. L. Rosenberg, On Embedding Rectangular Grids in Square Grids,IEEE Trans. Comput., Vol. 31, No. 9, pp. 907\u2013913, 1982.","journal-title":"IEEE Trans. Comput."},{"key":"BF01940645_CR2","doi-asserted-by":"crossref","unstructured":"S. Bhatt, F. Chung, T. Leighton, and A. L. Rosenberg, Optimal Simulations of Tree Machines,Proc. 27th Symp. on Foundations of Computer Science, pp. 274\u2013282, 1986.","DOI":"10.1109\/SFCS.1986.38"},{"issue":"No. 1","key":"BF01940645_CR3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0221012","volume":"21","author":"S. Bhatt","year":"1992","unstructured":"S. Bhatt, F. Chung, T. Leighton, and A. L. Rosenberg, Efficient Embeddings of Trees in Hypercubes,SIAM J. Comput., Vol. 21, No. 1, pp. 151\u2013162, February 1992.","journal-title":"SIAM J. Comput."},{"key":"BF01940645_CR4","first-page":"295","volume":"3","author":"M. Y. Chan","year":"1988","unstructured":"M. Y. Chan, Dilation-2 Embeddings of Grids into Hypercubes,Proc. Internat. Conf. on Parallel Processing, Vol. 3, pp. 295\u2013298, 1988.","journal-title":"Proc. Internat. Conf. on Parallel Processing"},{"key":"BF01940645_CR5","doi-asserted-by":"crossref","unstructured":"M. Y. Chan, Embedding ofD-dimensional Grids into Optimal Hypercubes,Proc. Symp. on Parallel Algorithms and Architectures, pp. 52\u201357, 1989.","DOI":"10.1145\/72935.72941"},{"issue":"No. 5","key":"BF01940645_CR6","first-page":"833","volume":"20","author":"M. Y. Chan","year":"1991","unstructured":"M. Y. Chan, Embedding Grids into Optimal Hypercubes,SIAM J. Comput., Vol. 20, No. 5, pp. 833\u2013864, October 1991.","journal-title":"SIAM J. Comput."},{"issue":"No. 10","key":"BF01940645_CR7","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1109\/12.5991","volume":"37","author":"M. Y. Chan","year":"1988","unstructured":"M. Y. Chan and F. Y. L. Chin, On Embedding Rectangular Grids in Hypercubes,IEEE Trans. Comput., Vol. 37, No. 10, pp. 1285\u20131288, 1988.","journal-title":"IEEE Trans. Comput."},{"key":"BF01940645_CR8","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/359361.359447","volume":"21","author":"R. A. Millo De","year":"1978","unstructured":"R. A. DeMillo, S. C. Eisenstat, and R. J. Lipton, Preserving Average Proximity in Arrays,Comm. ACM, Vol. 21, pp. 228\u2013231, 1978.","journal-title":"Comm. ACM"},{"issue":"No. 1","key":"BF01940645_CR9","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/12.67319","volume":"40","author":"J. A. Ellis","year":"1991","unstructured":"J. A. Ellis, Embedding Rectangular Grids into Square Grids,IEEE Trans. Comput., Vol. 40, No. 1, pp. 46\u201352, 1991.","journal-title":"IEEE Trans. Comput."},{"key":"BF01940645_CR10","first-page":"73","volume":"III","author":"S. H. S. Huang","year":"1993","unstructured":"S. H. S. Huang, H. Liu, and R. M. Verma, On Embedding Rectangles into Optimal Squares,Proc. 22nd Internat. Conf. on Parallel Processing, Vol. III, pp. 73\u201376, 1993.","journal-title":"Proc. 22nd Internat. Conf. on Parallel Processing"},{"key":"BF01940645_CR11","doi-asserted-by":"crossref","unstructured":"S. R. Kosaraju and M. J. Atallah, Optimal Simulations Between Mesh-Connected Arrays of Processors,Proc. ACM Symp. on Theory of Computing, pp. 264\u2013272, 1986.","DOI":"10.1145\/12130.12157"},{"key":"BF01940645_CR12","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1145\/44483.44494","volume":"35","author":"S. R. Kosaraju","year":"1988","unstructured":"S. R. Kosaraju and M. J. Atallah, Optimal Simulations Between Mesh-Connected Arrays of Processors,J. Assoc. Comput. Mach., Vol. 35, pp. 635\u2013650, 1988.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01940645_CR13","doi-asserted-by":"crossref","unstructured":"C. E. Leiserson, Area-Efficient Graph Layouts (for VLSI),Proc. 21st IEEE Symp. on Foundations of Computer Science, pp. 270\u2013281, 1980.","DOI":"10.1109\/SFCS.1980.13"},{"key":"BF01940645_CR14","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/321978.321990","volume":"23","author":"R. J. Lipton","year":"1976","unstructured":"R. J. Lipton, S. C. Eisenstat, and R. A. DeMillo, Space and Time Hierarchies for Classes of Control Structures and Data Structures,J. Assoc. Comput. Mach., Vol. 23, pp. 720\u2013732, 1976.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01940645_CR15","doi-asserted-by":"crossref","first-page":"1114","DOI":"10.1109\/43.7810","volume":"10","author":"F. Lombardi","year":"1988","unstructured":"F. Lombardi, D. Sciuto, and R. Stefanelli, An Algorithm for Functional Reconfiguration of Fixed-Size Arrays,IEEE Trans. Comput. Aided Design, Vol. 10, pp. 1114\u20131118, 1988.","journal-title":"IEEE Trans. Comput. Aided Design"},{"key":"BF01940645_CR16","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01776564","volume":"12","author":"A. L. Rosenberg","year":"1978","unstructured":"A. L. Rosenberg and L. Snyder, Bounds on the Costs of Data Encoding,Math. Systems Theory, Vol. 12, pp. 9\u201339, 1978.","journal-title":"Math. Systems Theory"},{"key":"BF01940645_CR17","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/322154.322160","volume":"26","author":"A. L. Rosenberg","year":"1979","unstructured":"A. L. Rosenberg, Encoding Data Structures in Trees,J. Assoc. Comput. Mach., Vol. 26, pp. 668\u2013689, 1979.","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940645.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01940645\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T16:12:23Z","timestamp":1586362343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01940645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["BF01940645"],"URL":"https:\/\/doi.org\/10.1007\/bf01940645","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}