Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
http://drops.dagstuhl.de/opus/volltexte/2018/9012/ (出版社版)
http://drops.dagstuhl.de/doku/urheberrecht1.html (著作権譲渡合意書)
Abboud, A., & Bringmann, K. (2018). Tighter Connections Between Formula-SAT and Shaving Logs. In I., Chatzigiannakis, C., Kaklamanis, D., Marx, & D., Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (pp. 1-18). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2018.8.