Henzinger, T. A., Manna, Z., &; Pnueli, A. (1993). Towards refining temporal specifications into hybrid systems. In R. Grossman, A. Nerode, A. Ravn, &; H. Rischel (Eds.), International Hybrid Systems Workshop (Vol. 736, pp. 60–76). Springer.https://doi.org/10.1007/3-540-57318-6_24 
LibreCat: https://research-explorer.ista.ac.at/record/4506
DOI: 10.1007/3-540-57318-6_24

Alur, R., Henzinger, T. A., &; Ho, P. (1993). Automatic symbolic verification of embedded systems. In 1993 Proceedings Real-Time Systems Symposium (pp. 2–11). Raleigh, NC, United States of America: IEEE.https://doi.org/10.1109/REAL.1993.393520  
LibreCat: https://research-explorer.ista.ac.at/record/4616
DOI: 10.1109/REAL.1993.393520 

Jonas, P. M., &; Sakmann, B. (1992). Glutamate receptor channels in isolated patches from C and C pyramidal cells of rat hippocampal slices. Journal of Physiology. Wiley-Blackwell.https://doi.org/10.1113/jphysiol.1992.sp019294  
LibreCat: https://research-explorer.ista.ac.at/record/3470
DOI: 10.1113/jphysiol.1992.sp019294 
PMID: 1282929 

Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., &; Snoeyink, J. (1992). Counting and cutting cycles of lines and rods in space. Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/0925-7721(92)90009-H 
LibreCat: https://research-explorer.ista.ac.at/record/3581
DOI: 10.1016/0925-7721(92)90009-H

Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., &; Tan, T. (1992). Edge insertion for optimal triangulations. In I. Simon (Ed.), 1st Latin American Symposium on Theoretical Informatics (Vol. 583, pp. 46–60). São Paulo, Brazil: Springer.https://doi.org/10.1007/BFb0023816 
LibreCat: https://research-explorer.ista.ac.at/record/4049
DOI: 10.1007/BFb0023816

Henzinger, T. A., Nicollin, X., Sifakis, J., &; Yovine, S. (1992). Symbolic model checking for real-time systems. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (pp. 394–406). Santa Cruz, CA, United States of America: IEEE.https://doi.org/10.1109/LICS.1992.185551 
LibreCat: https://research-explorer.ista.ac.at/record/4505
DOI: 10.1109/LICS.1992.185551

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, pp. 59–83). The Endocrine Society.https://doi.org/10.1016/b978-0-12-571146-3.50007-9 
LibreCat: https://research-explorer.ista.ac.at/record/2530
DOI: 10.1016/b978-0-12-571146-3.50007-9
PMID: 2177908 

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.
LibreCat: https://research-explorer.ista.ac.at/record/4058

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 
LibreCat: https://research-explorer.ista.ac.at/record/4061
DOI: 10.1007/BF02574698

Henzinger, T. A., Manna, Z., &; Pnueli, A. (1991). Temporal proof methodologies for real-time systems. In Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (pp. 353–366). Orlando, FL, United States of America: ACM.https://doi.org/10.1145/99583.99629 
LibreCat: https://research-explorer.ista.ac.at/record/4508
DOI: 10.1145/99583.99629

Alur, R., Feder, T., &; Henzinger, T. A. (1991). The benefits of relaxing punctuality. In Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing (pp. 139–152). Montreal, Canada: ACM.https://doi.org/10.1145/227595.227602 
LibreCat: https://research-explorer.ista.ac.at/record/4621
DOI: 10.1145/227595.227602

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 
LibreCat: https://research-explorer.ista.ac.at/record/4066
DOI: 10.1007/BF02187785

Edelsbrunner, H., Guibas, L., &; Sharir, M. (1990). The complexity and construction of many faces in arrangements of lines and of segments. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187784 
LibreCat: https://research-explorer.ista.ac.at/record/4072
DOI: 10.1007/BF02187784

Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., &; Snoeyink, J. (1990). Counting and cutting cycles of lines and rods in space. In 31st Annual Symposium on Foundations of Computer Science (pp. 242–251). St. Louis, MO, United States of America: IEEE.https://doi.org/10.1109/FSCS.1990.89543 
LibreCat: https://research-explorer.ista.ac.at/record/4073
DOI: 10.1109/FSCS.1990.89543

Edelsbrunner, H., Tan, T., &; Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation. In Proceedings of the 6th annual symposium on Computational geometry (pp. 44–52). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98535 
LibreCat: https://research-explorer.ista.ac.at/record/4071
DOI: 10.1145/98524.98535

Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., &; Sharir, M. (1990). Slimming down by adding; selecting heavily covered points. In Proceedings of the 6th annual symposium on computational geometry (pp. 116–127). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98551 
LibreCat: https://research-explorer.ista.ac.at/record/4078
DOI: 10.1145/98524.98551

Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &; Welzl, E. (1990).https://doi.org/10.1145/98524.98567__Euclidean minimum spanning trees and bichromatic closest pairs. In Proceedings of the 6th annual symposium on Computational geometry (pp. 203–210). Berkeley, CA, United States: ACM.https://doi.org/10.1145/98524.98567 
LibreCat: https://research-explorer.ista.ac.at/record/4076
DOI: 10.1145/98524.98567

Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &; Wenger, R. (1990). Points and triangles in the plane and halving planes in space. In Proceedings of the 6th annual symposium on Computational geometry (pp. 112–115). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98548 
LibreCat: https://research-explorer.ista.ac.at/record/4077
DOI: 10.1145/98524.98548

Henzinger, T. A., Manna, Z., &; Pnueli, A. (1990). An interleaving model for real time. In https://doi.org/10.1109/JCIT.1990.128356__Proceedings of the 5th Jerusalem Conference on Information Technology (pp. 717–730). Jerusalem, Israel: IEEE.https://doi.org/10.1109/JCIT.1990.128356 
LibreCat: https://research-explorer.ista.ac.at/record/4510
DOI: 10.1109/JCIT.1990.128356

Henzinger, T. A. (1990). Half-order modal logic: How to prove real-time properties. In Proceedings of the 9th annual ACM symposium on Principles of distributed computing (pp. 281–296). Quebec City, Canada: ACM.https://doi.org/10.1145/93385.93429 
LibreCat: https://research-explorer.ista.ac.at/record/4522
DOI: 10.1145/93385.93429

Alur, R., &; Henzinger, T. A. (1990). Real-time logics: Complexity and expressiveness. In https://doi.org/10.1109/LICS.1990.113764__5th Annual IEEE Symposium on Logic in Computer Science (pp. 390–401). Philadelphia, PA, USA: IEEE.https://doi.org/10.1109/LICS.1990.113764 
LibreCat: https://research-explorer.ista.ac.at/record/4597
DOI: 10.1109/LICS.1990.113764

Edelsbrunner, H. (1989). An acyclicity theorem for cell complexes in d dimension. In Proceedings of the 5th annual symposium on Computational geometry (pp. 145–151). Saarbruchen, Germany: ACM.https://doi.org/10.1145/73833.73850 
LibreCat: https://research-explorer.ista.ac.at/record/4085
DOI: 10.1145/73833.73850

Alur, R., &; Henzinger, T. A. (1989). A really temporal logic. In 30th Annual Symposium on Foundations of Computer Science (pp. 164–169). Research Triangle Park, NC, USA: IEEE.https://doi.org/10.1109/SFCS.1989.63473 
LibreCat: https://research-explorer.ista.ac.at/record/4596
DOI: 10.1109/SFCS.1989.63473

Edelsbrunner, H., Guibas, L., Pach, J., Pollack, R., Seidel, R., &; Sharir, M. (1988). Arrangements of curves in the plane - topology, combinatorics, and algorithms. In 15th International Colloquium on Automata, Languages and Programming (Vol. 317, pp. 214–229). Tampere, Finland: Springer.https://doi.org/10.1007/3-540-19488-6_118 
LibreCat: https://research-explorer.ista.ac.at/record/4097
DOI: 10.1007/3-540-19488-6_118

Edelsbrunner, H. (1988). Geometric structures in computational geometry. In 15th International Colloquium on Automata, Languages and Programming (Vol. 317, pp. 201–213). Tampere, Finland: Springer.https://doi.org/10.1007/3-540-19488-6_117 
LibreCat: https://research-explorer.ista.ac.at/record/4096
DOI: 10.1007/3-540-19488-6_117

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 
LibreCat: https://research-explorer.ista.ac.at/record/4317
DOI: 10.1007/978-94-009-0435-4

Dobkin, D., &; Edelsbrunner, H. (1987). Space searching for intersecting objects. Journal of Algorithms. Academic Press.https://doi.org/10.1016/0196-6774(87)90015-0 
LibreCat: https://research-explorer.ista.ac.at/record/4102
DOI: 10.1016/0196-6774(87)90015-0

Edelsbrunner, H., Pach, J., Schwartz, J., &; Sharir, M. (1987). On the lower envelope of bivariate functions and its applications. In 28th Annual Symposium on Foundations of Computer Science  (pp. 27–37). Los Angeles, CA, USA: IEEE.https://doi.org/10.1109/SFCS.1987.44 
LibreCat: https://research-explorer.ista.ac.at/record/3514
DOI: 10.1109/SFCS.1987.44

Barton, N. H. (1986). The effects of linkage and density-dependent regulation on gene flow. Heredity. Nature Publishing Group.
LibreCat: https://research-explorer.ista.ac.at/record/3665

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 
LibreCat: https://research-explorer.ista.ac.at/record/4098
DOI: 10.1016/0097-3165(86)90075-0

Edelsbrunner, H., &; Waupotitsch, R. (1986). Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/S0747-7171(86)80020-7 
LibreCat: https://research-explorer.ista.ac.at/record/4106
DOI: 10.1016/S0747-7171(86)80020-7

Edelsbrunner, H., Haring, G., &; Hilbert, D. (1986). Rectangular point location in d-dimensions with applications. Computer Journal. Oxford University Press.https://doi.org/10.1093/comjnl/29.1.76 
LibreCat: https://research-explorer.ista.ac.at/record/4109
DOI: 10.1093/comjnl/29.1.76

Day, W., &; Edelsbrunner, H. (1984). Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. Springer.https://doi.org/10.1007/BF01890115 
LibreCat: https://research-explorer.ista.ac.at/record/4121
DOI: 10.1007/BF01890115

Edelsbrunner, H. (1984). Key-problems and key-methods in computational geometry. In 1st Symposium of Theoretical Aspects of Computer Science (Vol. 166, pp. 1–13). Paris, France: Springer.https://doi.org/10.1007/3-540-12920-0_1 
LibreCat: https://research-explorer.ista.ac.at/record/4122
DOI: 10.1007/3-540-12920-0_1

Edelsbrunner, H., &; Welzl, E. (1984). Monotone edge sequences in line arrangements and applications. In 11th International Symposium on Mathematical Foundations of Computer Science (Vol. 176, pp. 265–272). Praha, Czechoslovakia: Springer.https://doi.org/10.1007/BFb0030307 
LibreCat: https://research-explorer.ista.ac.at/record/4119
DOI: 10.1007/BFb0030307

Edelsbrunner, H., Overmars, M., &; Wood, D. (1983). Graphics in Flatland: a case study. In F. Preparata (Ed.), Computational Geometry: Theory and Applications (Vol. 1, pp. 35–59). Elsevier.
LibreCat: https://research-explorer.ista.ac.at/record/3563

Bucher, W., &; Edelsbrunner, H. (1983). On expected- and worst-case segment trees. In F. Preparata (Ed.), Computational Geometry: Theory and Applications (Vol. 1, pp. 109–125). Elsevier.
LibreCat: https://research-explorer.ista.ac.at/record/3562

Barton, N. H., &; Hewitt, G. (1983). Hybrid zones as barriers to gene flow. In G. Oxford &; D. Rollinson (Eds.), Protein polymorphism: Adaptive and taxonomic significance (Vol. 24, pp. 341–359). University of York, United Kingdom: Academic Press.
LibreCat: https://research-explorer.ista.ac.at/record/4328

Edelsbrunner, H., &; Overmars, M. (1982). On the equivalence of some rectangle problems. Information Processing Letters. Elsevier.https://doi.org/10.1016/0020-0190(82)90068-0 
LibreCat: https://research-explorer.ista.ac.at/record/4131
DOI: 10.1016/0020-0190(82)90068-0