{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T12:27:30Z","timestamp":1673094450312},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"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":[[1988,11]]},"DOI":"10.1007\/bf01762128","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:22:38Z","timestamp":1118917358000},"page":"487-510","source":"Crossref","is-referenced-by-count":6,"title":["Optimal VLSI graph embeddings in variable aspect ratio rectangles"],"prefix":"10.1007","volume":"3","author":[{"given":"Paul","family":"Czerwinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"BF01762128_CR1","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"S. N. Bhatt","year":"1984","unstructured":"S. N. Bhatt and F. T. Leighton, A framework for solving VLSI graph layout problems,J. Comput. System Sci.,28(2) (1984), 300\u2013343.","journal-title":"J. Comput. System Sci."},{"key":"BF01762128_CR2","doi-asserted-by":"crossref","unstructured":"G. Bilardi, M. Pracchi, and F. Preparata, A critique and appraisal of VLSI models of computation,Proceedings of the CMU Conference on VLSI Systems and Computation (1981), pp. 81\u201388.","DOI":"10.1007\/978-3-642-68402-9_10"},{"key":"BF01762128_CR3","doi-asserted-by":"crossref","unstructured":"R. P. Brent and H. T. Kung, On the area of binary tree layouts,Inform. Process. Lett. (1980), 46\u201348.","DOI":"10.1016\/0020-0190(80)90034-4"},{"key":"BF01762128_CR4","volume-title":"Master's thesis","author":"P. Czerwinski","year":"1985","unstructured":"P. Czerwinski, Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles, Master's thesis, Department of Electrical and Computer Engineering, University of Illinois, Urbana (1985)."},{"key":"BF01762128_CR5","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, New lower bound techniques for VLSI,Proceedings of the 22nd Annual Symposium on Foundations of Computer Science (1981), pp. 1\u201312.","DOI":"10.1109\/SFCS.1981.22"},{"key":"BF01762128_CR6","unstructured":"C. E. Leiserson, Area-efficient graph layouts (for VLSI),Proceedings of the 21st Annual Symposium on Foundations of Computer Science (1980), pp. 270\u2013281."},{"key":"BF01762128_CR7","volume-title":"Introduction to VLSI Systems","author":"C. A. Mead","year":"1980","unstructured":"C. A. Mead and L. Conway,Introduction to VLSI Systems, Addison-Wesley, Reading, MA, 1980."},{"key":"BF01762128_CR8","doi-asserted-by":"crossref","unstructured":"M. S. Paterson, W. L. Ruzzo, and L. Snyder, Bounds on minimax edge length for complete binary trees,Proceedings of the 13th Annual ACM Symposium on Theory of Computing (1981), pp. 293\u2013299.","DOI":"10.1145\/800076.802481"},{"key":"BF01762128_CR9","unstructured":"M. S. Pinsker, On the complexity of a concentrator,Proceedings of the 7th International Teletraffic Congress, 1973, pp. 318\/1\u2013318\/4."},{"key":"BF01762128_CR10","unstructured":"V. Ramachandran, Area-optimal graph embeddings for VLSI in rectangles of varying aspect ratio, Technical Report #301, EECS Department, Princeton University (1982)."},{"key":"BF01762128_CR11","doi-asserted-by":"crossref","unstructured":"V. Ramachandran, On driving many long wires in a VLSI layout,Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (1982), pp. 369\u2013378; alsoJ. Assoc. Comput. Mach.,33(4) (1986), 687\u2013701.","DOI":"10.1145\/6490.6784"},{"key":"BF01762128_CR12","unstructured":"C. D. Thompson, A Complexity Theory for VLSI, Ph.D. thesis, Carnegie-Mellon University (1980)."},{"issue":"2","key":"BF01762128_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L. G. Valiant","year":"1981","unstructured":"L. G. Valiant, Universality considerations in VLSI circuits,IEEE Trans. Comput.,30(2) (1981), 135\u2013140.","journal-title":"IEEE Trans. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762128.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01762128\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T16:41:43Z","timestamp":1557333703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01762128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":13,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF01762128"],"URL":"https:\/\/doi.org\/10.1007\/bf01762128","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}