Author:
Dumitrescu Adrian,Jiang Minghui
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference36 articles.
1. Agarwal, P.K., Sharir, M., Shor, P.: Sharp upper and lower bounds on the length of general Davenport–Schinzel sequences. J. Comb. Theory Ser. A 52(2), 228–274 (1989)
2. Aggarwal, A., Klawe, M.: Applications of generalized matrix searching to geometric algorithms. Discrete Appl. Math. 27(1–2), 3–23 (1990)
3. Aggarwal, A., Suri, S.: Fast algorithms for computing the largest empty rectangle. In: 3rd Annual Symposium on Computational Geometry (SCG’87), pp. 278–290. ACM, New York (1987)
4. Aggarwal, A., Klawe, M.M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2(2), 195–208 (1987)
5. Aistleitner, C., Hinrichs, A., Rudolf, D.: On the size of the largest empty box amidst a point set (2015).
arXiv:1507.02067
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献