{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T13:52:17Z","timestamp":1768312337785,"version":"3.49.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,11,25]]},"DOI":"10.1109\/candarw68385.2025.00037","type":"proceedings-article","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T18:20:34Z","timestamp":1768242034000},"page":"173-179","source":"Crossref","is-referenced-by-count":0,"title":["Multi-color ordering method for minimizing number of colors in quadratic unconstrained binary optimization formulation"],"prefix":"10.1109","author":[{"given":"Tomohiro","family":"Suzuki","sequence":"first","affiliation":[{"name":"University of Yamanashi,Graduate School of Engineering,Kofu,Yamanashi,Japan"}]}],"member":"263","reference":[{"issue":"5","key":"ref1","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0168-9274(91)90011-N","article-title":"On parallelism and convergence of incomplete LU factorizations","volume":"7","author":"Doi","year":"1991","journal-title":"Applied Numerical Mathematics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCSoC51149.2021.00045"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3635035.3635044"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2023kep0003"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/20.996114"},{"key":"ref7","article-title":"Computers and Intractability; a Guide to the Theory of NP-completeness","author":"Garey","year":"1990"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.25080\/tcwv9851"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref10","article-title":"Fixstars Amplify AE"},{"key":"ref11","article-title":"Optuna - An automatic hyperparameter optimization framework"},{"issue":"3","key":"ref12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","article-title":"An Automatic Method of Solving Discrete Programming Problems","volume":"28","author":"Land","year":"1960","journal-title":"Econometrica"},{"key":"ref13","article-title":"Optimization with PuLP"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.51"}],"event":{"name":"2025 Thirteenth International Symposium on Computing and Networking Workshops (CANDARW)","location":"Yamagata, Japan","start":{"date-parts":[[2025,11,25]]},"end":{"date-parts":[[2025,11,28]]}},"container-title":["2025 Thirteenth International Symposium on Computing and Networking Workshops (CANDARW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11318850\/11318884\/11318927.pdf?arnumber=11318927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T08:28:18Z","timestamp":1768292898000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11318927\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,25]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/candarw68385.2025.00037","relation":{},"subject":[],"published":{"date-parts":[[2025,11,25]]}}}