{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T08:54:59Z","timestamp":1767084899777,"version":"3.38.0"},"reference-count":22,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,3,1]]},"DOI":"10.1587\/transfun.2024vlp0003","type":"journal-article","created":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:01Z","timestamp":1725487981000},"page":"517-524","source":"Crossref","is-referenced-by-count":4,"title":["Gridless Gap Channel Routing with Variable-Width Wires"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Masayuki","family":"SHIMODA","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Atsushi","family":"TAKAHASHI","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Z. Wang, M. Shimoda, and A. Takahashi, \u201cBCA channel routing to minimize wirelength for generalized channel problem,\u201d Proc. IEEE International Symposium on Circuits and Systems (ISCAS), 2024. 10.1109\/iscas58744.2024.10558428","DOI":"10.1109\/ISCAS58744.2024.10558428"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Z. Wang, M. Shimoda, and A. Takahashi, \u201cSDG channel routing to minimize wirelength for generalized channel,\u201d IEICE Trans. Fundamentals, vol.E108-A, no.3, pp.511-519, March 2025. 10.1587\/transfun.2024VLP0001","DOI":"10.1587\/transfun.2024VLP0001"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] K. Taniguchi, S. Tayu, A. Takahashi, M. Molongo, M. Minami, and K. Nishioka, \u201cTwo-layer bottleneck channel track assignment for analog VLSI,\u201d IPSJ Transactions on System and LSI Design Methodology, vol.17, pp.67-76, 2024. 10.2197\/ipsjtsldm.17.67","DOI":"10.2197\/ipsjtsldm.17.67"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] K. Taniguchi, S. Tayu, A. Takahashi, M. Molongo, M. Minami, and K. Nishioka, \u201cA fast three-layer one-side bottleneck channel routing with layout constraints using ILP,\u201d IEICE Trans. Fundamentals, vol.E108-A, no.3, pp.520-527, March 2025. 10.1587\/transfun.2024vlp0002","DOI":"10.1587\/transfun.2024VLP0002"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] A. Hashimoto and J. Stevens, \u201cWire routing by optimizing channel assignment within large apertures,\u201d Proc. 8th Design Automation Workshop (DAC), pp.155-169, 1971. 10.1145\/800158.805069","DOI":"10.1145\/800158.805069"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] A.B. Kahng, J. Lienig, I.L. Markov, and J. Hu, \u201cDetailed routing,\u201d VLSI Physical Design: From Graph Partitioning to Timing Closure, pp.171-194, Springer International Publishing, Cham, 2022. 10.1007\/978-3-030-96415-3_6","DOI":"10.1007\/978-3-030-96415-3_6"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] T. Yoshimura and E. Kuh, \u201cEfficient algorithms for channel routing,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.1, no.1, pp.25-35, 1982. 10.1109\/tcad.1982.1269993","DOI":"10.1109\/TCAD.1982.1269993"},{"key":"8","unstructured":"[8] M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman and Co., New York, 1979."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] E.G. Coffman, Jr., J. Csirik, G. Galambos, S. Martello, and D. Vigo, \u201cBin packing approximation algorithms: Survey and classification,\u201d Handbook of Combinatorial Optimization, pp.455-531, Springer, 2013. 10.1007\/978-1-4419-7997-1_35","DOI":"10.1007\/978-1-4419-7997-1_35"},{"key":"10","unstructured":"[10] T. Yokomaru, T. Izumi, A. Takahashi, and Y. Kajitani, \u201cSolution of integer bin packing problem with fixed capacity by FFD,\u201d IPSJ SIG Technical Reports (95-DA-76), vol.95, no.72, pp.1-8, 1995 (in Japanese)."},{"key":"11","unstructured":"[11] T. Yokomaru, T. Izumi, and Y. Kajitani, \u201cThe FFD bin-packing algorithm and its extension for VLSI circuit partitioning,\u201d IEICE Trans. Fundamentals (Japanese Edition), vol.J80-A, no.9, pp.1452-1459, 1997."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] D. Hightower and R. Boyd, \u201cA generalized channel router,\u201d Proc. 17th Design Automation Conference (DAC), pp.12-21, 1980. 10.1145\/800139.804507","DOI":"10.1145\/800139.804507"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] K. Sato, H. Shimoyama, T. Nagai, M. Ozaki, and T. Yahara, \u201cA \u201cgrid-free\u201d channel router,\u201d Proc. 17th Design Automation Conference (DAC), pp.22-31, 1980. 10.1145\/800139.804508","DOI":"10.1145\/800139.804508"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] H. Chen and E. Kuh, \u201cGlitter: A gridless variable-width channel router,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.5, no.4, pp.459-465, 1986. 10.1109\/tcad.1986.1270217","DOI":"10.1109\/TCAD.1986.1270217"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] C.H. Ng, \u201cA \u201cgridless\u201d variable-width channel router for marco cell design,\u201d Proc. 24th Design Automation Conference (DAC), pp.633-636, 1987. 10.1145\/37888.37988","DOI":"10.1145\/37888.37988"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] P. Groeneveld, \u201cA multiple layer contour-based gridless channel router,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.9, no.12, pp.1278-1288, 1990. 10.1109\/43.62773","DOI":"10.1109\/43.62773"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] D.B. Polkl, \u201cA three-layer gridless channel router with compaction,\u201d Proc. 24th Design Automation Conference (DAC), pp.146-151, 1987. 10.1145\/37888.37910","DOI":"10.1145\/37888.37910"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] H.J. Rothermel and D. Mlynski, \u201cAutomatic variable-width routing for VLSI,\u201d IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.2, no.4, pp.271-284, 1983. 10.1109\/tcad.1983.1270045","DOI":"10.1109\/TCAD.1983.1270045"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] B. Krishna, C. Chen, and N. Sehgal, \u201cRouting wires with non-uniform width and spacing in data paths,\u201d Proc. 11th International Conference on Microelectronics (ICM), pp.85-88, 1999. 10.1109\/icm.2000.884811","DOI":"10.1109\/ICM.2000.884811"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani, \u201cRectangle-packing-based module placement,\u201d Proc. International Conference on Computer Aided Design (ICCAD), pp.472-479, 1995. 10.1109\/iccad.1995.480159","DOI":"10.1109\/ICCAD.1995.480159"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] P.N. Guo, C.K. Cheng, and T. Yoshimura, \u201cAn O-tree representation of non-slicing floorplan and its applications,\u201d Proc. Design Automation Conference (DAC), pp.268-273, 1999. 10.1109\/dac.1999.781324","DOI":"10.1145\/309847.309928"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] G.M. Wu, Y.C. Chang, and Y.W. Chang, \u201cRectilinear block placement using B*-trees,\u201d ACM Trans. Des. Autom. Electron. Syst., vol.8, no.2, pp.188-202, 2003. 10.1145\/762488.762490","DOI":"10.1145\/762488.762490"}],"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\/E108.A\/3\/E108.A_2024VLP0003\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:31:51Z","timestamp":1740799911000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/3\/E108.A_2024VLP0003\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024vlp0003","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024VLP0003"}}