
A Unifying Framework for Characterizing and Computing Width Measures
Algorithms for computing or approximating optimal decompositions for dec...
read it

Valued Authorization Policy Existence Problem: Theory and Experiments
Recent work has shown that many problems of satisfiability and resilienc...
read it

Integer Programming and Incidence Treedepth
Recently a strong connection has been shown between the tractability of ...
read it

EPTAS for kmeans Clustering of Affine Subspaces
We consider a generalization of the fundamental kmeans clustering for d...
read it

Extending Nearly Complete 1Planar Drawings in Polynomial Time
The problem of extending partial geometric graph representations such as...
read it

A Polynomial Kernel for Line Graph Deletion
The line graph of a graph G is the graph L(G) whose vertex set is the ed...
read it

Extending Partial 1Planar Drawings
Algorithmic extension problems of partial graph representations such as ...
read it

Manipulating Districts to Win Elections: FineGrained Complexity
Gerrymandering is a practice of manipulating district boundaries and loc...
read it

Removing Connected Obstacles in the Plane is FPT
Given two points in the plane, a set of obstacles defined by closed curv...
read it

A polynomial kernel for 3leaf power deletion
A graph G is an ℓleaf power of a tree T if V(G) is equal to the set of ...
read it

A Polynomial Kernel for PawFree Editing
For a fixed graph H, the Hfreeediting problem asks whether we can modi...
read it

On Clustering Incomplete Data
We study fundamental clustering problems for incomplete data. In this se...
read it

Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth
We develop a framework for applying treewidthbased dynamic programming ...
read it

Towards Cereceda's conjecture for planar graphs
The reconfiguration graph R_k(G) of the kcolourings of a graph G has as...
read it

Complexity of the Steiner Network Problem with Respect to the Number of Terminals
In the Directed Steiner Network problem we are given an arcweighted dig...
read it

How to navigate through obstacles?
Given a set of obstacles and two points, is there a path between the two...
read it

Small Resolution Proofs for QBF using Dependency Treewidth
In spite of the close connection between the evaluation of quantified Bo...
read it
Eduard Eiben
is this you? claim profile