{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:27:49Z","timestamp":1770744469983,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271098"],"award-info":[{"award-number":["12271098"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,23]]},"DOI":"10.1145\/3649329.3655915","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Obstacle-Aware Length-Matching Routing for Any-Direction Traces in Printed Circuit Board"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2448-4786","authenticated-orcid":false,"given":"Weijie","family":"Fang","sequence":"first","affiliation":[{"name":"Fuzhou University, Fuzhou, Fujian, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2891-4253","authenticated-orcid":false,"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[{"name":"Fuzhou University, Fuzhou, Fujian, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1624-5286","authenticated-orcid":false,"given":"Jiawei","family":"Lin","sequence":"additional","affiliation":[{"name":"Fuzhou University, Fuzhou, Fujian, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4112-9818","authenticated-orcid":false,"given":"Silu","family":"Xiong","sequence":"additional","affiliation":[{"name":"Hangzhou Huawei Enterprises Telecommunication Technologies Co., Ltd, Hangzhou, Zhejiang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7416-3254","authenticated-orcid":false,"given":"Huan","family":"He","sequence":"additional","affiliation":[{"name":"Hangzhou Huawei Enterprises Telecommunication Technologies Co., Ltd, Hangzhou, Zhejiang, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0292-1113","authenticated-orcid":false,"given":"Jiacen","family":"Xu","sequence":"additional","affiliation":[{"name":"Shanghai LEDA Technology Co., Ltd, Shanghai, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1391-2696","authenticated-orcid":false,"given":"Jianli","family":"Chen","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Cadence. [n. d.]. Allegro PCB Designer. https:\/\/www.cadence.com\/en_US\/home\/tools\/pcb-design-and-analysis\/pcb-layout\/allegro-pcb-designer.html"},{"key":"e_1_3_2_1_2_1","volume-title":"2019 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD). 1--8.","author":"Yu-Hsuan","unstructured":"Yu-Hsuan Chang et al. 2019. Obstacle-Aware Group-Based Length-Matching Routing for Pre-Assignment Area-I\/O Flip-Chip Designs. In 2019 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD). 1--8."},{"key":"e_1_3_2_1_3_1","volume-title":"MARCH: MAze Routing Under a Concurrent and Hierarchical Scheme for Buses (DAC '19). 6 pages.","author":"Jingsong Chen","year":"2019","unstructured":"Jingsong Chen et al. 2019. MARCH: MAze Routing Under a Concurrent and Hierarchical Scheme for Buses (DAC '19). 6 pages."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2020.2985312"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 56th Annual Design Automation Conference 2019 (DAC '19)","author":"Chen-Hao","unstructured":"Chen-Hao Hsu et al. 2019. A DAG-Based Algorithm for Obstacle-Aware Topology-Matching On-Track Bus Routing. In Proceedings of the 56th Annual Design Automation Conference 2019 (DAC '19). 6 pages."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASC.2018.2793203"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Yukihide Kohira Suguru Suehiro and Atsushi Takahashi. 2009. A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound. IEICE transactions on fundamentals of electronics communications and computer sciences 92 12 (2009) 2971--2978.","DOI":"10.1587\/transfun.E92.A.2971"},{"key":"e_1_3_2_1_8_1","volume-title":"CAFE router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles. IEICE transactions on fundamentals of electronics, communications and computer sciences 93, 12","author":"Kohira Yukihide","year":"2010","unstructured":"Yukihide Kohira and Atsushi Takahashi. 2010. CAFE router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles. IEICE transactions on fundamentals of electronics, communications and computer sciences 93, 12 (2010), 2380--2388."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/988952.989005"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/EDAPS.2013.6724418"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.882584"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1980.1163491"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E98.A.2565"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.853685"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1978.1163055"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2019KEP0015"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2402657"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCPMT.2022.3175069"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 2011 International Symposium on Physical Design (ISPD '11)","author":"Jin-Tai","unstructured":"Jin-Tai Yan et al. 2011. Obstacle-Aware Length-Matching Bus Routing. In Proceedings of the 2011 International Symposium on Physical Design (ISPD '11). 61--68."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2030352"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2015.7059038"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TENCONSpring.2013.6584425"}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA","acronym":"DAC '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655915","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3655915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:48Z","timestamp":1750295868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":22,"alternative-id":["10.1145\/3649329.3655915","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3655915","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}