@inproceedings{DBLP:conf/lata/CreignouKPSV17,
  added-at = {2017-12-18T13:06:47.000+0100},
  author = {Creignou, Nadia and Kr{\"{o}}ll, Markus and Pichler, Reinhard and Skritek, Sebastian and Vollmer, Heribert},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl = {https://www.bibsonomy.org/bibtex/2f1415d0cf8fd09fc35d6d773bdf33008/hvo},
  booktitle = {Language and Automata Theory and Applications - 11th International               Conference, {LATA} 2017, Ume{\aa}, Sweden, March 6-9, 2017, Proceedings},
  crossref = {DBLP:conf/lata/2017},
  description = {dblp: BibTeX record conf/lata/CreignouKPSV17},
  doi = {10.1007/978-3-319-53733-7_13},
  editor = {Drewes, Frank and Mart{\'{\i}}n{-}Vide, Carlos and Truthe, Bianca},
  interhash = {01a280874da766f44773496607040778},
  intrahash = {f1415d0cf8fd09fc35d6d773bdf33008},
  isbn = {978-3-319-53732-0},
  keywords = {myown},
  pages = {183--195},
  series = {Lecture Notes in Computer Science},
  timestamp = {2017-12-18T13:06:47.000+0100},
  title = {On the Complexity of Hard Enumeration Problems},
  url = {https://doi.org/10.1007/978-3-319-53733-7_13},
  volume = 10168,
  year = 2017
}