{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:07Z","timestamp":1750221247391,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T00:00:00Z","timestamp":1532304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EPSRC","award":["EP\/N011163\/1 and EP\/P020372\/1"],"award-info":[{"award-number":["EP\/N011163\/1 and EP\/P020372\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,23]]},"DOI":"10.1145\/3212734.3212787","type":"proceedings-article","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T16:28:33Z","timestamp":1533054513000},"page":"159-161","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Christian","family":"Konrad","sequence":"first","affiliation":[{"name":"University of Bristol, Bristol, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viktor","family":"Zamaraev","sequence":"additional","affiliation":[{"name":"Durham University, Durham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,23]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/0196-6774(86)90019-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/978-3-642-31585-5_37"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1007\/s00446-009-0088-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/978-3-319-25258-2_15"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2903137"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/2933057.2933068"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/3188745.3188964"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1016\/S0019-9958(86)80023-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/978-3-540-87779-0_6"},{"key":"e_1_3_2_1_10_1","volume-title":"Local Conflict Coloring. In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9--11","author":"Fraigniaud Pierre","year":"2016","unstructured":"Pierre Fraigniaud , Marc Heinrich , and Adrian Kosowski . 2016 . Local Conflict Coloring. In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9--11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. 625--634. Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski. 2016. Local Conflict Coloring. In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9--11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. 625--634."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.5555\/2884435.2884455"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/3055399.3055471"},{"key":"e_1_3_2_1_13_1","volume-title":"Simple and Near-Optimal Distributed Coloring for Sparse Graphs. In Distributed Computing: 31th International Symposium, DISC 2017, Vienna, Austria, October 16--20, 2017. Proceedings.","author":"Ghaffari Mohsen","year":"2017","unstructured":"Mohsen Ghaffari and Christina Lymouri . 2017 . Simple and Near-Optimal Distributed Coloring for Sparse Graphs. In Distributed Computing: 31th International Symposium, DISC 2017, Vienna, Austria, October 16--20, 2017. Proceedings. Mohsen Ghaffari and Christina Lymouri. 2017. Simple and Near-Optimal Distributed Coloring for Sparse Graphs. In Distributed Computing: 31th International Symposium, DISC 2017, Vienna, Austria, October 16--20, 2017. Proceedings."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1137\/0401044"},{"key":"e_1_3_2_1_15_1","volume-title":"Halld\u00f3rsson and Christian Konrad","author":"Magn\u00fas","year":"2014","unstructured":"Magn\u00fas M. Halld\u00f3rsson and Christian Konrad . 2014 . Distributed Algorithms for Coloring Interval Graphs. Springer , 454--468. Magn\u00fas M. Halld\u00f3rsson and Christian Konrad. 2014. Distributed Algorithms for Coloring Interval Graphs. Springer, 454--468."},{"key":"e_1_3_2_1_16_1","volume-title":"24th International Colloquium on Structural Information and Communication Complexity (SIROCCO","author":"Magn\u00fas","year":"2017","unstructured":"Magn\u00fas M. Halld\u00f3rsson and Christian Konrad. 2017. Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees. In Post-Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2017 ). Magn\u00fas M. Halld\u00f3rsson and Christian Konrad. 2017. Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees. In Post-Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2017)."},{"key":"e_1_3_2_1_17_1","volume-title":"Distributed Coloring and Independent Set in Chordal Graphs. arXiv preprint https:\/\/arxiv.org\/abs\/1805.04544","author":"Konrad Christian","year":"2018","unstructured":"Christian Konrad and Viktor Zamaraev . 2018. Distributed Coloring and Independent Set in Chordal Graphs. arXiv preprint https:\/\/arxiv.org\/abs\/1805.04544 ( 2018 ). Christian Konrad and Viktor Zamaraev. 2018. Distributed Coloring and Independent Set in Chordal Graphs. arXiv preprint https:\/\/arxiv.org\/abs\/1805.04544 (2018)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/978-3-540-87779-0_27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1137\/0221015"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_21_1","volume-title":"An optimal maximal independent set algorithm for bounded-independence graphs. Distributed Computing 22, 5 (01","author":"Schneider Johannes","year":"2010","unstructured":"Johannes Schneider and Roger Wattenhofer . 2010. An optimal maximal independent set algorithm for bounded-independence graphs. Distributed Computing 22, 5 (01 Aug 2010 ), 349--361. Johannes Schneider and Roger Wattenhofer. 2010. An optimal maximal independent set algorithm for bounded-independence graphs. Distributed Computing 22, 5 (01 Aug 2010), 349--361."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.4086\/toc.2007.v003a006"}],"event":{"sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"PODC '18","name":"PODC '18: ACM Symposium on Principles of Distributed Computing","location":"Egham United Kingdom"},"container-title":["Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212734.3212787","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3212734.3212787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:44Z","timestamp":1750212464000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212734.3212787"}},"subtitle":["Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs"],"short-title":[],"issued":{"date-parts":[[2018,7,23]]},"references-count":22,"alternative-id":["10.1145\/3212734.3212787","10.1145\/3212734"],"URL":"https:\/\/doi.org\/10.1145\/3212734.3212787","relation":{},"subject":[],"published":{"date-parts":[[2018,7,23]]},"assertion":[{"value":"2018-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}