Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1993. Diameter, width, closest line pair, and parametric searching. Discrete &; Computational Geometry. 10(1), 183–196.

Lindholm D, Castrén E, Tsoulfas P, Kolbeck R, Berzaghi M, Leingärtner A, Heisenberg C-PJ, Tesarollo L, Parada L, Thoenen H. 1993. Neurotrophin-3 induced by tri-iodothyronine in cerebellar granule cells promotes Purkinje cell differentiation. Journal of Cell Biology. 122(2), 443–450.

Lindholm D, Dechant G, Heisenberg C-PJ, Thoenen H. 1993. Brain-derived neurotrophic factor is a survival factor for cultured rat cerebellar granule neurons and protects them against glutamate-induced neurotoxicity. European Journal of Neuroscience. 5(11), 1455–1464.

Henzinger TA, Manna Z, Pnueli A. 1993. Towards refining temporal specifications into hybrid systems. International Hybrid Systems Workshop. International Hybrid Systems Workshop, LNCS, vol. 736, 60–76.

Alur R, Courcoubetis C, Henzinger TA, Ho P. 1993. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. Hybrid Systems. , LNCS, vol. 736, 209–229.

Alur R, Courcoubetis C, Henzinger TA. 1993. Computing accumulated delays in real-time systems. 5th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 697, 181–193.

Abe T, Sugihara H, Nawa H, Shigemoto R, Mizuno N, Nakanishi S. 1992. Molecular characterization of a novel metabotropic glutamate receptor mGlu coupled to inositol phosphate/C+ signal transduction. Journal of Biological Chemistry. 267(19), 13361–13368.

Sasai Y, Kageyama R, Tagawa Y, Shigemoto R, Nakanishi S. 1992. Two mammalian helix-loop-helix factors structurally related to Drosophila hairy and Enhancer of split. Genes and Development. 6(12 B), 2620–2634.

Nishioka T, Oda Y, Seino Y, Yamamoto T, Inagaki N, Yano H, Imura H, Shigemoto R, Kikuchi H. 1992. Distribution of the glucose transporters in human brain tumors. Cancer Research. 52(14), 3972–3979.

Jonas PM, Sakmann B. 1992. Glutamate receptor channels in isolated patches from C and C pyramidal cells of rat hippocampal slices. Journal of Physiology. 455, 143–171.

Colquhoun D, Jonas PM, Sakmann B. 1992. Action of brief pulses of glutamate on AMPA/kainate receptors in patches from different neurones of rat hippocampal slices. Journal of Physiology. 458, 261–287.

Aronov B, Edelsbrunner H, Guibas L, Sharir M. 1992. The number of edges of many faces in a line segment arrangement. Combinatorica. 12(3), 261–274.

Burnashev N, Khodorova A, Jonas PM, Helm P, Wisden W, Monyer H, Seeburg P, Sakmann B. 1992. Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells. Science. 256(5063), 1566–1570.

Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1992. Edge insertion for optimal triangulations. 1st Latin American Symposium on Theoretical Informatics. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 583, 46–60.

Henzinger TA, Manna Z, Pnueli A. 1992. What good are digital clocks? 19th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 623, 545–558.

Za0tsev S, Sazanov LA, Koshkin A, Sud’Ina G, Varfolomeev S. 1991. Respiratory burst inhibition in human neutrophils by ultra-low doses of [D-Al] methionine enkephalinamide. FEBS Letters. 291(1), 84–86.

Masu M, Tanabe Y, Tsuchida K, Shigemoto R, Nakanishi S. 1991. Sequence and expression of a metabotropic glutamate receptor. Nature. 349(6312), 760–765.

Nakanishi S, Ohkubo H, Kakizuka A, Yokota Y, Shigemoto R, Sasai Y, Takumi T. 1991.Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel. In: Recent Progress in Hormone Research. vol. 46, 59–83.

Edelsbrunner H, Sharir M. 1991.A hyperplane incidence problem with applications to counting distances. In: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, 253–263.

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. 56(2), 312–316.

Edelsbrunner H, Seidel R, Sharir M. 1991. On the zone theorem for hyperplane arrangements. New Results and New Trends in Computer Science , LNCS, vol. 555, 108–123.

Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. 18th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 510, 661–673.

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. 6(1), 407–422.

Barton NH. 1990. Pleiotropic models of quantitative variation. Genetics. 124(3), 773–782.

Edelsbrunner H, Sharir M. 1990. A hyperplane Incidence problem with applications to counting distances. Proceedings of the International Symposium on Algorithms. SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , LNCS, vol. 450, 419–428.

Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in arrangements of planes and related problems. Discrete &; Computational Geometry. 5(1), 197–216.

Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity and construction of many faces in arrangements of lines and of segments. Discrete &; Computational Geometry. 5(1), 161–196.

Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 81(2), 153–164.

Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. 1990. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete &; Computational Geometry. 5(1), 99–160.

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990.  Euclidean minimum spanning trees and bichromatic closest pairs. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 203–210.

Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1990. Points and triangles in the plane and halving planes in space. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 112–115.

Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.

Barton NH, Clark A. 1990.Population structure and processes in evolution. In: Population biology: Ecological and evolutionary viewpoints. , 115–174.

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. 4(1), 433–466.

Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.

Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180.

Edelsbrunner H, Preparata F, West D. 1989. Tetrahedrizing point sets in three dimensions.  International Symposium on Symbolic and Algebraic Computation. ISSAC: International Symposium on Symbolic and Algebraic Computation, LNCS, vol. 358, 315–331.

Mizuno N, Ueyama T, Itoh K, Satoda T, Tashiro T, Shigemoto R. 1988. Direct projections from the subthalamic nucleus of Luys to the spinal cord in the Japanese monkey. Neuroscience Letters. 89(1), 13–18.

Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1988. Arrangements of curves in the plane - topology, combinatorics, and algorithms. 15th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 317, 214–229.

Edelsbrunner H. 1988. Geometric structures in computational geometry. 15th International Colloquium on Automata, Languages and Programming. ALP: Automata, Languages and Programming, LNCS, vol. 317, 201–213.

Chazelle B, Edelsbrunner H. 1987. Linear space data structures for two types of range search. Discrete &; Computational Geometry. 2(1), 113–126.

Edelsbrunner H. 1987. Algorithms in Combinatorial Geometry, Berlinf; Heidelberg: Springer, XV, 423p.

Barton NH, Post RJ. 1986. Sibling competition and the advantage of mixed families. Journal of Theoretical Biology. 120(4), 381–387.

Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.

Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.

Edelsbrunner H, Haussler D. 1986. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 60(C), 139–146.

Edelsbrunner H, Maurer H. 1985. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 21(1), 39–47.

Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24.

Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry. 1st Symposium of Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer ScienceSTACS, LNCS, vol. 166, 1–13.

Dobkin D, Edelsbrunner H. 1984. Ham-sandwich theorems applied to intersection problems. 9th International Workshop on Graph Theoretic Concepts in Computer Science. WG: International Workshop on Graph Theoretic Concepts in Computer ScienceWG, 88–99.

Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. 11th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceMFCS, LNCS, vol. 176, 265–272.

Edelsbrunner H, O’Rourke J, Welzl E. 1984. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing. 27(2), 167–176.

Edelsbrunner H, Maurer H. 1981. On the intersection of Orthogonal objects. Information Processing Letters. 13(4–5), 177–181.

Barton NH, Hewitt G. 1981.Hybrid zones and speciation. In: Evolution and Speciation. , 109–145.

Barton NH, Hewitt G. 1981. The genetic basis of hybrid inviability between two chromosomal races of the grasshopper Podisma pedestris. Heredity. 47(3), 367–383.

Hewitt G, Barton NH. 1980.The structure and maintenance of hybrid zones as exemplified by Podisma pedestris. In: Insect Cytogenetics. Symposia of the Royal Entomological Society, vol. 10, 149–170.