BibTeX record conf/soda/0001S17

download as .bib file

@inproceedings{DBLP:conf/soda/0001S17,
  author       = {Yixin Cao and
                  R. B. Sandeep},
  editor       = {Philip N. Klein},
  title        = {Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  16-19},
  pages        = {875--880},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974782.55},
  doi          = {10.1137/1.9781611974782.55},
  timestamp    = {Tue, 02 Feb 2021 17:07:43 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/0001S17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.