Author:
Bukh Boris,Matoušek Jiří,Nivasch Gabriel
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. N. Alon, A non-linear lower bound for planar epsilon-nets, in 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS’10), to appear; http://www.math.tau.ac.il/ nogaa/PDFS/epsnet3.pdf .
2. N. Alon, I. Bárány, Z. Füredi and D. J. Kleitman, Point selections and weak ɛ-nets for convex hulls, Combinatorics, Probability and Computing 1 (1992), 189–200.
3. N. Alon, G. Kalai, J. Matoušek and R. Meshulam, Transversal numbers for hypergraphs arising in geometry, Advances in Applied Mathematics 130 (2002), 2509–2514.
4. N. Alon, H. Kaplan, G. Nivasch, M. Sharir and S. Smorodinsky, Weak ɛ-nets and interval chains, Journal of the ACM 55, article 28, (2008), 32 pp.
5. N. Alon and D. Kleitman, Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem, Advances in Mathematics 96 (1992), 103–112.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Some New Results on Geometric Transversals;Discrete & Computational Geometry;2023-11-16
2. Universal sequences of lines in ℝd;Israel Journal of Mathematics;2023-09
3. Universal geometric graphs;Combinatorics, Probability and Computing;2023-05-15
4. An Improved Bound for Weak Epsilon-nets in the Plane;Journal of the ACM;2022-10-27
5. Upper bounds for stabbing simplices by a line;Discrete Applied Mathematics;2021-12