{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:18:59Z","timestamp":1772893139551,"version":"3.50.1"},"reference-count":12,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2020,9,1]]},"DOI":"10.1587\/transfun.2019kep0015","type":"journal-article","created":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T22:07:07Z","timestamp":1598911627000},"page":"1037-1044","source":"Crossref","is-referenced-by-count":7,"title":["A Fast Length Matching Routing Pattern Generation Method for Set-Pair Routing Problem Using Selective Pin-Pair Connections"],"prefix":"10.1587","volume":"E103.A","author":[{"given":"Shimpei","family":"SATO","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Kano","family":"AKAGI","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Atsushi","family":"TAKAHASHI","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] Y.-K. Ho and Y. Chang, \u201cMultiple chip planning for chip-interposer codesign,\u201d The 50th ACM\/EDAC\/IEEE Design Automation Conference (DAC), pp.1-6, 2013. 10.1145\/2463209.2488767"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] W. Liu, M.-S. Chang, and T. Wang, \u201cFloorplanning and signal assignment for silicon interposer-based 3D ICs,\u201d The 51st ACM\/EDAC\/IEEE Design Automation Conference (DAC), pp.1-6, 2014. 10.1145\/2593069.2593142","DOI":"10.1145\/2593069.2593142"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Y. Kohira, S. Suehiro, and A. Takahashi, \u201cA fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound,\u201d IEICE Trans. Fundamentals, vol.E92-A, no.12, pp.2971-2978, Dec. 2009. 10.1587\/transfun.e92.a.2971","DOI":"10.1587\/transfun.E92.A.2971"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Y. Kohira and A. Takahashi, \u201cCAFE router: A fast connectivity aware multiple nets routing algorithm for routing grid with obstacles,\u201d IEICE Trans. Fundamentals, vol.E93-A, no.12, pp.2380-2388, Dec. 2010. 10.1587\/transfun.e93.a.2380","DOI":"10.1587\/transfun.E93.A.2380"},{"key":"5","unstructured":"[5] Y. Takashima, A. Takahashi, and Y. Kajitani, \u201cRoutability of FPGAs with extremal switch-block structures,\u201d IEICE Trans. Fundamentals, vol.E81-A, no.5, pp.850-856, May 1998."},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Y. Nakatani and A. Takahashi, \u201cA length matching routing algorithm for set-pair routing problem,\u201d IEICE Trans. Fundamentals, vol.E98-A, no.12, pp.2565-2571, Dec. 2015. 10.1587\/transfun.e98.a.2565","DOI":"10.1587\/transfun.E98.A.2565"},{"key":"7","unstructured":"[7] K. Akagi, S. Sato, and A. Takahashi, \u201cTarget pin-pair selection algorithm using minimum maximum-edge-weight matching for set-pair routing,\u201d The 21st Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI 2018), pp.337-342, March 2018."},{"key":"8","unstructured":"[8] K. Akagi, S. Sato, and A. Takahashi, \u201cAn idea for maximizing target pin-pair connections in set-pair routing,\u201d The 32nd International Technical Conference on Circuits\/Systems, Computers and Communications (ITC-CSCC 2017), pp.62-65, July 2017."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] A. Itai, Y. Perl, and Y. Shiloach, \u201cThe complexity of finding maximum disjoint paths with length constraints,\u201d Networks, vol.12, no.3, pp.277-286, 1982. 10.1002\/net.3230120306","DOI":"10.1002\/net.3230120306"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] M.M. Ozdal and M.D.F. Wong, \u201cAlgorithmic study of single-layer bus routing for high-speed boards,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.25, no.3, pp.490-503, 2006. 10.1109\/tcad.2005.853685","DOI":"10.1109\/TCAD.2005.853685"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[12] J. Edmonds and R.M. Karp, \u201cTheoretical improvements in algorithmic efficiency for network flow problems,\u201d J. ACM (JACM), vol.19, no.2, pp.248-264, April 1972. 10.1145\/321694.321699","DOI":"10.1145\/321694.321699"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[13] E.W. Dijkstra, \u201cA note on two problems in connexion with graphs,\u201d Numer. Math., vol.1, no.1, pp.269-271, 1959. 10.1007\/bf01386390","DOI":"10.1007\/BF01386390"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/9\/E103.A_2019KEP0015\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,5]],"date-time":"2020-09-05T03:34:26Z","timestamp":1599276866000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/9\/E103.A_2019KEP0015\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,1]]},"references-count":12,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2019kep0015","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,1]]}}}