BibTeX record conf/lata/CreignouKPSV17

download as .bib file

@inproceedings{DBLP:conf/lata/CreignouKPSV17,
  author    = {Nadia Creignou and
               Markus Kr{\"{o}}ll and
               Reinhard Pichler and
               Sebastian Skritek and
               Heribert Vollmer},
  title     = {On the Complexity of Hard Enumeration Problems},
  booktitle = {Language and Automata Theory and Applications - 11th International
               Conference, {LATA} 2017, Ume{\aa}, Sweden, March 6-9, 2017, Proceedings},
  pages     = {183--195},
  year      = {2017},
  crossref  = {DBLP:conf/lata/2017},
  url       = {https://doi.org/10.1007/978-3-319-53733-7\_13},
  doi       = {10.1007/978-3-319-53733-7\_13},
  timestamp = {Mon, 16 Sep 2019 15:27:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lata/CreignouKPSV17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/lata/2017,
  editor    = {Frank Drewes and
               Carlos Mart{\'{\i}}n{-}Vide and
               Bianca Truthe},
  title     = {Language and Automata Theory and Applications - 11th International
               Conference, {LATA} 2017, Ume{\aa}, Sweden, March 6-9, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10168},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-53733-7},
  doi       = {10.1007/978-3-319-53733-7},
  isbn      = {978-3-319-53732-0},
  timestamp = {Mon, 16 Sep 2019 15:27:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lata/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics