Erratum: generalized selection and ranking: sorted matrices

Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension

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

Cache-oblivious selection in sorted X+Y matrices

Information Processing Letters

Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension

ACM Transactions on Algorithms (TALG)

The mono- and bichromatic empty rectangle and square problems in all dimensions

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Net and prune: a linear time algorithm for euclidean distance problems

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