Search dblp for Publications

export results for "Generalized hypertree decompositions: np-hardness and tractable variants"

 download as .bib file

@article{DBLP:journals/jacm/GottlobMS09,
  author       = {Georg Gottlob and
                  Zolt{\'{a}}n Mikl{\'{o}}s and
                  Thomas Schwentick},
  title        = {Generalized hypertree decompositions: NP-hardness and tractable variants},
  journal      = {J. {ACM}},
  volume       = {56},
  number       = {6},
  pages        = {30:1--30:32},
  year         = {2009},
  url          = {https://doi.org/10.1145/1568318.1568320},
  doi          = {10.1145/1568318.1568320},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/GottlobMS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/GottlobMS07,
  author       = {Georg Gottlob and
                  Zolt{\'{a}}n Mikl{\'{o}}s and
                  Thomas Schwentick},
  editor       = {Leonid Libkin},
  title        = {Generalized hypertree decompositions: np-hardness and tractable variants},
  booktitle    = {Proceedings of the Twenty-Sixth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
                  on Principles of Database Systems, June 11-13, 2007, Beijing, China},
  pages        = {13--22},
  publisher    = {{ACM}},
  year         = {2007},
  url          = {https://doi.org/10.1145/1265530.1265533},
  doi          = {10.1145/1265530.1265533},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/pods/GottlobMS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics