S. Rouhani and N. H. Barton, “Group selection and the ‘shifting balance,’” Genetical Research, vol. 61, no. 2. Cambridge University Press, pp. 127–136, 1993.
LibreCat: https://research-explorer.ista.ac.at/record/3643
DOI: 10.1017/S0016672300031232

B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “Diameter, width, closest line pair, and parametric searching,” Discrete &; Computational Geometry, vol. 10, no. 1. Springer, pp. 183–196, 1993.
LibreCat: https://research-explorer.ista.ac.at/record/4045
DOI: 10.1007/BF02573973

H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” SIAM Journal on Computing, vol. 22, no. 3. SIAM, pp. 527–551, 1993.
LibreCat: https://research-explorer.ista.ac.at/record/4042
DOI: 10.1137/0222036 

T. A. Henzinger, Z. Manna, and A. Pnueli, “Towards refining temporal specifications into hybrid systems,” in International Hybrid Systems Workshop, 1993, vol. 736, pp. 60–76.
LibreCat: https://research-explorer.ista.ac.at/record/4506
DOI: 10.1007/3-540-57318-6_24

R. Alur, T. A. Henzinger, and P. Ho, “Automatic symbolic verification of embedded systems,” in 1993 Proceedings Real-Time Systems Symposium, Raleigh, NC, United States of America, 1993, pp. 2–11.
LibreCat: https://research-explorer.ista.ac.at/record/4616
DOI: 10.1109/REAL.1993.393520 

P. M. Jonas and B. Sakmann, “Glutamate receptor channels in isolated patches from C and C pyramidal cells of rat hippocampal slices,” Journal of Physiology, vol. 455. Wiley-Blackwell, pp. 143–171, 1992.
LibreCat: https://research-explorer.ista.ac.at/record/3470
DOI: 10.1113/jphysiol.1992.sp019294 
PMID: 1282929 

B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” Computational Geometry: Theory and Applications, vol. 1, no. 6. Elsevier, pp. 305–323, 1992.
LibreCat: https://research-explorer.ista.ac.at/record/3581
DOI: 10.1016/0925-7721(92)90009-H

M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” in 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, 1992, vol. 583, pp. 46–60.
LibreCat: https://research-explorer.ista.ac.at/record/4049
DOI: 10.1007/BFb0023816

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

S. Nakanishi et al., “Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel,” in Recent Progress in Hormone Research, vol. 46, The Endocrine Society, 1991, pp. 59–83.
LibreCat: https://research-explorer.ista.ac.at/record/2530
DOI: 10.1016/b978-0-12-571146-3.50007-9
PMID: 2177908 

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

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

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

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

H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in arrangements of planes and related problems,” Discrete &; Computational Geometry, vol. 5, no. 1. Springer, pp. 197–216, 1990.
LibreCat: https://research-explorer.ista.ac.at/record/4066
DOI: 10.1007/BF02187785

H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity and construction of many faces in arrangements of lines and of segments,” Discrete &; Computational Geometry, vol. 5, no. 1. Springer, pp. 161–196, 1990.
LibreCat: https://research-explorer.ista.ac.at/record/4072
DOI: 10.1007/BF02187784

B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” in 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, United States of America, 1990, pp. 242–251.
LibreCat: https://research-explorer.ista.ac.at/record/4073
DOI: 10.1109/FSCS.1990.89543

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

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

P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” in Proceedings of the 6th annual symposium on Computational geometry, Berkeley, CA, United States, 1990, pp. 203–210.
LibreCat: https://research-explorer.ista.ac.at/record/4076
DOI: 10.1145/98524.98567