{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:16Z","timestamp":1725467896367},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040394","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"268-277","source":"Crossref","is-referenced-by-count":3,"title":["Input sensitive VLSI layouts for graphs of arbitrary degree"],"prefix":"10.1007","author":[{"given":"Deepak D.","family":"Sherlekar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"J\u00e1J\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, M. M. Klawe, D. Lichtenstein, N. Linial, and A. Wigderson. Multi-layer grid embeddings. Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, 186\u2013196, 1985.","DOI":"10.1109\/SFCS.1985.37"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"B. S. Baker. Approximation algorithms for np-complete problems on planar graphs. Proc. 24th Annual IEEE Symposium on Foundations of Computer Science, 265\u2013273, 1983.","DOI":"10.1109\/SFCS.1983.7"},{"key":"27_CR3","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences, 28:300\u2013343, 1984.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"27_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0603022","volume":"3","author":"H. N. Djidjev","year":"1982","unstructured":"H. N. Djidjev. On the problem of partitioning planar graphs. SIAM Journal on Algebraic and Discrete Methods, 3(2):229\u2013240, June 1982.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"27_CR5","first-page":"147","volume":"2","author":"D. Dolev","year":"1984","unstructured":"D. Dolev, F. T. Leighton, and H. W. Trickey. Planar embedding of planar graphs. In Advances in Computing Research, vol. 2, pages 147\u2013161, JAI Press, 1984.","journal-title":"Advances in Computing Research"},{"issue":"3","key":"27_CR6","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0605032","volume":"5","author":"J. R. Gilbert","year":"1984","unstructured":"J. R. Gilbert, D. J. Rose, and A. Edenbrandt. A separator theorem for chordal graphs. SIAM Journal on Algebraic and Discrete Methods, 5(3):306\u2013313, 1984.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969.","DOI":"10.21236\/AD0705364"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"D. B. Johnson and S. M. Venkatesan. Parallel algorithms for minimum cuts and maximum flows in planar networks. Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science, 244\u2013254, 1982.","DOI":"10.1109\/SFCS.1982.83"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"F. T. Leighton. New lower bound techniques for vlsi. Proc. 22nd Annual Symposium on Foundations of Computer Science, 1\u201312, 1981.","DOI":"10.1109\/SFCS.1981.22"},{"key":"27_CR10","unstructured":"C. E. Leiserson. Area Efficient VLSI Computation. PhD thesis, Carnegie Mellon University, 1981."},{"issue":"10","key":"27_CR11","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"C-34","author":"C. E. Leiserson","year":"1985","unstructured":"C. E. Leiserson. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, C-34(10):892\u2013901, Oct 1985.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36(2):177\u2013189, April 1979.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Gary Miller. Finding small simple cycle separators for 2-connected graphs. Proc. 16th Annual ACM Symposium on Theory of Computing, 376\u2013382, 1984.","DOI":"10.1145\/800057.808703"},{"key":"27_CR14","volume-title":"Graph Dissection Techniques for VLSI and Algorithms","author":"D. D. Sherlekar","year":"1987","unstructured":"D. D. Sherlekar. Graph Dissection Techniques for VLSI and Algorithms. PhD thesis, University of Maryland, College Park, Maryland, 1987."},{"key":"27_CR15","unstructured":"D. D. Sherlekar and J. Ja'Ja'. Layouts of graphs of arbitrary degree. Proceedings of the 25th Annual Allerton Conference, September 1987."},{"key":"27_CR16","volume-title":"Linear and Planar Arrangement of Graphs","author":"Y. Shiloach","year":"1976","unstructured":"Y. Shiloach. Linear and Planar Arrangement of Graphs. PhD thesis, Weizmann Institute, Rehovot, Israel, 1976."},{"key":"27_CR17","unstructured":"C. D. Thompson. A Complexity Theory for VLSI. PhD thesis, Carnegie Mellon University, 1980."},{"key":"27_CR18","volume-title":"Computational Aspects of VLSI","author":"J. D. Ullman","year":"1984","unstructured":"J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, MD, 1984."},{"issue":"2","key":"27_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L. G. Valiant","year":"1981","unstructured":"L. G. Valiant. Universality considerations in vlsi circuits. IEEE Transactions on Computers, C-30(2):135\u2013140, Feb 1981.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040394.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:40:20Z","timestamp":1607550020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0040394","relation":{},"subject":[]}}