1. G. Agnarsson, P. Damaschke, M.M. Halldórsson, Powers of geometric intersection graphs and dispersion algorithms, Discrete Applied Mathematics 132 (2003) (Special Issue, in: V. Lozin, D. de Werra (Eds.), Stability in Graphs and Related Topics, pp. 3–16; Preliminary version in: Proceedings of SWAT 2002, Lecture Notes in Computer Science, vol. 2368, Spring, Berlin, 2002, pp. 140–149).
2. Y.H. Chen, H.I. Lu, C.Y. Tang, Disjoint segments with maximum density, in: International Workshop on Bioinformatics Research and Applications IWBRA 2005 (within ICCS 2005), Lecture Notes in Computer Science, vol. 3515, Springer, Berlin, 2005, pp. 845–850.
3. A. Aggarwal, S. Suri, Fast algorithms for computing the largest empty rectangle, in: Symposium on Computing Geometry 1987, 1987, pp. 278–290.
4. A note on finding a maximum empty rectangle;Attalah;Discrete Appl. Math.,1986
5. Computing the largest empty rectangle;Chazelle;SIAM J. Comput.,1986