1. Afshani, P., Berglin, E., van Duijn, I., Nielsen, J.: Applications of incidence bounds in point covering problems. In Proc. 32nd International Symposium on Computational Geometry (SoCG 2016). 60, 1-60:15, (2016)
2. Alman, J., Yu, H.: Faster update time for turnstile streaming algorithms. In Proc. 31st Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA 20). pp. 1803-1813, (2020)
3. Alman, J., Mnich, M., Williams, V.V.: Dynamic parameteried problems and algorithms. In Proc. 44th International Colloquium on Automata, Languages and Programming (ICALP 2017). 41, 41:1-41:16 (2017)
4. Ben-Or, M.: Lower bounds for algebraic computation trees. In Proc. 15th ACM Symposium on Theory of Computing (STOC 1983), pp. 80-86, (1983)
5. Chan, T., Nekrich, Y.: Towards an optimal method for dynamic planar point location. SIAM J. Comput. 47, 2337–2361 (2018)