Showing 2017Show all
2 papers · 1 filter
cs.CG2017
How to navigate through obstacles?
Eduard Eiben, Iyad Kanj
Given a set of obstacles and two points, is there a path between the two points that does not cross more than different obstacles? This is a fundamental problem that has underg…
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…