{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:44:49Z","timestamp":1776955489926,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,27]],"date-time":"2011-03-27T00:00:00Z","timestamp":1301184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,27]]},"DOI":"10.1145\/1960397.1960412","type":"proceedings-article","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:25:29Z","timestamp":1300796729000},"page":"61-68","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Obstacle-aware length-matching bus routing"],"prefix":"10.1145","author":[{"given":"Jin-Tai","family":"Yan","sequence":"first","affiliation":[{"name":"Chung-Hua University, Hsinchu, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Wei","family":"Chen","sequence":"additional","affiliation":[{"name":"Chung-Hua University, Hsinchu, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.853685"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.882584"},{"key":"e_1_3_2_1_3_1","first-page":"499","article-title":"BSG-Route: A length-matching router for general topology","author":"Yan T.","year":"2008","unstructured":"T. Yan and M. D. F. Wong , \" BSG-Route: A length-matching router for general topology ,\" \"International Conference on Computer-Aided Design , pp. 499 -- 505 , 2008 . T. Yan and M. D. F. Wong, \"BSG-Route: A length-matching router for general topology,\"\"International Conference on Computer-Aided Design, pp.499--505, 2008.","journal-title":"\"International Conference on Computer-Aided Design"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211056"},{"key":"e_1_3_2_1_5_1","first-page":"600","article-title":"A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound","author":"Kohira Y.","year":"2009","unstructured":"Y. Kohira , S. Suehiro and A. Takahashi , \" A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound ,\" \"Asia and South Pacific Design Automation Conference , pp. 600 -- 605 , 2009 . Y. Kohira, S. Suehiro and A. Takahashi, \"A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound,\"\"Asia and South Pacific Design Automation Conference, pp.600--605, 2009.","journal-title":"\"Asia and South Pacific Design Automation Conference"},{"key":"e_1_3_2_1_6_1","first-page":"287","article-title":"Obstacle-aware longest path using rectangular pattern detouring in routing grids","author":"Yan J. T.","year":"2010","unstructured":"J. T. Yan , M. C. Jhong and Z. W. Chen , \" Obstacle-aware longest path using rectangular pattern detouring in routing grids ,\" \"Asia and South Pacific Design Automation Conference , pp. 287 -- 292 , 2010 . J. T. Yan, M. C. Jhong and Z. W. Chen, \"Obstacle-aware longest path using rectangular pattern detouring in routing grids,\"\"Asia and South Pacific Design Automation Conference, pp.287--292, 2010.","journal-title":"\"Asia and South Pacific Design Automation Conference"},{"key":"e_1_3_2_1_7_1","first-page":"281","article-title":"CAF\u00c9 router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles","author":"Kohira Y.","year":"2010","unstructured":"Y. Kohira and A. Takahashi , \" CAF\u00c9 router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles ,\" Asia and South Pacific Design Automation Conference , pp. 281 -- 286 , 2010 . Y. Kohira and A. Takahashi, \"CAF\u00c9 router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles,\" Asia and South Pacific Design Automation Conference, pp.281--286, 2010.","journal-title":"Asia and South Pacific Design Automation Conference"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/368434.368584"},{"key":"e_1_3_2_1_9_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2000","unstructured":"T. H. Cormen , C. E. Leiserson and R. L. Rivest , Introduction to Algorithms , MIT Press , 2000 . T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, MIT Press, 2000."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837325"}],"event":{"name":"ISPD'11: International Symposium on Physical Design","location":"Santa Barbara CA USA","acronym":"ISPD'11","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2011 international symposium on Physical design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1960397.1960412","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1960397.1960412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:53Z","timestamp":1750240133000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1960397.1960412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,27]]},"references-count":10,"alternative-id":["10.1145\/1960397.1960412","10.1145\/1960397"],"URL":"https:\/\/doi.org\/10.1145\/1960397.1960412","relation":{},"subject":[],"published":{"date-parts":[[2011,3,27]]},"assertion":[{"value":"2011-03-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}