Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Sample sizes for sigmoidal neural networks
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Combinatorial optimization algorithms for radio network planning
Theoretical Computer Science
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Hitting sets when the VC-dimension is small
Information Processing Letters
Finding small balanced separators
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the twenty-fourth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Efficient Sensor Placement for Surveillance Problems
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Hitting sets when the VC-dimension is small
Information Processing Letters
A note about weak ε-nets for axis-parallel boxes in d-space
Information Processing Letters
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
A new upper bound for the VC-dimension of visibility regions
Proceedings of the twenty-seventh annual symposium on Computational geometry
Tight lower bounds for the size of epsilon-nets
Proceedings of the twenty-seventh annual symposium on Computational geometry
Polychromatic coloring for half-planes
Journal of Combinatorial Theory Series A
Towards faster linear-sized nets for axis-aligned boxes in the plane
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Polychromatic coloring for half-planes
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Piercing quasi-rectangles-On a problem of Danzer and Rogers
Journal of Combinatorial Theory Series A
A theorem of bárány revisited and extended
Proceedings of the twenty-eighth annual symposium on Computational geometry
Quasi-Monte-Carlo methods and the dispersion of point sequences
Mathematical and Computer Modelling: An International Journal
A new upper bound for the VC-dimension of visibility regions
Computational Geometry: Theory and Applications
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |