Approximation algorithms for geometric problems

Incremental clustering and dynamic information retrieval

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Average-case ray shooting and minimum weight triangulations

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry

Approximation schemes for Euclidean k-medians and related problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Segmentation problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Point set labeling with sliding labels

Proceedings of the fourteenth annual symposium on Computational geometry

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)

Efficient algorithms for geometric optimization

ACM Computing Surveys (CSUR)

Clustering in large graphs and matrices

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

The dynamic servers problem

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Clustering for edge-cost minimization (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

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

Journal of the ACM (JACM)

Approximate clustering via core-sets

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

Projective clustering in high dimensions using core-sets

Proceedings of the eighteenth annual symposium on Computational geometry

Approximation Schemes for Geometric NP-Hard Problems: A Survey

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science

Euclidean bounded-degree spanning tree ratios

Proceedings of the nineteenth annual symposium on Computational geometry

Smooth kinetic maintenance of clusters

Proceedings of the nineteenth annual symposium on Computational geometry

Segmentation problems

Journal of the ACM (JACM)

Smooth kinetic maintenance of clusters

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003

The NP-completeness column

ACM Transactions on Algorithms (TALG)

A quasi-polynomial time approximation scheme for minimum weight triangulation

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

Minimum weight triangulation is NP-hard

Proceedings of the twenty-second annual symposium on Computational geometry

Rectangle covers revisited computationally

Journal of Experimental Algorithmics (JEA)

Minimum-weight triangulation is NP-hard

Journal of the ACM (JACM)

On clustering to minimize the sum of radii

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

A fixed parameter algorithm for optimal convex partitions

Journal of Discrete Algorithms

Packing and Covering δ-Hyperbolic Spaces by Balls

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques

A quasi-polynomial time approximation scheme for minimum weight triangulation

Journal of the ACM (JACM)

An online blog reading system by topic clustering and personalized ranking

ACM Transactions on Internet Technology (TOIT)

Approximate mechanism design without money

Proceedings of the 10th ACM conference on Electronic commerce

Efficient approximation algorithms for clustering point-sets

Computational Geometry: Theory and Applications

Smooth kinetic maintenance of clusters

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003

Linear-time approximation schemes for clustering problems in any dimensions

Journal of the ACM (JACM)

Subexponential-time algorithms for maximum independent set and related problems on box graphs

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

The 2-center problem in three dimensions

Proceedings of the twenty-sixth annual symposium on Computational geometry

Computational geometry I

Algorithms and theory of computation handbook

Clustering distributed sensor data streams using local processing and reduced communication

Intelligent Data Analysis - Ubiquitous Knowledge Discovery

Spectral Representation and Reduced Order Modeling of the Dynamics of Stochastic Reaction Networks via Adaptive Data Partitioning

SIAM Journal on Scientific Computing

Clustering with internal connectedness

WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation

Linear time algorithms for clustering problems in any dimensions

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Rectangle covers revisited computationally

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

No, coreset, no cry

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

On the competitiveness of the online asymmetric and euclidean steiner tree problems

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms

Survey: Some results of Christos Papadimitriou on internet structure, network routing, and web information

Computer Science Review

On Clustering to Minimize the Sum of Radii

SIAM Journal on Computing

Parallelism, localization and chain gradient tuning combinations for fast scalable probabilistic neural networks in data mining applications

SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications

An indication of unification for different clustering approaches

Pattern Recognition

Approximate Mechanism Design without Money

ACM Transactions on Economics and Computation