{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T02:43:20Z","timestamp":1781837000239,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T00:00:00Z","timestamp":1654473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The Fundamental Research Funds for the Central Universities"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,6]]},"DOI":"10.1145\/3526241.3530361","type":"proceedings-article","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T14:37:09Z","timestamp":1654180629000},"page":"165-168","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Effective and Efficient Detailed Routing with Adaptive Rip-up Scheme and Pin Access Refinement"],"prefix":"10.1145","author":[{"given":"Zhongdong","family":"Qi","sequence":"first","affiliation":[{"name":"Xidian University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingchong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Giga Design Automation, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gengjie","family":"Chen","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong SAR, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hailong","family":"You","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9591-6"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2385755"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2014.7001382"},{"key":"e_1_3_2_2_4_1","first-page":"140","volume-title":"ISPD","author":"Mantik S.","year":"2018","unstructured":"S. Mantik , G. Posser , W.-K. Chow , Y. Ding and W.-H. Liu , \"ISPD 2018 initial detailed routing contest and benchmarks,\" in Proc . ISPD , 2018, pp. 140 -- 143 . S. Mantik, G. Posser, W.-K. Chow, Y. Ding and W.-H. Liu, \"ISPD 2018 initial detailed routing contest and benchmarks,\" in Proc. ISPD, 2018, pp. 140--143."},{"key":"e_1_3_2_2_5_1","first-page":"147","volume-title":"ISPD","author":"Liu W.-H.","year":"2019","unstructured":"W.-H. Liu , S. Mantik , W.-K. Chow , Y. Ding , A. Farshidi and G. Posser , \" ISPD 2019 initial detailed routing contest and benchmark with advanced routing rules,\" in Proc . ISPD , 2019 , pp. 147 -- 151 . W.-H. Liu, S. Mantik, W.-K. Chow, Y. Ding, A. Farshidi and G. Posser, \"ISPD 2019 initial detailed routing contest and benchmark with advanced routing rules,\" in Proc. ISPD, 2019, pp. 147--151."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3240777"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2927542"},{"key":"e_1_3_2_2_8_1","first-page":"1","volume-title":"ICCAD","author":"Li H.","year":"2019","unstructured":"H. Li , G. Chen , B. Jiang , J. Chen and E. F. Y. Young , \" Dr. CU 2.0 : A scalable detailed routing framework with correct-by-construction design rule satisfaction,\" in Proc . ICCAD , 2019 , pp. 1 -- 7 . H. Li, G. Chen, B. Jiang, J. Chen and E. F. Y. Young, \"Dr. CU 2.0: A scalable detailed routing framework with correct-by-construction design rule satisfaction,\" in Proc. ICCAD, 2019, pp. 1--7."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3003234"},{"issue":"7","key":"e_1_3_2_2_10_1","first-page":"1239","article-title":"DRAPS: A design rule aware path search algorithm for detailed routing","volume":"67","author":"Gon\u00e7alves S. M. M.","year":"2020","unstructured":"S. M. M. Gon\u00e7alves , L. S. Rosa and F. S. Marques , \" DRAPS: A design rule aware path search algorithm for detailed routing ,\" in IEEE Trans. on CAS II 67 ( 7 ) ( 2020 ), pp. 1239 -- 1243 . S. M. M. Gon\u00e7alves, L. S. Rosa and F. S. Marques, \"DRAPS: A design rule aware path search algorithm for detailed routing,\" in IEEE Trans. on CAS II 67(7) (2020), pp. 1239--1243.","journal-title":"IEEE Trans. on CAS II"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2265878"}],"event":{"name":"GLSVLSI '22: Great Lakes Symposium on VLSI 2022","location":"Irvine CA USA","acronym":"GLSVLSI '22","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the Great Lakes Symposium on VLSI 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3526241.3530361","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3526241.3530361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:16Z","timestamp":1750186936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3526241.3530361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,6]]},"references-count":11,"alternative-id":["10.1145\/3526241.3530361","10.1145\/3526241"],"URL":"https:\/\/doi.org\/10.1145\/3526241.3530361","relation":{},"subject":[],"published":{"date-parts":[[2022,6,6]]},"assertion":[{"value":"2022-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}