114
click to vote
FSTTCS
15 years 6 months ago
2007 Springer 
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
106
click to vote
FSTTCS
15 years 6 months ago
2007 Springer 
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
109
click to vote
FSTTCS
15 years 4 months ago
2007 Springer
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
105
click to vote
FSTTCS
15 years 6 months ago
2007 Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
FSTTCS
15 years 6 months ago
2007 Springer 
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
|
Software Engineering