Scheduling Unrelated Parallel Machines Computational Results. - Burkhard Monien; Andreas Woclaw (WEA, 2006)

Scheduling unrelated parallel machines: algorithms, complexity, and performance. - Andreas Wotzlaw (2006)

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. - Martin Gairing; Burkhard Monien; Andreas Woclaw (Theor. Comput. Sci., 2007)

Towards Better Ontological Support for Recognizing Textual Entailment. - Andreas Wotzlaw (EKAW, 2010)

Generation of First-Order Expressions from a Broad Coverage HPSG Grammar. - Ravi Coote; Andreas Wotzlaw (IMCSIT, 2010)

A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. - Ewald Speckenmeyer; Andreas Wotzlaw; Stefan Porschen (SAT, 2011)

Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation. - Andreas Wotzlaw; Ewald Speckenmeyer; Stefan Porschen (Discret. Appl. Math., 2012)

A Logic-based Approach for Recognizing Textual Entailment Supported by Ontological Background Knowledge. - Andreas Wotzlaw; Ravi Coote (CoRR, 2013)

Effectiveness of pre- and inprocessing for CDCL-based SAT solving. - Andreas Wotzlaw; Alexander van der Grinten; Ewald Speckenmeyer (CoRR, 2013)

Probabilistic Analysis of Random Mixed Horn Formulas. - Andreas Wotzlaw; Ewald Speckenmeyer; Stefan Porschen (ISAIM, 2014)

On Solving the Maximum $k$-club Problem. - Andreas Wotzlaw (CoRR, 2014)

XSAT and NAE-SAT of linear CNF classes. - Stefan Porschen; Tatjana Schmidt; Ewald Speckenmeyer; Andreas Wotzlaw (Discret. Appl. Math., 2014)