Approximation algorithms for hitting objects with straight lines
Linear Programming in Linear Time When the Dimension Is Fixed
Constructing small sample spaces satisfying given constraints
Discrete Applied Mathematics
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC ’93
Journal of the ACM
Refael Hassin
Daphne Koller
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks
Two prover protocols
A probabilistic algorithm for the post office problem