Fast Stabbing of Boxes in High Dimensions

On point covers of c-oriented polygons

Theoretical Computer Science

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

Maintenance of a Percing Set for Intervals with Applications

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation

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

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications