@InProceedings{solomon:LIPIcs.ITCS.2018.52,
author = {Solomon, Shay},
title = {{Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {52:1--52:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.52},
URN = {urn:nbn:de:0030-drops-83647},
doi = {10.4230/LIPIcs.ITCS.2018.52},
annote = {Keywords: arboricity, bounded degree, local algorithm, sparsifier}
}