14 citations · 49 across the 47 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
Pavel Dvořák, Eduard Eiben, Robert Ganian +2
Integer Linear Programming (ILP) has a broad range of applications in various areas of artificial intelligence. Yet in spite of recent advances, we still lack a thorough understand…
Symmetry properties of generalized graph truncations
Eduard Eiben, Robert Jajcay, Primož Šparl
In the generalized truncation construction, one replaces each vertex of a -regular graph with a copy of a graph of order . We investigate the symmetry properties of t…