Elias Dahlhaus

The Complexity of Multiterminal Cuts

In the multiterminal cut problem one is given an edge-weighted graph and a subset of the vertices called terminals, and is asked for a minimum weight set of edges that separates each terminal from all the others. When the number

The complexity of multiway cuts (extended abstract)

k

Query languages for hierarchic databases

of terminals is two, this is simply the mincut, max-flow problem, and can be solved in polynomial time. It is shown that the problem becomes NP-hard as soon as

Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes

k=3

Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract)

, but can be solved in polynomial time for planar graphs for any fixed

The Computation of the Jump Number of Convex Graphs

k

Fast parallel algorithm for the single link heuristics of hierarchical clustering

. The planar problem is NP-hard, however, if

Efficient Parallel Modular Decomposition (Extended Abstract)

k

New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space

is not fixed. A simple approximation algorithm for arbitrary graphs that is guaranteed to come within a factor of

Transversal partitioning in balanced hypergraphs

2-2/k