{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T11:27:56Z","timestamp":1763724476260,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1564302"],"award-info":[{"award-number":["CCF-1564302"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1109\/tcad.2020.2977066","type":"journal-article","created":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T22:39:41Z","timestamp":1582929581000},"page":"5097-5110","source":"Crossref","is-referenced-by-count":14,"title":["Grid-Based Framework for Routability Analysis and Diagnosis With Conditional Design Rules"],"prefix":"10.1109","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1508-3315","authenticated-orcid":false,"given":"Dongwon","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0778-0110","authenticated-orcid":false,"given":"Daeyeal","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3842-5613","authenticated-orcid":false,"given":"Ilgweon","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8548-4539","authenticated-orcid":false,"given":"Chester","family":"Holtz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sicun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0965-7247","authenticated-orcid":false,"given":"Bill","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9865-8390","authenticated-orcid":false,"given":"Chung-Kuan","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_5"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190094"},{"journal-title":"Espresso Logic Minimizer","year":"2017","key":"ref33"},{"journal-title":"SAT Encodings of Finite CSPs","year":"2015","author":"nguyen","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2007.4397256"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44969-8_5"},{"key":"ref36","first-page":"163","article-title":"Computing minimally unsatisfiable subformulas: State of the art and future directions","volume":"19","author":"marques-silva","year":"2012","journal-title":"J Multiple-Valued Logic Soft Computing"},{"journal-title":"LEF\/DEF Language Reference","year":"2018","key":"ref35"},{"key":"ref34","article-title":"Efficient CNF encoding for selecting 1 from n objects","author":"klieber","year":"2007","journal-title":"Proc Int Workshop Constraints Formal Verification"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3036669.3036672"},{"journal-title":"IBM ILOG CPLEX","year":"2018","key":"ref40"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3299902.3309744"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC47756.2020.9045729"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3036669.3036676"},{"key":"ref14","first-page":"161","article-title":"ISPD 2014 benchmarks with sub-45 nm technology rules for detailed-routing-driven placement","author":"yutsis","year":"2014","journal-title":"Proc ACM Int Symp Phys Design"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2717764.2723572"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654225"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2717764.2717776"},{"key":"ref18","first-page":"1","article-title":"Vertical M1 routing-aware detailed placement for congestion and wirelength reduction in sub-10 nm nodes","author":"debacker","year":"2017","journal-title":"Proc Design Autom Conf"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2013274"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/43.486666"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062302"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2002.1167571"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3036669.3036679"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1117\/12.920028"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2399439"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1117\/1.JMM.13.4.043018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2842612"},{"key":"ref7","article-title":"Self-aligned double patterning (SADP) compliant design flow","volume":"8327","author":"ma","year":"2012","journal-title":"Proc SPIE"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744839"},{"journal-title":"SR Software Engineering Group Director Personal Communication","year":"2019","key":"ref9"},{"journal-title":"ITRS 2015 report","year":"2018","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2693270"},{"journal-title":"Cadence Innovus User Guide","year":"2019","key":"ref45"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2847263.2847342"},{"key":"ref21","first-page":"244","article-title":"Ordered escape routing based on Boolean satisfiability","author":"luo","year":"2008","journal-title":"Proc Asia South Pacific Design Automat Conf"},{"key":"ref42","article-title":"Glucose and Syrup in the SAT race 2015","author":"audemard","year":"2015","journal-title":"Proc SAT Race"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SLIP.2011.6135436"},{"journal-title":"Plingeling Multi-Threading SAT Solver","year":"2017","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISED.2010.35"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3299902.3311067"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3299902.3309752"},{"journal-title":"Proceedings of SAT Competition 2018","year":"2018","author":"heule","key":"ref43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3225209.3225210"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/9265421\/09018267.pdf?arnumber=9018267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:06:49Z","timestamp":1651068409000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9018267\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":45,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2020.2977066","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"type":"print","value":"0278-0070"},{"type":"electronic","value":"1937-4151"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}