{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T10:42:13Z","timestamp":1750502533118,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:00:00Z","timestamp":1720224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:00:00Z","timestamp":1720224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62104037"],"award-info":[{"award-number":["62104037"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["92373207"],"award-info":[{"award-number":["92373207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the MOST of Taiwan","award":["MOST 110-2221-E-002-177-MY3"],"award-info":[{"award-number":["MOST 110-2221-E-002-177-MY3"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s11227-024-06338-9","type":"journal-article","created":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T20:16:33Z","timestamp":1720296993000},"page":"24324-24357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Subgraph matching-based reference placement for printed circuit board designs"],"prefix":"10.1007","volume":"80","author":[{"given":"Ziran","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Yilin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Miaodi","family":"Su","sequence":"additional","affiliation":[]},{"given":"Shu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Haiyuan","family":"Su","sequence":"additional","affiliation":[]},{"given":"Yifeng","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Huan","family":"He","sequence":"additional","affiliation":[]},{"given":"Jianli","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yao-Wen","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,6]]},"reference":[{"key":"6338_CR1","doi-asserted-by":"crossref","unstructured":"Su M, Xiao Y, Zhang S, Su H, Xu J, He H, Zhu Z, Chen J, Chang Y-W (2022) Late breaking results: Subgraph matching based reference placement for pcb designs. In: Proceedings of the 59th ACM\/IEEE Design Automation Conference, pp 1400\u20131401","DOI":"10.1145\/3489517.3530670"},{"key":"6338_CR2","volume-title":"Printed circuit boards design, fabrication, and assembly","author":"RS Khandpur","year":"2006","unstructured":"Khandpur RS (2006) Printed circuit boards design, fabrication, and assembly. The McGraw-Hill Companies, New York"},{"key":"6338_CR3","doi-asserted-by":"publisher","first-page":"28525","DOI":"10.1109\/ACCESS.2021.3059100","volume":"9","author":"D Zhang","year":"2021","unstructured":"Zhang D, Ren Q, Su D (2021) A novel authentication methodology to detect counterfeit pcb using pcb trace-based ring oscillator. IEEE Access 9:28525\u201328539. https:\/\/doi.org\/10.1109\/ACCESS.2021.3059100","journal-title":"IEEE Access"},{"key":"6338_CR4","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s10845-010-0444-x","volume":"23","author":"FS Ismail","year":"2012","unstructured":"Ismail FS, Yusof R, Khalid M (2012) Optimization of electronics component placement design on pcb using self organizing genetic algorithm (soga). J Intell Manuf 23:883\u2013895","journal-title":"J Intell Manuf"},{"issue":"3","key":"6338_CR5","doi-asserted-by":"publisher","first-page":"20190737","DOI":"10.1587\/elex.17.20190737","volume":"17","author":"Y Satomi","year":"2020","unstructured":"Satomi Y, Hachiya K, Kanamoto T, Watanabe R, Kurokawa A (2020) Thermal placement on pcb of components including 3d ics. IEICE Electron Express 17(3):20190737\u201320190737","journal-title":"IEICE Electron Express"},{"key":"6338_CR6","doi-asserted-by":"crossref","unstructured":"Badriyah T, Setyorini F, Yuliawan N (2016) The implementation of genetic algorithm and routing lee for pcb design optimization. In: International Conference on Informatics and Computing (ICIC)","DOI":"10.1109\/IAC.2016.7905706"},{"key":"6338_CR7","doi-asserted-by":"crossref","unstructured":"Kureichik V, Kuliev E (2020) Integrated algorithm for elements placement on the printed circuit board. In: IOP Conference Series: Materials Science and Engineering, vol 734, p 012146","DOI":"10.1088\/1757-899X\/734\/1\/012146"},{"key":"6338_CR8","doi-asserted-by":"crossref","unstructured":"Cheng C-K, Ho C-T, Holtz C (2022) Net separation-oriented printed circuit board placement via margin maximization. In: 27th Asia and South Pacific Design Automation Conference (ASP-DAC), pp 288\u2013293","DOI":"10.1109\/ASP-DAC52403.2022.9712480"},{"key":"6338_CR9","doi-asserted-by":"crossref","unstructured":"Zhang C, Jin H, Chen J, Zhu J, Luo J (2020) A hierarchy mcts algorithm for the automated pcb routing. In: 16th International Conference on Control & Automation (ICCA), pp 1366\u20131371","DOI":"10.1109\/ICCA51439.2020.9264558"},{"issue":"9","key":"6338_CR10","doi-asserted-by":"publisher","first-page":"2801","DOI":"10.1109\/TCAD.2023.3236269","volume":"42","author":"K Kunal","year":"2023","unstructured":"Kunal K, Dhar T, Madhusudan M, Poojary J, Sharma AK, Xu W, Burns SM, Hu J, Harjani R, Sapatnekar SS (2023) Gnn-based hierarchical annotation for analog circuits. IEEE Trans Comput-Aided Des Integr Circuit Syst 42(9):2801\u20132814. https:\/\/doi.org\/10.1109\/TCAD.2023.3236269","journal-title":"IEEE Trans Comput-Aided Des Integr Circuit Syst"},{"key":"6338_CR11","doi-asserted-by":"publisher","unstructured":"Kunal K, Dhar T, Madhusudan M, Poojary J, Sharma A, Xu W, Burns SM, Hu J, Harjani R, Sapatnekar SS (2020) Gana: graph convolutional network based automated netlist annotation for analog circuits. In: 2020 design, automation & test in Europe conference & exhibition (DATE), pp 55\u201360. https:\/\/doi.org\/10.23919\/DATE48585.2020.9116329","DOI":"10.23919\/DATE48585.2020.9116329"},{"issue":"1","key":"6338_CR12","doi-asserted-by":"publisher","first-page":"364","DOI":"10.14778\/1453856.1453899","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang H, Zhang Y, Lin X, Yu JX (2008) Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc LDB Endow 1(1):364\u2013375","journal-title":"Proc LDB Endow"},{"issue":"1\u20132","key":"6338_CR13","doi-asserted-by":"publisher","first-page":"340","DOI":"10.14778\/1920841.1920887","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao P, Han J (2010) On graph query optimization in large networks. Proc VLDB Endow 3(1\u20132):340\u2013351","journal-title":"Proc VLDB Endow"},{"key":"6338_CR14","unstructured":"Han W-S, Lee J, Lee J-H (2013) Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, pp. 337\u2013348"},{"issue":"3","key":"6338_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10601-009-9074-3","volume":"15","author":"S Zampelli","year":"2010","unstructured":"Zampelli S, Deville Y, Solnon C (2010) Solving subgraph isomorphism problems with constraint programming. Constraints 15(3):327\u2013353","journal-title":"Constraints"},{"issue":"12","key":"6338_CR16","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C Solnon","year":"2010","unstructured":"Solnon C (2010) All different-based filtering for subgraph isomorphism. Artif Intell 174(12):850\u2013864","journal-title":"Artif Intell"},{"key":"6338_CR17","doi-asserted-by":"crossref","unstructured":"Kotthoff L, McCreesh C, Solnon C (2016) Portfolios of subgraph isomorphism algorithms. In: International Conference on Learning and Intelligent Optimization, Springer. pp 107\u2013122","DOI":"10.1007\/978-3-319-50349-3_8"},{"issue":"1","key":"6338_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM (JACM) 23(1):31\u201342","journal-title":"J ACM (JACM)"},{"key":"6338_CR19","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2001) An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 Workshop on Graph-Based Representations in Pattern Recognition, pp 149\u2013159. Citeseer"},{"issue":"10","key":"6338_CR20","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"6338_CR21","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/TPAMI.2017.2696940","volume":"40","author":"V Carletti","year":"2017","unstructured":"Carletti V, Foggia P, Saggese A, Vento M (2017) Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with vf3. IEEE Trans Pattern Anal Mach Intell 40(4):804\u2013818","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6338_CR22","doi-asserted-by":"crossref","unstructured":"Battiti R, Mascia F (2007) An algorithm portfolio for the sub-graph isomorphism problem. In: International Workshop on Wngineering Stochastic Local Search Algorithms, Springer. pp 106\u2013120","DOI":"10.1007\/978-3-540-74446-7_8"},{"key":"6338_CR23","doi-asserted-by":"crossref","unstructured":"Almasri I, Gao X, Fedoroff N (2014) Quick mining of isomorphic exact large patterns from large graphs. In: 2014 IEEE International Conference on Data Mining Workshop, pp 517\u2013524. IEEE","DOI":"10.1109\/ICDMW.2014.65"},{"issue":"1","key":"6338_CR24","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TCBB.2016.2515595","volume":"14","author":"V Bonnici","year":"2016","unstructured":"Bonnici V, Giugno R (2016) On the variable ordering in subgraph isomorphism algorithms. IEEE\/ACM Trans Comput Biol Bioinform 14(1):193\u2013203","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"6338_CR25","doi-asserted-by":"crossref","unstructured":"Han M, Kim H, Gu G, Park K, Han W-S (2019) Efficient subgraph matching: harmonizing dynamic programming, adaptive matching order, and failing set together. In: Proceedings of the 2019 International Conference on Management of Data, pp 1429\u20131446","DOI":"10.1145\/3299869.3319880"},{"key":"6338_CR26","doi-asserted-by":"crossref","unstructured":"Zhu Z, Mei Y, Li Z, Lin J, Chen J, Yang J, Chang Y-W (2022) High-performance placement for large-scale heterogeneous fpgas with clock constraints. In: Proceedings of the 59th ACM\/IEEE Design Automation Conference, pp 643\u2013648","DOI":"10.1145\/3489517.3530567"},{"key":"6338_CR27","doi-asserted-by":"crossref","unstructured":"Zhu Z, Chen J, Peng Z, Zhu W, Chang Y-W (2018) Generalized augmented lagrangian and its applications to vlsi global placement. In: Proceedings of ACM\/ESDA\/IEEE Design Automation Conference, pp 1\u20136","DOI":"10.1145\/3195970.3196057"},{"key":"6338_CR28","doi-asserted-by":"crossref","unstructured":"Bi F, Chang L, Lin X, Qin L, Zhang W (2016) Efficient subgraph matching by postponing cartesian products. In: Proceedings of the 2016 International Conference on Management of Data, pp 1199\u20131214","DOI":"10.1145\/2882903.2915236"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06338-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06338-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06338-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T12:11:52Z","timestamp":1724501512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06338-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,6]]},"references-count":28,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["6338"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06338-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2024,7,6]]},"assertion":[{"value":"1 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}