{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T06:05:00Z","timestamp":1779602700477,"version":"3.53.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032264640","type":"print"},{"value":"9783032264657","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-26465-7_21","type":"book-chapter","created":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:49:49Z","timestamp":1779601789000},"page":"391-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Optimal Distributed Delta Coloring"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0229-0287","authenticated-orcid":false,"given":"Manuel","family":"Jakob","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4062-6991","authenticated-orcid":false,"given":"Yannic","family":"Maus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,24]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Assadi, S., Chen, Y., Khanna, S.: Sublinear algorithms for $$(\\Delta + 1)$$ vertex coloring. In: Proceedings of the SIAM-ACM Symposium on Discrete Algorithms (SODA), pp. 767\u2013786 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.48, full version at arXiv:1807.08886","DOI":"10.1137\/1.9781611975482.48"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Assadi, S., Kumar, P., Mittal, P.: Brooks\u2019 theorem in graph streams: a single-pass semi-streaming algorithm for $$\\Delta $$-coloring. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 234\u2013247 (2022)","DOI":"10.1145\/3519935.3520005"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Balliu, A., Brandt, S., Kuhn, F., Olivetti, D.: Distributed $${\\Delta }$$-coloring plays hide-and-seek. In: Proceedings of the 54th ACM Symposium on Theory of Computing (STOC) (2022)","DOI":"10.1145\/3519935.3520027"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Bourreau, Y., Brandt, S., Nolin, A.: Faster distributed $$\\Delta $$-coloring via a reduction to MIS. CoRR abs\/2508.01762 (2025). https:\/\/doi.org\/10.48550\/ARXIV.2508.01762, to appear in SODA 2026","DOI":"10.48550\/ARXIV.2508.01762"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Bourreau, Y., Brandt, S., Nolin, A.: Faster distributed $$\\Delta $$-coloring via ruling subgraphs. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC 2025). ACM (2025). https:\/\/doi.org\/10.1145\/3717823.3718320","DOI":"10.1145\/3717823.3718320"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Brandt, S., et al.: A lower bound for the distributed Lov\u00e1sz local lemma. In: Proceedings of the ACM Symposium on Theory of Computing (STOC) (2016)","DOI":"10.1145\/2897518.2897570"},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Brandt, S., Maus, Y., Narayanan, A., Schager, F., Uitto, J.: On the locality of hall\u2019s theorem. In: Azar, Y., Panigrahi, D. (eds.) Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025, pp. 4198\u20134226. SIAM (2025). https:\/\/doi.org\/10.1137\/1.9781611978322.143","DOI":"10.1137\/1.9781611978322.143"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37(2), 194\u2013197 (1941). https:\/\/doi.org\/10.1017\/S030500410002168X","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Chang, Y., Kopelowitz, T., Pettie, S.: An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 615\u2013624 (2016)","DOI":"10.1109\/FOCS.2016.72"},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Chang, Y.J., Kopelowitz, T., Pettie, S.: An exponential separation between randomized and deterministic complexity in the LOCAL model. In: Proceedings of the 57th IEEE Symposium on Foundations of Computer Science (FOCS 2016), pp. 615\u2013624. IEEE Computer Society (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.72","DOI":"10.1109\/FOCS.2016.72"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1137\/19M1249527","volume":"49","author":"YJ Chang","year":"2020","unstructured":"Chang, Y.J., Li, W., Pettie, S.: Distributed ($$\\Delta +1$$)-coloring via ultrafast graph shattering. SIAM J. Comput. 49(3), 497\u2013539 (2020)","journal-title":"SIAM J. Comput."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Coy, S., Czumaj, A., Davies, P., Mishra, G.: Parallel derandomization for coloring (2024). note: https:\/\/arxiv.org\/abs\/2302.04378v1 contains the Delta-coloring algorithm","DOI":"10.1109\/IPDPS57955.2024.00098"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Elkin, M., Pettie, S., Su, H.: (2$$\\Delta -1$$)-edge-coloring is much easier than maximal matching in the distributed setting. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pp. 355\u2013370 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.26","DOI":"10.1137\/1.9781611973730.26"},{"key":"21_CR14","unstructured":"Erd\u0151s, P., Rubin, A., Taylor, H.: Choosability in graphs. In: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, vol.\u00a026, pp. 125\u2013157. Congressus Numerantium (1979)"},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Fischer, M., Halld\u00f3rsson, M.M., Maus, Y.: Fast distributed Brooks\u2019 theorem. In: Proceedings of the SIAM-ACM Symposium on Discrete Algorithms (SODA), pp. 2567\u20132588 (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch98","DOI":"10.1137\/1.9781611977554.ch98"},{"key":"21_CR16","doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Grunau, C.: Near-optimal deterministic network decomposition and ruling set, and improved MIS. In: 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27-30, 2024, pp. 2148\u20132179. IEEE (2024). https:\/\/doi.org\/10.1109\/FOCS61266.2024.00007","DOI":"10.1109\/FOCS61266.2024.00007"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Hirvonen, J., Kuhn, F., Maus, Y.: Improved distributed delta-coloring. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018, pp. 427\u2013436 (2018). https:\/\/dl.acm.org\/citation.cfm?id=3212764","DOI":"10.1145\/3212734.3212764"},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Hirvonen, J., Kuhn, F., Maus, Y.: Improved distributed $$\\Delta $$-coloring. In: Proceedings of the 37th ACM Symposium on Principles of Distributed Computing (PODC 2018), pp. 427\u2013436. ACM (2018). https:\/\/doi.org\/10.1145\/3212734.3212764","DOI":"10.1145\/3212734.3212764"},{"key":"21_CR19","unstructured":"Ghaffari, M., Hirvonen, J., Kuhn, F., Maus, Y., Suomela, J., Uitto, J.: Improved distributed degree splitting and edge coloring. In: Proceedings of the International Symposium on Distributed Computing (DISC), pp. 19:1\u201319:15 (2017)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Su, H.: Distributed degree splitting, edge coloring, and orientations. In: Proceedings of the SIAM-ACM Symposium on Discrete Algorithms (SODA), pp. 2505\u20132523 (2017)","DOI":"10.1137\/1.9781611974782.166"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Kuhn, F., Maus, Y., Tonoyan, T.: Efficient randomized distributed coloring in CONGEST. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 1180\u20131193 (2021). full version at CoRR abs\/2105.04700","DOI":"10.1145\/3406325.3451089"},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M.M., Kuhn, F., Nolin, A., Tonoyan, T.: Near-optimal distributed degree+1 coloring. In: Leonardi, S., Gupta, A. (eds.) STOC 2022: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pp. 450\u2013463. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3520023","DOI":"10.1145\/3519935.3520023"},{"key":"21_CR23","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M.M., Maus, Y.: Distributed delta-coloring under bandwidth limitations. In: Alistarh, D. (ed.) 38th International Symposium on Distributed Computing, DISC 2024, October 28 to November 1, 2024, Madrid, Spain. LIPIcs, vol.\u00a0319, pp. 31:1\u201331:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.DISC.2024.31","DOI":"10.4230\/LIPICS.DISC.2024.31"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Harris, D.G., Schneider, J., Su, H.H.: Distributed ($$\\Delta + 1$$)-coloring in sublogarithmic rounds. J.\u00a0ACM 65, 19:1\u201319:21 (2018)","DOI":"10.1145\/3178120"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Harris, S.G., Schneider, J., Su, H.H.: Distributed ($$\\Delta +1$$)-coloring in sublogarithmic rounds. In: Proceedings of the\u00a048th Symposium\u00a0on the Theory of Computing (STOC) (2016)","DOI":"10.1145\/2897518.2897533"},{"key":"21_CR26","doi-asserted-by":"publisher","unstructured":"Jakob, M., Maus, Y., Schager, F.: Towards optimal distributed edge coloring with fewer colors. In: Kowalski, D.R. (ed.) 39th International Symposium on Distributed Computing, DISC 2025, October 27-31, 2025, Berlin, Germany. LIPIcs, vol.\u00a0356, pp. 37:1\u201337:26. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.DISC.2025.37","DOI":"10.4230\/LIPICS.DISC.2025.37"},{"issue":"1","key":"21_CR27","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"key":"21_CR28","doi-asserted-by":"publisher","unstructured":"Maus, Y.: Distributed graph coloring made easy. In: Agrawal, K., Azar, Y. (eds.) SPAA 2021: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021, pp. 362\u2013372. ACM (2021). https:\/\/doi.org\/10.1145\/3409964.3461804","DOI":"10.1145\/3409964.3461804"},{"key":"21_CR29","doi-asserted-by":"publisher","unstructured":"Maus, Y., Tonoyan, T.: Local conflict coloring revisited: Linial for lists. In: Attiya, H. (ed.) 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference. LIPIcs, vol.\u00a0179, pp. 16:1\u201316:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2020.16","DOI":"10.4230\/LIPIcs.DISC.2020.16"},{"key":"21_CR30","unstructured":"Maus, Y., Uitto, J.: Efficient CONGEST algorithms for the Lov\u00e1sz local lemma. In: Gilbert, S. (ed.) Proceedings of the International Symposium on Distributed Computing (DISC). LIPIcs, vol.\u00a0209, pp. 31:1\u201331:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"3","key":"21_CR31","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0404036","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: A lower bound on probabilistic algorithms for distributive ring coloring. SIAM J. Discr. Math. 4(3), 409\u2013412 (1991)","journal-title":"SIAM J. Discr. Math."},{"issue":"2","key":"21_CR32","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/PL00008932","volume":"14","author":"A Panconesi","year":"2001","unstructured":"Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distrib. Comput. 14(2), 97\u2013100 (2001)","journal-title":"Distrib. Comput."},{"issue":"2","key":"21_CR33","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01200759","volume":"15","author":"A Panconesi","year":"1995","unstructured":"Panconesi, A., Srinivasan, A.: The local nature of $$\\Delta $$-coloring and its algorithmic applications. Combinatorica 15(2), 255\u2013280 (1995). https:\/\/doi.org\/10.1007\/BF01200759","journal-title":"Combinatorica"},{"key":"21_CR34","doi-asserted-by":"publisher","unstructured":"Schneider, J., Elkin, M., Wattenhofer, R.: Symmetry breaking depending on the chromatic number or the neighborhood growth. Theor. Comput. Sci. 509, 40\u201350 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.09.004","DOI":"10.1016\/j.tcs.2012.09.004"},{"key":"21_CR35","unstructured":"Vizing, V.: Vextex coloring with given colors. Metody Diskretn. Anal., 29:3\u201310 (1976)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26465-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:49:53Z","timestamp":1779601793000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26465-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032264640","9783032264657"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26465-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2026.webspace.durham.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}