BibTeX record conf/approx/AgrawalLM0Z18

download as .bib file

@inproceedings{DBLP:conf/approx/AgrawalLM0Z18,
  author    = {Akanksha Agrawal and
               Daniel Lokshtanov and
               Pranabendu Misra and
               Saket Saurabh and
               Meirav Zehavi},
  title     = {Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
               NJ, {USA}},
  pages     = {1:1--1:15},
  year      = {2018},
  crossref  = {DBLP:conf/approx/2018},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.1},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2018.1},
  timestamp = {Sat, 19 Oct 2019 20:22:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/AgrawalLM0Z18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2018,
  editor    = {Eric Blais and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               David Steurer},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
               NJ, {USA}},
  series    = {LIPIcs},
  volume    = {116},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-085-9},
  isbn      = {978-3-95977-085-9},
  timestamp = {Thu, 02 May 2019 17:40:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics