1. P.K. Agarwal, M. van Kreveld, S. Suri: Label placement by maximum independent set in rectangles, Comput. Geom. Theory Appl., 11(118): 209–218 (1998).
2. C. Ambühl: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks, Proceedings, 32nd International Colloquium on Automata, Languages and Programming, Springer LNCS 3580: 1139–1150 (2005).
3. C. Ambühl, T. Erlebach, M. Mihalák and M. Nunkesser: Constant-approximation for minimum-weight (connected) dominating sets in unit disk graphs, Proceedings, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2006), Springer LNCS 4110: 3–14 (2006).
4. E.M. Arkin, J.S.B. Mitchell and G. Narasimhan: Resource-constructed geometric network optimization, Proceedings, 14th Annual Symposium on Computational Geometry, Minneapolis, pp.307–316, 1998.
5. S. Arora: Polynomial-time approximation schemes for Euclidean TSP and other geometric problems, Proceedings, 37th IEEE Symp. on Foundations of Computer Science, pp. 2–12, 1996.