BibTeX record conf/soda/0001LSSS19

download as .bib file

@inproceedings{DBLP:conf/soda/0001LSSS19,
  author    = {Fabrizio Grandoni and
               Stefano Leonardi and
               Piotr Sankowski and
               Chris Schwiegelshohn and
               Shay Solomon},
  title     = {{(1} + {\(\epsilon\)})-Approximate Incremental Matching in Constant
               Deterministic Amortized Time},
  booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  pages     = {1886--1898},
  year      = {2019},
  crossref  = {DBLP:conf/soda/2019},
  url       = {https://doi.org/10.1137/1.9781611975482.114},
  doi       = {10.1137/1.9781611975482.114},
  timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/0001LSSS19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2019,
  editor    = {Timothy M. Chan},
  title     = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  publisher = {{SIAM}},
  year      = {2019},
  url       = {https://doi.org/10.1137/1.9781611975482},
  doi       = {10.1137/1.9781611975482},
  isbn      = {978-1-61197-548-2},
  timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics