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

Edelsbrunner, H., &; Tan, T. (1991). A quadratic time algorithm for the minmax length triangulation. In 32nd Annual Symposium of Foundations of Computer Science (pp. 414–423). San Juan, PR, United States of America: IEEE.https://doi.org/10.1109/SFCS.1991.185400 

Edelsbrunner, H., &; Shi, W. (1991). An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0220016  

Edelsbrunner, H. (1991). Corrigendum. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/0022-0000(91)90013-U 

Jonas, P. M., Koh, D., Kampe, K., Hermsteiner, M., &; Vogel, W. (1991). ATP-sensitive and Ca-activated K channels in vertebrate axons: novel links between metabolism and excitability. Pflügers Archivf: European Journal of Physiology. Springer.https://doi.org/10.1007/BF00370453 

Szymura, J., &; Barton, N. H. (1991). The genetic structure of the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata: comparisons between transects and between loci. Evolution. Wiley-Blackwell.https://doi.org/10.1111/j.1558-5646.1991.tb04400.x 

Barton, N. H., &; Turelli, M. (1991). Natural and sexual selection on many loci. Genetics. Genetics Society of America.https://doi.org/10.1093/genetics/127.1.229 

Barton, N. H., &; Rouhani, S. (1991). The probability of fixation of a new karyotype in a continuous population. Evolution. Wiley-Blackwell.https://doi.org/10.1111/j.1558-5646.1991.tb04326.x 

Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., &; Snoeyink, J. (1991). Ray shooting in polygons using geodesic triangulations. In 18th International Colloquium on Automata, Languages and Programming (Vol. 510, pp. 661–673). Madrid, Spain: Springer.https://doi.org/10.1007/3-540-54233-7_172 

Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &; Welzl, E. (1991). Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02574698