B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing a face in an arrangement of line segments,” in Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms, San Francisco, CA, United States of America, 1991, pp. 441–448.

H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” in 32nd Annual Symposium of Foundations of Computer Science, San Juan, PR, United States of America, 1991, pp. 414–423.

H. Edelsbrunner and W. Shi, “An O(n log^2 h) time algorithm for the three-dimensional convex hull problem,” SIAM Journal on Computing, vol. 20, no. 2. SIAM, pp. 259–269, 1991.

H. Edelsbrunner, “Corrigendum,” Journal of Computer and System Sciences, vol. 42, no. 2. Elsevier, pp. 249–251, 1991.

P. M. Jonas, D. Koh, K. Kampe, M. Hermsteiner, and W. Vogel, “ATP-sensitive and Ca-activated K channels in vertebrate axons: novel links between metabolism and excitability,” Pflügers Archivf: European Journal of Physiology, vol. 418, no. 1–2. Springer, pp. 68–73, 1991.

J. Szymura and N. H. Barton, “The genetic structure of the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata: comparisons between transects and between loci,” Evolution, vol. 45, no. 2. Wiley-Blackwell, pp. 237–261, 1991.

N. H. Barton and M. Turelli, “Natural and sexual selection on many loci,” Genetics, vol. 127, no. 1. Genetics Society of America, pp. 229–255, 1991.

N. H. Barton and S. Rouhani, “The probability of fixation of a new karyotype in a continuous population,” Evolution, vol. 45, no. 3. Wiley-Blackwell, pp. 499–517, 1991.

B. Chazelle et al., “Ray shooting in polygons using geodesic triangulations,” in 18th International Colloquium on Automata, Languages and Programming, Madrid, Spain, 1991, vol. 510, pp. 661–673.

P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” Discrete &; Computational Geometry, vol. 6, no. 1. Springer, pp. 407–422, 1991.