BibTeX record conf/soda/AssadiKL17

download as .bib file

@inproceedings{DBLP:conf/soda/AssadiKL17,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li},
  title     = {On Estimating Maximum Matching Size in Graph Streams},
  booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  pages     = {1723--1742},
  year      = {2017},
  crossref  = {DBLP:conf/soda/2017},
  url       = {https://doi.org/10.1137/1.9781611974782.113},
  doi       = {10.1137/1.9781611974782.113},
  timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/AssadiKL17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2017,
  editor    = {Philip N. Klein},
  title     = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  publisher = {{SIAM}},
  year      = {2017},
  url       = {https://doi.org/10.1137/1.9781611974782},
  doi       = {10.1137/1.9781611974782},
  isbn      = {978-1-61197-478-2},
  timestamp = {Wed, 26 Jan 2022 08:45:36 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/2017.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics