{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:54Z","timestamp":1750220334596,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["853109"],"award-info":[{"award-number":["853109"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538437","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"292-300","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs"],"prefix":"10.1145","author":[{"given":"Michal","family":"Dory","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Mohsen","family":"Ghaffari","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Saeed","family":"Ilchi","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210383"},{"key":"e_1_3_2_2_2_1","volume-title":"Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs. CoRR abs\/2102.08076","author":"Amiri Saeed Akhoondian","year":"2021","unstructured":"Saeed Akhoondian Amiri . 2021. Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs. CoRR abs\/2102.08076 ( 2021 ). Saeed Akhoondian Amiri. 2021. Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs. CoRR abs\/2102.08076 (2021)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326170"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.01.011"},{"key":"e_1_3_2_2_5_1","volume-title":"35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs","volume":"18","author":"Bonamy Marthe","year":"2021","unstructured":"Marthe Bonamy , Linda Cook , Carla Groenland , and Alexandra Wesolek . 2021 . A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs . In 35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs , Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 13:1--13: 18 . Marthe Bonamy, Linda Cook, Carla Groenland, and Alexandra Wesolek. 2021. A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs. In 35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs, Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 13:1--13:18."},{"key":"e_1_3_2_2_6_1","volume-title":"Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. In 35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs","volume":"18","author":"Cambus M\u00e9lanie","year":"2021","unstructured":"M\u00e9lanie Cambus , Davin Choo , Havu Miikonen , and Jara Uitto . 2021 . Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. In 35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs , Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 15:1--15: 18 . M\u00e9lanie Cambus, Davin Choo, Havu Miikonen, and Jara Uitto. 2021. Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. In 35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs, Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 15:1--15:18."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_6"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331626"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591884"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22426"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381418"},{"volume-title":"Proc. 49th ACM Symp. on Theory of Computing (STOC). 784-- 797","author":"Ghaffari M.","key":"e_1_3_2_2_12_1","unstructured":"M. Ghaffari , F. Kuhn , and Y. Maus . 2017. On the Complexity of Local Distributed Graph Problems . In Proc. 49th ACM Symp. on Theory of Computing (STOC). 784-- 797 . M. Ghaffari, F. Kuhn, and Y. Maus. 2017. On the Complexity of Local Distributed Graph Problems. In Proc. 49th ACM Symp. on Theory of Computing (STOC). 784-- 797."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461800"},{"volume-title":"InternationalWorkshop on Graph-Theoretic Concepts in Computer Science","author":"Goel Gaurav","key":"e_1_3_2_2_14_1","unstructured":"Gaurav Goel and Jens Gustedt . 2006. Bounded arboricity to determine the local structure of sparse graphs . In InternationalWorkshop on Graph-Theoretic Concepts in Computer Science . Springer , 159--167. Gaurav Goel and Jens Gustedt. 2006. Bounded arboricity to determine the local structure of sparse graphs. In InternationalWorkshop on Graph-Theoretic Concepts in Computer Science. Springer, 159--167."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/777474.777476"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"volume-title":"Proc. 17th Symp. on Discrete Algorithms (SODA). 980--989","author":"Kuhn F.","key":"e_1_3_2_2_17_1","unstructured":"F. Kuhn , T. Moscibroda , and R. Wattenhofer . 2006. The Price of Being Near- Sighted . In Proc. 17th Symp. on Discrete Algorithms (SODA). 980--989 . F. Kuhn, T. Moscibroda, and R. Wattenhofer. 2006. The Price of Being Near- Sighted. In Proc. 17th Symp. on Discrete Algorithms (SODA). 980--989."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742012"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-004-0112-5"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378540"},{"key":"e_1_3_2_2_21_1","volume-title":"Distributed minimum dominating set approximations in restricted families of graphs. Distributed computing 26, 2","author":"Lenzen Christoph","year":"2013","unstructured":"Christoph Lenzen , Yvonne-Anne Pignolet , and Roger Wattenhofer . 2013. Distributed minimum dominating set approximations in restricted families of graphs. Distributed computing 26, 2 ( 2013 ), 119--137. Christoph Lenzen, Yvonne-Anne Pignolet, and Roger Wattenhofer. 2013. Distributed minimum dominating set approximations in restricted families of graphs. Distributed computing 26, 2 (2013), 119--137."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_48"},{"key":"e_1_3_2_2_23_1","volume-title":"35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs","volume":"19","author":"Morgan Adir","year":"2021","unstructured":"Adir Morgan , Shay Solomon , and NicoleWein. 2021 . Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial . In 35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs , Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 33:1-- 33: 19 . Adir Morgan, Shay Solomon, and NicoleWein. 2021. Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial. In 35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs, Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 33:1-- 33:19."},{"volume-title":"Proc. 52nd ACM Symp. on Theory of Computing (STOC). 350--363","author":"Ghaffari V.","key":"e_1_3_2_2_24_1","unstructured":"V. Rozho? and M. Ghaffari . 2020. Polylogarithmic-time deterministic network decomposition and distributed derandomization . In Proc. 52nd ACM Symp. on Theory of Computing (STOC). 350--363 . V. Rozho? and M. Ghaffari. 2020. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In Proc. 52nd ACM Symp. on Theory of Computing (STOC). 350--363."},{"key":"e_1_3_2_2_25_1","volume-title":"An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity. In International Workshop on Approximation and Online Algorithms. Springer, 39--47","author":"Sun Hao","year":"2021","unstructured":"Hao Sun . 2021 . An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity. In International Workshop on Approximation and Online Algorithms. Springer, 39--47 . Hao Sun. 2021. An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity. In International Workshop on Approximation and Online Algorithms. Springer, 39--47."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.11.008"}],"event":{"name":"PODC '22: 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":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538437","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":26,"alternative-id":["10.1145\/3519270.3538437","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538437","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}