@InProceedings{morgan_et_al:LIPIcs.DISC.2021.33,
author = {Morgan, Adir and Solomon, Shay and Wein, Nicole},
title = {{Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {33:1--33:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33},
URN = {urn:nbn:de:0030-drops-148353},
doi = {10.4230/LIPIcs.DISC.2021.33},
annote = {Keywords: Graph Algorithms, Dominating Set, Bounded Arboricity, Linear time algorithms}
}