• CCCG
• 2014
Given a set of n red points and n blue points in the plane, we are interested to match the red points with the blue points by straight line segments in such a way that the segments do not cross each other and the length of the longest segment is minimized. In general, this problem in NP-hard. We give exact solutions for some special cases of the input point(More)
• J. Discrete Algorithms
• 2015
Given a weighted graph G = (V,E) and a subset R of V , a Steiner tree in G is a tree which spans all vertices in R. The vertices in V \R are called Steiner vertices. A full Steiner tree is a Steiner tree in which each vertex of R is a leaf. The full Steiner tree problem is to find a full Steiner tree with minimum weight. The bottleneck full Steiner tree(More)
• Comput. Geom.
• 2015
Let P be a set of n points in general position in the plane which is partitioned into color classes. P is said to be color-balanced if the number of points of each color is at most bn/2c. Given a color-balanced point set P , a balanced cut is a line which partitions P into two colorbalanced point sets, each of size at most 2n/3+1. A colored matching of P is(More)