1. Agarwal, P., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Computational Geometry: Theory and Applications 11 (1998)
2. Aumann, Y., Lewenstein, M., Melamud, O., Pinter, R.Y., Yakhini, Z.: Dotted interval graphs and high throughput genotyping. In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 339–348 (2005)
3. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)
4. Bar-Yehuda, R., Halldórsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput. 36(1), 1–15 (2006)
5. Bar-Yehuda, R., Hermelin, D., Rawitz, D.: Minimum vertex cover in rectangle graphs. Comput. Geom. 44(6-7), 356–364 (2011)