{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:54:42Z","timestamp":1725897282007},"publisher-location":"Wiesbaden","reference-count":14,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783815420331"},{"type":"electronic","value":"9783322952332"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-3-322-95233-2_19","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T01:17:04Z","timestamp":1366161424000},"page":"333-348","source":"Crossref","is-referenced-by-count":0,"title":["A Hierarchy Preserving Hierarchical Bottom-Up 2-layer Wiring Algorithm with Respect to Via Minimization"],"prefix":"10.1007","author":[{"given":"Paul","family":"Molitor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"174","volume-title":"Proceedings of EDAC90","author":"B Becker","year":"1990","unstructured":"B. Becker, Th. Burch, G. Hotz, D. Kiel, R. Kolla, P. Molitor, H. G. Osthof, G. Pitsch, and U. Sparmann. A graphical system for hierarchical specifications and checkups of VLSI circuits. In Proceedings of EDAC90, pages 174\u2013179, 1990."},{"key":"19_CR2","first-page":"649","volume-title":"Proceedings of DAC87","author":"B Becker","year":"1987","unstructured":"B. Becker, G. Hotz, R. Kolla, P. Molitor, and H.G. Osthof. Hierarchical design based on a calculus of nets. In Proceedings of DAC87, pages 649\u2013653, 1987."},{"key":"19_CR3","volume-title":"Implementation of algorithms for maximum matching on non-bipartite graphs","author":"H Gabow","year":"1973","unstructured":"H. Gabow. Implementation of algorithms for maximum matching on non-bipartite graphs PhD thesis, Stanford University, 1973."},{"key":"19_CR4","first-page":"185","volume":"1","author":"G Hotz","year":"1965","unstructured":"G. Hotz. Eine Algebraisierung des Syntheseproblems f\u00fcr Schaltkreise. EIK, 1:185\u2013205,209\u2013231, 1965.","journal-title":"EIK"},{"key":"19_CR5","series-title":"LNCS 291","first-page":"250","volume-title":"Proceedings of GRAGRA86","author":"G Hotz","year":"1986","unstructured":"G. Hotz, R. Kolla, and P. Molitor. On network algebras and recursive functions. In Proceedings of GRAGRA86, LNCS 291, pages 250\u2013261, 1986."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0167-9260(89)90002-3","volume":"7","author":"R Kolla","year":"1989","unstructured":"R. Kolla and P. Molitor. A note on hierarchical layer assignment. INTEGRATION, the VLSI Journal, 7:213\u2013230, 1989.","journal-title":"INTEGRATION, the VLSI Journal"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-322-93087-3","volume-title":"Einf\u00fchrung in den VLSI-Entwurf","author":"R Kolla","year":"1989","unstructured":"R. Kolla, P. Molitor, and H.G. Osthof. Einf\u00fchrung in den VLSI-Entwurf . Leitf\u00e4den und Monographien der Informatik. B.G. Teubner Verlag, Stuttgart, 1989. 352 Seiten."},{"key":"19_CR8","first-page":"155","volume-title":"Proceedings IFIP Congress 83","author":"WK Luk","year":"1983","unstructured":"W.K. Luk and J. Vuillemin. Recursive implementation of optimal time VLSI integer multipliers. In Proceedings IFIP Congress 83, pages 155\u2013168, 1983."},{"key":"19_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69897-2","volume-title":"Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness","author":"K Mehlhorn","year":"1984","unstructured":"K. Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness EATCS Monographs on Theoretical Computer Science, 1984."},{"key":"19_CR10","volume-title":"\u00dcber die Bikategorie der logisch topologischen Netze und ihre Semantik","author":"P Molitor","year":"1986","unstructured":"P. Molitor. \u00dcber die Bikategorie der logisch topologischen Netze und ihre Semantik PhD thesis, Universit\u00e4t des Saarlandes, 1986."},{"key":"19_CR11","first-page":"420","volume-title":"Proceedings of STACS87","author":"P Molitor","year":"1987","unstructured":"P. Molitor. On the contact minimization problem. In Proceedings of STACS87, pages 420\u2013431, 1987."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.3233\/FI-1988-11202","volume":"XI","author":"P Molitor","year":"1988","unstructured":"P. Molitor. Free net algebras in VLSI-theory. FUNDAMENTA INFORMATI-CAE, XI: 117\u2013142, 1988.","journal-title":"FUNDAMENTA INFORMATI-CAE"},{"issue":"1","key":"19_CR13","first-page":"3","volume":"27","author":"P Molitor","year":"1991","unstructured":"P. Molitor. A survey on wiring. EIK, 27(1):3\u201319, 1991.","journal-title":"EIK"},{"key":"19_CR14","first-page":"14","volume":"13","author":"CS Wallace","year":"1964","unstructured":"C.S. Wallace. A suggestion for a fast multiplier. IEEE-EC, 13:14\u201317, 1964.","journal-title":"IEEE-EC"}],"container-title":["TEUBNER-TEXTE zur Informatik","Informatik"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-95233-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,13]],"date-time":"2022-02-13T20:06:47Z","timestamp":1644782807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-95233-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783815420331","9783322952332"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-95233-2_19","relation":{},"ISSN":["1615-4584"],"issn-type":[{"type":"print","value":"1615-4584"}],"subject":[],"published":{"date-parts":[[1992]]}}}