BibTeX record conf/soda/BravermanKRW17

download as .bib file

@inproceedings{DBLP:conf/soda/BravermanKRW17,
  author    = {Mark Braverman and
               Young Kun{-}Ko and
               Aviad Rubinstein and
               Omri Weinstein},
  editor    = {Philip N. Klein},
  title     = {{ETH} Hardness for Densest-\emph{k}-Subgraph with Perfect Completeness},
  booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  pages     = {1326--1341},
  publisher = {{SIAM}},
  year      = {2017},
  url       = {https://doi.org/10.1137/1.9781611974782.86},
  doi       = {10.1137/1.9781611974782.86},
  timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/BravermanKRW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics