5 citations · 12 across the 3 of their papers we have counts for
3 papers
cs.DS2014★ 3 cited
On Solving the Maximum -club Problem
Andreas Wotzlaw
Given a simple undirected graph , the maximum -club problem is to find a maximum-cardinality subset of nodes inducing a subgraph of diameter at most in . This NP-hard…
cs.CL2013★ 4 cited
A Logic-based Approach for Recognizing Textual Entailment Supported by Ontological Background Knowledge
Andreas Wotzlaw, Ravi Coote
We present the architecture and the evaluation of a new system for recognizing textual entailment (RTE). In RTE we want to identify automatically the type of a logical relation bet…
cs.LO2013★ 5 cited
Effectiveness of pre- and inprocessing for CDCL-based SAT solving
Andreas Wotzlaw, Alexander van der Grinten, Ewald Speckenmeyer
Applying pre- and inprocessing techniques to simplify CNF formulas both before and during search can considerably improve the performance of modern SAT solvers. These algorithms mo…