1. Agarwal, P.K., Katz, M.J., Sharir, M.: Computing depth orders for fat objects and related problems. Comput. Geom. 5(4), 187–206 (1995)
2. Alt, H., et al.: Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. Algorithmica 8(1), 391–406 (1992)
3. Aronov, B., Bar-On, G., Katz, M.J.: Resolving SINR queries in a dynamic setting. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.), 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, 9–13 July 2018, Prague, Czech Republic, volume 107 of LIPIcs, pp. 145:1–145:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
4. Ásgeirsson, E.I., Halldórsson, M.M., Tonoyan, T.: Universal framework for wireless scheduling problems. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, 10–14 July 2017, Warsaw, Poland, pp. 129:1–129:15 (2017)
5. Catanzaro, D., et al.: Max point-tolerance graphs. Discret. Appl. Math. 216, 84–97 (2017)