On two segmentation problems

Polynomial-time approximation schemes for geometric min-sum median clustering

Journal of the ACM (JACM)

Approximation schemes for clustering problems

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Segmentation problems

Journal of the ACM (JACM)

Upper bound for the approximation ratio of a class of hypercube segmentation algorithms

Information Processing Letters

Self-improving algorithms

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Upper bound for the approximation ratio of a class of hypercube segmentation algorithms

Information Processing Letters

Universal ε-approximators for integrals

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Data reduction for weighted and outlier-resistant clustering

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

On the complexity of several haplotyping problems

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics