A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari, “Optimal time bounds for some proximity problems in the plane,” Information Processing Letters, vol. 42, no. 1. Elsevier, pp. 55–60, 1992.
LibreCat: https://research-explorer.ista.ac.at/record/4048
DOI: 10.1016/0020-0190(92)90133-G

H. Edelsbrunner and M. Overmars, “Zooming by repeated range detection,” Information Processing Letters, vol. 24, no. 6. Elsevier, pp. 413–417, 1987.
LibreCat: https://research-explorer.ista.ac.at/record/4101
DOI: 10.1016/0020-0190(87)90120-7

H. Edelsbrunner and X. Shen, “A tight lower bound on the size of visibility graphs,” Information Processing Letters, vol. 26, no. 2. Elsevier, pp. 61–64, 1987.
LibreCat: https://research-explorer.ista.ac.at/record/4094
DOI: 10.1016/0020-0190(87)90038-X

H. Edelsbrunner and E. Welzl, “Halfplanar range search in linear space and O(n0.695) query time,” Information Processing Letters, vol. 23, no. 5. Elsevier, pp. 289–293, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4099
DOI: 10.1016/0020-0190(86)90088-8

H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and solving the post-office problem in the plane,” Information Processing Letters, vol. 21, no. 1. Elsevier, pp. 39–47, 1985.
LibreCat: https://research-explorer.ista.ac.at/record/4111
DOI: 10.1016/0020-0190(85)90107-3

H. Edelsbrunner and M. Overmars, “On the equivalence of some rectangle problems,” Information Processing Letters, vol. 14, no. 3. Elsevier, pp. 124–127, 1982.
LibreCat: https://research-explorer.ista.ac.at/record/4131
DOI: 10.1016/0020-0190(82)90068-0

H. Edelsbrunner, H. Maurer, and D. Kirkpatrick, “Polygonal intersection searching,” Information Processing Letters, vol. 14, no. 2. Elsevier, pp. 74–79, 1982.
LibreCat: https://research-explorer.ista.ac.at/record/4130
DOI: 10.1016/0020-0190(82)90090-4