{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T13:18:00Z","timestamp":1792156680002,"version":"4.4.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1109\/iccad.2013.6691115","type":"proceedings-article","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T22:22:41Z","timestamp":1394230961000},"page":"170-177","source":"Crossref","is-referenced-by-count":32,"title":["Layout decomposition with pairwise coloring for multiple patterning lithography"],"prefix":"10.1109","author":[{"given":"Ye","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wai-Shing","family":"Luk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hai","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changhao","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuan","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","article-title":"Finding a maximum cut of a planar graph in polynomial time","volume":"4","author":"hadlock","year":"1975","journal-title":"SIAM Journal on Computing"},{"key":"17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","article-title":"A Linear Time Implementation of SPQR-Trees","author":"gutwenger","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2005.1560055"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/0214021"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1998.742999"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.1983.262975"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/2429384.2429396"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1117\/12.916636"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/IITC.2007.382350"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2035577"},{"key":"20","first-page":"7","author":"mehlhorn","year":"1997","journal-title":"The LEDA Platform for Combinatorial and Geometric Computing"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2008.4681616"},{"key":"1","author":"ausiello","year":"1999","journal-title":"Complexity and Approximation Combinatorial Optimization Problems and Their Approximability Properties"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228579"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654108"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735054"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2010.5419807"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2011.5722298"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2011.6105297"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2232710"}],"event":{"name":"2013 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)","location":"San Jose, CA","start":{"date-parts":[[2013,11,18]]},"end":{"date-parts":[[2013,11,21]]}},"container-title":["2013 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6679730\/6691081\/06691115.pdf?arnumber=6691115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T09:15:30Z","timestamp":1498122930000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6691115\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/iccad.2013.6691115","relation":{},"subject":[],"published":{"date-parts":[[2013,11]]}}}