{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:51:36Z","timestamp":1729641096131,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/iscas.2005.1466068","type":"proceedings-article","created":{"date-parts":[[2005,7,27]],"date-time":"2005-07-27T13:52:28Z","timestamp":1122472348000},"page":"6248-6251","source":"Crossref","is-referenced-by-count":0,"title":["Segment Channel Routing with Pin Rearrangements via Satisfiability"],"prefix":"10.1109","author":[{"family":"Fei He","sequence":"first","affiliation":[]},{"family":"William N. N. Hung","sequence":"additional","affiliation":[]},{"family":"Xiaoyu Song","sequence":"additional","affiliation":[]},{"family":"Ming Gu","sequence":"additional","affiliation":[]},{"family":"Jiaguang Sun","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","first-page":"279","article-title":"efficient conflict driven learning in a boolean satisfiability solver","author":"zhang","year":"2001","journal-title":"Proc International Conference on Computer-Aided Design"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1992.279403"},{"key":"15","first-page":"1","article-title":"homotopic routing of multi-terminal nets with wire-length minimization","volume":"6","author":"gao","year":"1996","journal-title":"Journal of Circuits Systems and Computers"},{"key":"16","first-page":"457","article-title":"parallel algorithm for integrated floor planning and routing","author":"gao","year":"1995","journal-title":"Proc Int Conf High-Performance Computing"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1027084.1027090"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1989.76956"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/92.678873"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/43.184845"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/217474.217592"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3572-0","author":"brown","year":"1992","journal-title":"Field Programmable Gate Arrays"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/44.4.280"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1991.185322"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/43.391732"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/43.97620"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676333"},{"key":"9","article-title":"optimal symmetry detection for okfdds","author":"wang","year":"2000","journal-title":"Proc IEEE Midwest Symp Circuits and Systems (MWSCAS 2000)"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/43.402506"}],"event":{"name":"2005 IEEE International Symposium on Circuits and Systems","location":"Kobe, Japan"},"container-title":["2005 IEEE International Symposium on Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9898\/31469\/01466068.pdf?arnumber=1466068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T17:35:39Z","timestamp":1497634539000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1466068\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/iscas.2005.1466068","relation":{},"subject":[]}}