{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:36:31Z","timestamp":1725579391513},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"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":[[2021,8,23]]},"DOI":"10.1109\/mmar49549.2021.9528478","type":"proceedings-article","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T20:38:44Z","timestamp":1632256724000},"page":"281-284","source":"Crossref","is-referenced-by-count":0,"title":["Aggregation Algorithms for Graph Coloring"],"prefix":"10.1109","author":[{"given":"Krzysztof","family":"Pienkosz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.5.860"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/24.1.85"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.08.010"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(91)90043-O"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-3187-7.50015-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.07.028"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"},{"journal-title":"Probabilistic bounds and heuristic algorithms for coloring large random graphs","year":"1982","author":"johri","key":"ref8"},{"key":"ref7","first-page":"513","article-title":"Worst case behavior of graph coloring algorithms","author":"johnson","year":"0","journal-title":"Proceedings of 5th Southeastern Conference on Combinatorics Graph Theory and Computing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.09.018"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.6028\/jres.084.024"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"}],"event":{"name":"2021 25th International Conference on Methods and Models in Automation and Robotics (MMAR)","start":{"date-parts":[[2021,8,23]]},"location":"Mi\u0119dzyzdroje, Poland","end":{"date-parts":[[2021,8,26]]}},"container-title":["2021 25th International Conference on Methods and Models in Automation and Robotics (MMAR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9528424\/9528425\/09528478.pdf?arnumber=9528478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:45:30Z","timestamp":1652197530000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9528478\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,23]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/mmar49549.2021.9528478","relation":{},"subject":[],"published":{"date-parts":[[2021,8,23]]}}}