14 citations · 49 across the 47 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017
Small Resolution Proofs for QBF using Dependency Treewidth
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
In spite of the close connection between the evaluation of quantified Boolean formulas (QBF) and propositional satisfiability (SAT), tools and techniques which exploit structural p…
cs.DS2017
Lossy Kernels for Connected Dominating Set on Sparse Graphs
Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad +2
For , an -approximate (bi-)kernel is a polynomial-time algorithm that takes as input an instance of a problem and outputs an instance (of…