{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:22:55Z","timestamp":1729617775728,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/apccas.2002.1115139","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T00:51:07Z","timestamp":1056588667000},"page":"131-136","source":"Crossref","is-referenced-by-count":2,"title":["An efficient decoding method of sequence-pair"],"prefix":"10.1109","volume":"2","author":[{"given":"C.","family":"Kodama","sequence":"first","affiliation":[]},{"given":"K.","family":"Fujiyoshi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"2001","author":"kodama","article-title":"Super sequence-pair","key":"ref10"},{"key":"ref11","first-page":"55","article-title":"Selected sequence-pair","author":"kodama","year":"2001","journal-title":"IEICE Technical Report VLD 2001–17"},{"key":"ref12","first-page":"31","article-title":"An effective MOVE operation for selected sequence-pair","author":"fujiyoshi","year":"2002","journal-title":"IEICE Technical Report VLD 2002-6"},{"key":"ref13","first-page":"272","article-title":"Linear time decodable rectangular dissection to represent arbitrary packing using Q-sequence","author":"tsuboi","year":"2001","journal-title":"Proc SASIMI"},{"key":"ref14","first-page":"264","article-title":"The tight upper bound of the empty rooms in floorplan","author":"takashima","year":"2001","journal-title":"Proc SASIMI"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/S0019-9958(83)80038-2"},{"key":"ref16","first-page":"67","article-title":"An optimization technique for integrated circuit layout design","author":"ohtsuki","year":"1970","journal-title":"Proc of ICCST"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/43.828551"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/43.908471","article-title":"Floorplanning Using a Tree Representation","volume":"20","author":"guo","year":"2001","journal-title":"IEEE Trans CAD"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/43.969434"},{"key":"ref5","first-page":"31","article-title":"An algorithm for finding a maximum weight decreasing sequence in a permutation, motivated by rectangle packing problem","author":"takahashi","year":"1996","journal-title":"IEICE Technical Report VLD96–30"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/ASPDAC.1997.600346"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/370155.370522"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/43.673633"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/ICCAD.1995.480159"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/APCCAS.2000.913649"}],"event":{"acronym":"APCCAS-02","name":"APCCAS. Asia-Pacific Conference on Circuits and Systems","location":"Bali, Indonesia"},"container-title":["Asia-Pacific Conference on Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8182\/24592\/01115139.pdf?arnumber=1115139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T22:45:55Z","timestamp":1497566755000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1115139\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/apccas.2002.1115139","relation":{},"subject":[]}}