164
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
122
Voted
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
107
Voted
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
