{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:23:34Z","timestamp":1780496614074,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540538325","type":"print"},{"value":"9783540463108","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53832-1_38","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:13:15Z","timestamp":1330189995000},"page":"130-139","source":"Crossref","is-referenced-by-count":13,"title":["The VLSI layout problem in various embedding models"],"prefix":"10.1007","author":[{"given":"Michael","family":"Formann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"12_CR1","first-page":"147","volume":"2","author":"D. Dolev","year":"1984","unstructured":"D. Dolev, T. Leighton and H. Trickey, Planar embedding of planar graphs, in: F. P. Preparata (ed.), Advances in Computing Research, Vol. 2 (1984), JAI Press, pp. 147\u2013161","journal-title":"Advances in Computing Research"},{"key":"12_CR2","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability, A guide to the theory of NP-completeness, Freeman, 1979"},{"issue":"9","key":"12_CR3","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1109\/TC.1987.5009532","volume":"C-36","author":"D. Gordon","year":"1987","unstructured":"D. Gordon, Efficient Embeddings of Binary Trees in VLSI Arrays, IEEE Transactions on Computers, vol. C-36 (1987), no. 9, pp. 1009\u20131018","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR4","first-page":"129","volume":"2","author":"M. R. Kramer","year":"1984","unstructured":"M. R. Kramer and J. van Leeuwen, The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits, in: F. P. Preparata (ed.), Advances in Computing Research, Vol. 2 (1984), JAI Press, pp. 129\u2013146","journal-title":"Advances in Computing Research"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley-Teubner, to appear","DOI":"10.1007\/978-3-322-92106-2"},{"key":"12_CR6","volume-title":"A Complexity Theory for VLSI","author":"C. D. Thompson","year":"1980","unstructured":"C. D. Thompson, A Complexity Theory for VLSI, Ph. D. thesis, Carnegie-Mellon Univ., Pittsburg, Pa., USA, 1980"},{"key":"12_CR7","unstructured":"J. D. Ullman, Computational aspects of VLSI, Computer Science Press, 1984"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53832-1_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:16:13Z","timestamp":1619558173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53832-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540538325","9783540463108"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-53832-1_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}