@InProceedings{marx:LIPIcs.ICDT.2017.2,
author = {Marx, D\'{a}niel},
title = {{Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.2},
URN = {urn:nbn:de:0030-drops-70652},
doi = {10.4230/LIPIcs.ICDT.2017.2},
annote = {Keywords: Conjunctive queries, treewidth, complexity}
}