1. Adler, I. (2006). Width functions for hypertree decompositions. Doctoral dissertation, Albert-Ludwigs-Universität Freiburg.
2. Adler, I., Gottlob, G., Grohe, M. (2007). Hypertree width and related hypergraph invariants. European Journal of Combinatorics, 28(8), 2167–2181. doi: 10.1016/j.ejc.2007.04.013 . http://www.sciencedirect.com/science/article/pii/S0195669807000753 .
3. Aschinger, M., Drescher, C., Friedrich, G., Gottlob, G., Jeavons, P., Ryabokon, A., Thorstensen, E. (2011). Optimization methods for the partner units problem. In Proceedings of the 8th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR’11), Lecture Notes in Computer Science, (Vol. 6697 pp. 4–19). Berlin: Springer.
4. Aschinger, M., Drescher, C., Gottlob, G., Jeavons, P., Thorstensen, E. (2011). Structural decomposition methods and what they are good for. In Schwentick, T., & Dürr, C. (Eds.) Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS’11), Leibniz International Proceedings in Informatics, (Vol. 9 pp. 12–28). doi: 10.4230/LIPIcs.STACS.2011.12 . http://drops.dagstuhl.de/opus/volltexte/2011/2996 .
5. Atserias, A., Grohe, M., Marx, D. (2013). Size bounds and query plans for relational joins. SIAM Journal on Computing, 42(4), 1737–1767. doi: 10.1137/110859440 .