In communication networks based on ATM it is necessary to allocate suucient resources whenever a new connection is established. In particular, a certain amount of bandwidth must be reserved along aâ€¦ (More)

We discuss the Precoloring Extension (PrExt) and the List Coloring (LiCol) problems for trees, partial k-trees and cographs in the decision and the construction versions. Both problems for partialâ€¦ (More)

Modern high-performance communication networks pose a number of challenging problems concerning the e0cient allocation of resources to connection requests. In all-optical networks withâ€¦ (More)

We consider the following rectangle packing problem: Given a set of rectangles, each of which is associated with a profit, we are requested to pack a subset of the rectangles into a bigger rectangleâ€¦ (More)

A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk representation is given, we present polynomial-time approximation schemesâ€¦ (More)

The strip packing problem is to pack a set of rectangles into a strip of fixed width and minimum length. We present asymptotic polynomial time approximation schemes for this problem without and withâ€¦ (More)

A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk representation is given, we present polynomial-time approximation schemesâ€¦ (More)