Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
http://drops.dagstuhl.de/opus/volltexte/2017/7332/ (Publisher version)
http://drops.dagstuhl.de/doku/urheberrecht1.html (Copyright transfer agreement)
Bringmann, K., & Wellnitz, P. (2017). Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. In J. Kärkkäinen, J. Radoszweski, & W. Rytter (Eds.), 28th Annual Symposium on Combinatorial Pattern Matching (pp. 1-14). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.CPM.2017.12.