BibTeX record conf/wg/ChenCD19

download as .bib file

@inproceedings{DBLP:conf/wg/ChenCD19,
  author    = {Hubie Chen and
               Radu Curticapean and
               Holger Dell},
  title     = {The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
               Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
               2019, Revised Papers},
  pages     = {364--378},
  year      = {2019},
  crossref  = {DBLP:conf/wg/2019},
  url       = {https://doi.org/10.1007/978-3-030-30786-8\_28},
  doi       = {10.1007/978-3-030-30786-8\_28},
  timestamp = {Tue, 17 Sep 2019 13:02:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wg/ChenCD19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2019,
  editor    = {Ignasi Sau and
               Dimitrios M. Thilikos},
  title     = {Graph-Theoretic Concepts in Computer Science - 45th International
               Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
               2019, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {11789},
  publisher = {Springer},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-30786-8},
  doi       = {10.1007/978-3-030-30786-8},
  isbn      = {978-3-030-30785-1},
  timestamp = {Tue, 17 Sep 2019 12:59:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wg/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics