BibTeX record conf/soda/AssadiB19

download as .bib file

@inproceedings{DBLP:conf/soda/AssadiB19,
  author    = {Sepehr Assadi and
               Aaron Bernstein},
  editor    = {Jeremy T. Fineman and
               Michael Mitzenmacher},
  title     = {Towards a Unified Theory of Sparsification for Matching Problems},
  booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
               2019, San Diego, CA, {USA}},
  series    = {{OASICS}},
  volume    = {69},
  pages     = {11:1--11:20},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/OASIcs.SOSA.2019.11},
  doi       = {10.4230/OASIcs.SOSA.2019.11},
  timestamp = {Thu, 11 Mar 2021 14:44:30 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/AssadiB19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics