BibTeX record conf/stoc/SLM18

download as .bib file

@inproceedings{DBLP:conf/stoc/SLM18,
  author       = {{Karthik {C. S.}} and
                  Bundit Laekhanukit and
                  Pasin Manurangsi},
  editor       = {Ilias Diakonikolas and
                  David Kempe and
                  Monika Henzinger},
  title        = {On the parameterized complexity of approximating dominating set},
  booktitle    = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages        = {1283--1296},
  publisher    = {{ACM}},
  year         = {2018},
  url          = {https://doi.org/10.1145/3188745.3188896},
  doi          = {10.1145/3188745.3188896},
  timestamp    = {Wed, 07 Dec 2022 23:12:45 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/SLM18.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.