Barton, N. H. (1992). The genetic consequences of dispersal. In N. Stenseth &; W. Lidicker (Eds.), Animal dispersal: small mammals as a model (pp. 37–60). Chapman Hall.https://doi.org/10.1007/978-94-011-2338-9_3 

Burnashev, N., Khodorova, A., Jonas, P. M., Helm, P., Wisden, W., Monyer, H.,https://doi.org/10.1126/science.1317970__Sakmann, B. (1992). Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells. Science. American Association for the Advancement of Science.https://doi.org/10.1126/science.1317970 

Edelsbrunner, H., &; Hajnal, P. (1991). A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/0097-3165(91)90042-F 

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 

Edelsbrunner, H., Guibas, L., &; Sharir, M. (1990). The complexity of many cells in arrangements of planes and related problems. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187785 

Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M., &; Welzl, E. (1990). Combinatorial complexity bounds for arrangements of curves and spheres. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187783 

Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., &; Welzl, E. (1989). Implicitly representing arrangements of lines or segments. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187742 

Jonas, P. M. (1989). Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. Springer.https://doi.org/10.1007/BF01870958 

Barton, N. H. (1988). Speciation. In A. Myers &; P. Giller (Eds.), Analytical biogeography: An integrated approach to the study of animal and plant distributions (1st ed., pp. 185–218). Springer.https://doi.org/10.1007/978-94-009-0435-4 

Edelsbrunner, H., &; Shen, X. (1987). A tight lower bound on the size of visibility graphs. Information Processing Letters. Elsevier.https://doi.org/10.1016/0020-0190(87)90038-X 

Edelsbrunner, H., &; Stöckl, G. (1986). The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/0097-3165(86)90075-0 

Edelsbrunner, H., Maurer, H., &; Kirkpatrick, D. (1982). Polygonal intersection searching. Information Processing Letters. Elsevier.https://doi.org/10.1016/0020-0190(82)90090-4