{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:07Z","timestamp":1759639087047,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030892395"},{"type":"electronic","value":"9783030892401"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89240-1_5","type":"book-chapter","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T05:01:04Z","timestamp":1634619664000},"page":"61-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Coloring and the Local Structure of Unit-Disk Graphs"],"prefix":"10.1007","author":[{"given":"Louis","family":"Esperet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Julliot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"de Mesmay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"issue":"5\u20136","key":"5_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00446-009-0088-2","volume":"22","author":"L Barenboim","year":"2010","unstructured":"Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distrib. Comput. 22(5\u20136), 363\u2013379 (2010)","journal-title":"Distrib. Comput."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. J. ACM 63(3), 20:1\u201320:45 (2016)","DOI":"10.1145\/2903137"},{"key":"5_CR3","first-page":"247","volume":"24","author":"L Bieberbach","year":"1915","unstructured":"Bieberbach, L.: \u00dcber eine Extremaleigenschaft des Kreises. Jahresber. Deutsch. Math.-Verein. 24, 247\u2013250 (1915)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Cho, S.Y., Adjih, C., Jacquet, P.: Heuristics for network coding in wireless networks. In: Proceedings of the 3rd International Conference on Wireless Internet (WICON \u201907), Article 6, pp. 1\u20135 (2007)","DOI":"10.4108\/wicon.2007.2097"},{"issue":"1\u20133","key":"5_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discret. Math."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Elkin, M., Pettie, S., Su, H.-H.: $$(2\\Delta -1)$$-edge-coloring is much easier than maximal matching in the distributed setting. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA\u201915), pp. 355\u2013370 (2015)","DOI":"10.1137\/1.9781611973730.26"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Esperet, L., Julliot, J., de Mesmay, A.: Distributed coloring and the local structure of unit-disk graphs. arXiv:2106.12322 (2021)","DOI":"10.1016\/j.tcs.2022.12.024"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1006\/jctb.2001.2042","volume":"83","author":"S Gerke","year":"2001","unstructured":"Gerke, S., McDiarmid, C.J.H.: Graph imperfection. J. Combin. Theory Ser. B 83(1), 58\u201378 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Grunau, C., Rozho\u0148, V.: Improved deterministic network decomposition. In: Proceedings of the ACM Symposium on Discrete Algorithms (2021)","DOI":"10.1137\/1.9781611976465.173"},{"key":"5_CR10","unstructured":"Ghaffari, M., Kuhn, F.: Deterministic distributed vertex coloring: simpler, faster, and without network decomposition. arXiv:2011.04511 (2020)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/PL00009196","volume":"20","author":"A Gr\u00e4f","year":"1998","unstructured":"Gr\u00e4f, A., Stumpf, M., Wei\u00dfenfels, G.: On coloring unit disk graphs. Algorithmica 20, 277\u2013293 (1998)","journal-title":"Algorithmica"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2018.11.028","volume":"811","author":"M Halld\u00f3rsson","year":"2020","unstructured":"Halld\u00f3rsson, M., Konrad, C.: Improved distributed algorithms for coloring interval graphs with application to multicoloring trees. Theoret. Comput. Sci. 811, 29\u201341 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"15","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1016\/j.dam.2011.05.004","volume":"159","author":"M Hassinen","year":"2011","unstructured":"Hassinen, M., Kaasinen, J., Kranakis, E., Polishchuk, V., Suomela, J., Wiese, A.: Analysing local algorithms in location-aware quasi-unit-disk graphs. Discrete Applied Math. 159(15), 1566\u20131580 (2011)","journal-title":"Discrete Applied Math."},{"key":"5_CR14","unstructured":"Kuhn, F.: The price of locality: exploring the complexity of distributed coordination primitives. Ph.D. thesis, ETH Zurich (2005)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Kuhn, F.: Faster deterministic distributed coloring through recursive list coloring. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2020)","DOI":"10.1137\/1.9781611975994.76"},{"key":"5_CR16","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, 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/rsa.10077","volume":"22","author":"CJH McDiarmid","year":"2003","unstructured":"McDiarmid, C.J.H.: Random channel assignment in the plane. Random Struct. Algorithms 22(2), 187\u2013212 (2003)","journal-title":"Random Struct. Algorithms"},{"issue":"1\u20133","key":"5_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0012-365X(98)00292-1","volume":"199","author":"CJH McDiarmid","year":"1999","unstructured":"McDiarmid, C.J.H., Reed, B.: Colouring proximity graphs in the plane. Discret. Math. 199(1\u20133), 123\u2013137 (1999)","journal-title":"Discret. Math."},{"key":"5_CR19","unstructured":"Peeters, R.: On coloring $$j$$-unit sphere graphs. FEW 512, Department of Economics, Tilburg University (1991)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Rozho\u0148, V., Ghaffari, M.: Polylogarithmic-time deterministic network decomposition and distributed derandomization. In: Proceedings 52nd ACM Symposium on Theory of Computing (STOC), pp. 350\u2013363 (2020)","DOI":"10.1145\/3357713.3384298"},{"key":"5_CR21","unstructured":"Scheinerman E.R., Ullman, D.H.: Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Dover Publications (2013)"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/jgt.22601","volume":"95","author":"A Scott","year":"2020","unstructured":"Scott, A., Seymour, P.: A survey of $$\\chi $$-boundedness. J. Graph Theory 95, 473\u2013504 (2020)","journal-title":"J. Graph Theory"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Suomela, J.: Survey of local algorithms. ACM Comput. Surv. 45(2), Article 24 (2013)","DOI":"10.1145\/2431211.2431223"},{"issue":"4","key":"5_CR24","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1137\/S0097539700382157","volume":"32","author":"M Valencia-Pabon","year":"2003","unstructured":"Valencia-Pabon, M.: Revisiting Tucker\u2019s algorithm to color circular arc graphs. SIAM J. Comput. 32(4), 1067\u20131072 (2003)","journal-title":"SIAM J. Comput."},{"key":"5_CR25","unstructured":"Wiese, A.: Local approximation algorithms in unit disk graphs. Master\u2019s thesis, Technische Universit\u00e4t Berlin (2007)"},{"issue":"4","key":"5_CR26","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1142\/S1793830909000415","volume":"1","author":"A Wiese","year":"2009","unstructured":"Wiese, A., Kranakis, E.: Local construction and coloring of spanners of location aware unit disk graphs. Discret. Math. Algorithms Appl. 1(4), 555\u2013588 (2009)","journal-title":"Discret. Math. Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89240-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T19:31:51Z","timestamp":1673551911000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89240-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030892395","9783030892401"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89240-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/ALGOSENSORS2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}