{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:04Z","timestamp":1750306084294,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ISF","award":["724\/15"],"award-info":[{"award-number":["724\/15"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087812","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"175-184","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity"],"prefix":"10.1145","author":[{"given":"Leonid","family":"Barenboim","sequence":"first","affiliation":[{"name":"Open University of Israel, Raananna, Israel"}]},{"given":"Michael","family":"Elkin","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Beer-Sheva, Israel"}]},{"given":"Tzalik","family":"Maimon","sequence":"additional","affiliation":[{"name":"Open University of Israel, Raananna, Israel"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63504"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767410"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400757"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536432"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835797"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993825"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00520ED1V01Y201307DCT011"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/12088848X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.60"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/115234.115347"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80023-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44676-1_29"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"D. Dubhashi D. Grable and A. Panconesi. Nearly-optimal distributed edge-colouring via the nibble method. Theoretical Computer Science a special issue for the best papers of ESA95 203(2):225--251 1998.  D. Dubhashi D. Grable and A. Panconesi. Nearly-optimal distributed edge-colouring via the nibble method. Theoretical Computer Science a special issue for the best papers of ESA95 203(2):225--251 1998.","DOI":"10.1016\/S0304-3975(98)00022-X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"T. Erlebach and K. Jansen. The complexity of path coloring and call scheduling. Theoretical Computer Science 255 (1--2) pages 33--50 2001.  T. Erlebach and K. Jansen. The complexity of path coloring and call scheduling. Theoretical Computer Science 255 (1--2) pages 33--50 2001.","DOI":"10.1016\/S0304-3975(99)00152-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.26"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud M. Heinrich and A. Kosowski. Local Conflict Coloring. http:\/\/arxiv.org\/abs\/1511.01287. To appear in FOCS 2016.  P. Fraigniaud M. Heinrich and A. Kosowski. Local Conflict Coloring. http:\/\/arxiv.org\/abs\/1511.01287. To appear in FOCS 2016.","DOI":"10.1109\/FOCS.2016.73"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626496000315"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498534"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"M. Ghaffari and H. Su. Distributed Degree Splitting Edge Coloring and Orientations. https:\/\/arxiv.org\/abs\/1608.03220. To appear in SODA 2016.  M. Ghaffari and H. Su. Distributed Degree Splitting Edge Coloring and Orientations. https:\/\/arxiv.org\/abs\/1608.03220. To appear in SODA 2016.","DOI":"10.1137\/1.9781611974782.166"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0401044"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199705)10:3%3C385::AID-RSA6%3E3.0.CO;2-S"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00190-0"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100373121"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90026-5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993814"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584032"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146387"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0005"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.20"},{"key":"e_1_3_2_1_31_1","first-page":"161","volume-title":"Colloq. Math. 3","author":"Mycielski J.","year":"1955"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80069-8"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008932"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793250767"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_36_1","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing V.","year":"1964","journal-title":"Metody Diskret. Analiz"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.2.288"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00012"}],"event":{"name":"PODC '17: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Washington DC USA","acronym":"PODC '17"},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087812","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":38,"alternative-id":["10.1145\/3087801.3087812","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087812","relation":{},"subject":[],"published":{"date-parts":[[2017,7,25]]},"assertion":[{"value":"2017-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}