Solving d-SAT via backdoors to small treewidth
Context-free and Context-sensitive Kernels: Update and Deletion Equivalence in Abstract Argumentation
A parameterized algorithm for tree-cut width.
Monday, July 28, 2014 at 12:00
Approximate Reasoning for Description Logics based Ontologies
Monday, July 14, 2014 at 15:00
A more general approach for Backdoor Sets into SAT and CSP
A linear-time algorithm for the orbit problem over cyclic groups