Adir Morgan, Shay Solomon, Nicole Wein. Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial. In Seth Gilbert, editor, 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference). Volume 209 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{MorganSW21,
title = {Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial},
author = {Adir Morgan and Shay Solomon and Nicole Wein},
year = {2021},
doi = {10.4230/LIPIcs.DISC.2021.33},
url = {https://doi.org/10.4230/LIPIcs.DISC.2021.33},
researchr = {https://researchr.org/publication/MorganSW21},
cites = {0},
citedby = {0},
booktitle = {35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference)},
editor = {Seth Gilbert},
volume = {209},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-210-5},
}