1. Hypertree width and related hypergraph invariants;Adler;Eur. J. Comb.,2007
2. Size bounds and query plans for relational joins;Atserias;SIAM J. Comput.,2013
3. Reduction algorithms for constructing solutions in graphs with small treewidth;Bodlaender,1996
4. A negative conjunctive query is easy if and only if it is beta-acyclic;Brault-Baron,2012
5. Hypergraph acyclicity revisited;Brault-Baron;ACM Comput. Surv.,2016