Sepehr Assadi, Aaron Bernstein. Towards a Unified Theory of Sparsification for Matching Problems. In Jeremy T. Fineman, Michael Mitzenmacher, editors, 2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019, January 8-9, 2019 - San Diego, CA, USA. Volume 69 of OASICS, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]
@inproceedings{AssadiB19,
title = {Towards a Unified Theory of Sparsification for Matching Problems},
author = {Sepehr Assadi and Aaron Bernstein},
year = {2019},
doi = {10.4230/OASIcs.SOSA.2019.11},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.11},
researchr = {https://researchr.org/publication/AssadiB19},
cites = {0},
citedby = {0},
booktitle = {2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019, January 8-9, 2019 - San Diego, CA, USA},
editor = {Jeremy T. Fineman and Michael Mitzenmacher},
volume = {69},
series = {OASICS},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-099-6},
}