A space efficient solution to the frequent string mining problem for many databases. - Adrian Kügel; Enno Ohlebusch (Data Min. Knowl. Discov., 2008)

Improved Exact Solver for the Weighted MAX-SAT Problem. - Adrian Kügel (POS@SAT, 2010)

Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. - Enno Ohlebusch; Simon Gog; Adrian Kügel (SPIRE, 2010)

Average Case Complexity of Branch-and-Bound Algorithms on Random b-ary Trees. - Adrian Kügel (CTW, 2012)

Natural Max-SAT Encoding of Min-SAT. - Adrian Kügel (LION, 2012)