By a well known result [5] the treewidth of k-outerplanar graphs is at most 3kâˆ’1. This paper gives, besides a rigorous proof of this fact, an algorithmic implementation of the proof, i.e. it is shownâ€¦ (More)

In (k, r)-Center we are given a (possibly edge-weighted) graph and are asked to select at most k vertices (centers), so that all other vertices are at distance at most r from a center. In this paperâ€¦ (More)

In d-Scattered Set we are given an (edge-weighted) graph and are asked to select at least k vertices, so that the distance between any pair is at least d, thus generalizing Independent Set. Weâ€¦ (More)