{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:34:50Z","timestamp":1648740890244},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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,5]]},"DOI":"10.1007\/bf01955047","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T22:43:50Z","timestamp":1122849830000},"page":"495-519","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing area for three-layer knock-knee channel routing"],"prefix":"10.1007","volume":"15","author":[{"given":"R.","family":"Kuchem","sequence":"first","affiliation":[]},{"given":"D.","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"F.","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01955047_CR1","first-page":"205","volume-title":"Advances in Computing Research, Vol. 2","author":"B. S. Baker","year":"1984","unstructured":"B. S. Baker, S. N. Bhatt, and T. Leighton. An approximation algorithm for Manhattan routing.Advances in Computing Research, Vol. 2 (ed. F. P. Preparata) JAI Press, Greenwich, CT, 1984, pp. 205\u2013229."},{"key":"BF01955047_CR2","first-page":"245","volume-title":"Advances in Computing Research, Vol. 2","author":"M. L. Brady","year":"1984","unstructured":"M. L. Brady and D. J. Brown. VLSI routing: Four layers suffice.Advances in Computing Research, Vol. 2 (ed. F. P. Preparata) JAI Press, Greenwich, CT, 1984, pp. 245\u2013257."},{"key":"BF01955047_CR3","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/12.46293","volume":"39","author":"M. L. Brady","year":"1990","unstructured":"M. L. Brady and M. Sarrafzadeh. Stretching a knock-knee layout for multilayer wiring.IEEE Trans. Comput.,39 (1990), 148\u2013152.","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"BF01955047_CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02579432","volume":"2","author":"A. Frank","year":"1982","unstructured":"A. Frank. Disjoint paths in a rectilinear grid.Combinatorica,2(4) (1982), pp. 361\u2013371.","journal-title":"Combinatorica"},{"key":"BF01955047_CR5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.1993.1041","volume":"15","author":"M. Formann","year":"1993","unstructured":"M. Formann, D. Wagner and F. Wagner. Routing through a dense channel with minimum total wire length.J. Algorithms,15 (1993), pp. 267\u2013283.","journal-title":"J. Algorithms"},{"key":"BF01955047_CR6","first-page":"237","volume-title":"LNCS, Vol. 319","author":"T. Gonzalez","year":"1988","unstructured":"T. Gonzalez and S. Zheng. Simple three-layer channel routing algorithms.Proc. AWOC 88 (ed. J. H. Reif), LNCS, Vol. 319, Springer-Verlag, Berlin, 1988, pp. 237\u2013246."},{"key":"BF01955047_CR7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0167-9260(89)90044-8","volume":"8","author":"T. Gonzalez","year":"1989","unstructured":"T. Gonzalez and S. Zheng. On ensuring three-layer wirability by stretching planar layouts.INTEGRATION: The VLSI Journal,8 (1989), 111\u2013141.","journal-title":"INTEGRATION: The VLSI Journal"},{"key":"BF01955047_CR8","first-page":"231","volume-title":"Advances in Computing Research, Vol. 2","author":"W. Lipski Jr","year":"1984","unstructured":"W. Lipski, Jr. On the structure of three-layer wirable layouts.Advances in Computing Research, Vol. 2 (ed. F. P. Preparata), JAI Press, Greenwich, CT, 1984, pp. 231\u2013243."},{"key":"BF01955047_CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01704913","volume":"19","author":"W. Lipski Jr.","year":"1987","unstructured":"W. Lipski, Jr., and F. P. Preparata. A unified approach to layout wirability.Math. Systems Theory,19 (1987), 189\u2013203.","journal-title":"Math. Systems Theory"},{"issue":"1","key":"BF01955047_CR10","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/4904.4994","volume":"33","author":"K. Mehlhorn","year":"1986","unstructured":"K. Mehlhorn, and F. P. Preparata. Routing through a rectangle.J. Assoc. Comput. Mach.,33(1) (1986), 60\u201385.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01955047_CR11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01840443","volume":"1","author":"K. Mehlhorn","year":"1986","unstructured":"K. Mehlhorn, F. P. Preparata, and M. Sarrafzadeh. Channel routing in knock-knee mode: simplified algorithms and proofs.Algorithmica,1 (1986), 213\u2013221.","journal-title":"Algorithmica"},{"issue":"5","key":"BF01955047_CR12","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/TC.1984.1676459","volume":"33","author":"F. P. Preparata","year":"1984","unstructured":"F. P. Preparata and W. Lipski, Jr. Optimal three-layer channel routing.IEEE Trans. Comput.,33(5) (1984), 427\u2013437.","journal-title":"IEEE Trans. Comput."},{"key":"BF01955047_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos.Computational Geometry, Springer-Verlag, New York, 1985."},{"key":"BF01955047_CR14","doi-asserted-by":"crossref","unstructured":"R. L. Rivest and C. M. Fiduccia. A greedy channel router.Proc. 19th Design Automation Conference, 1982, pp. 418\u2013424.","DOI":"10.1109\/DAC.1982.1585533"},{"issue":"5","key":"BF01955047_CR15","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/12.280805","volume":"43","author":"M. Sarrafzadeh","year":"1994","unstructured":"M. Sarrafzadeh, D. Wagner, F. Wagner and K. Weihe. Wiring knock-knee layouts: a global approach.IEEE Trans. Comput.,43(5) (1994), pp. 581\u2013589.","journal-title":"IEEE Trans. Comput."},{"key":"BF01955047_CR16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TCAD.1985.1270096","volume":"4","author":"T. Szymanski","year":"1985","unstructured":"T. Szymanski. Dogleg channel routing is NP-complete.IEEE Trans. Comput.-Aided Design Integrated Circuits and Systems,4 (1985), 31\u201341.","journal-title":"IEEE Trans. Comput.-Aided Design Integrated Circuits and Systems"},{"key":"BF01955047_CR17","doi-asserted-by":"crossref","first-page":"1392","DOI":"10.1109\/43.97618","volume":"10","author":"I. G. Tollis","year":"1991","unstructured":"I. G. Tollis. A new algorithm for wiring layouts.IEEE Trans. Comput.-Aided Design of Integrated Circuits and Systems,10 (1991), 1392\u20131400.","journal-title":"IEEE Trans. Comput.-Aided Design of Integrated Circuits and Systems"},{"key":"BF01955047_CR18","first-page":"83","volume-title":"LNCS, Vol. 557","author":"D. Wagner","year":"1991","unstructured":"D. Wagner. A new approach to knock-knee channel routing.Proc. Second International Symposium on Algorithms, ISA'91, LNCS, Vol. 557, Springer-Verlag, Berlin, 1991, pp. 83\u201393."},{"issue":"3","key":"BF01955047_CR19","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1142\/S0218195993000178","volume":"3","author":"D. Wagner","year":"1993","unstructured":"D. Wagner. Optimal routing through dense channels.Internat. J. Comput. Geom. Appl.,3(3) (1993), pp. 269\u2013289.","journal-title":"Internat. J. Comput. Geom. Appl."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01955047.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01955047\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01955047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T14:03:12Z","timestamp":1586354592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01955047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["BF01955047"],"URL":"https:\/\/doi.org\/10.1007\/bf01955047","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}