Author:
Agarwal Pankaj K.,Ezra Esther,Fox Kyle
Publisher
Springer International Publishing
Reference76 articles.
1. Abboud, A., Hansen, T.D., Williams, V.V., Williams, R.: Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. In: Proceedings of the 48th Annual ACM Symposium on Theory Computing, pp. 375–388 (2016)
2. Adamaszek, A., Wiese, A.: Approximation schemes for maximum weight independent set of rectangles. In: Proceedings of the 54th IEEE Annual Symposium on Foundations of Computer Science, pp. 400–409 (2013)
3. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometricapproximation via coresets. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry, pp. 1–30. Cambridge University Press, New York (2005)
4. Agarwal, P.K., Avraham, R.B., Kaplan, H., Sharir, M.: Computing the discrete fréchet distance in subquadratic time. SIAM J. Comput. 43, 429–449 (2014)
5. Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29(3), 912–953 (1999)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献