53 citations · 112 across the 26 of their papers we have counts for
1 paper · 2 filters
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann +3
Given a set of k-colored points in the plane, we consider the problem of finding k trees such that each tree connects all points of one color class, no two trees cross, and the…