Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

5751 Publications


1990 | Journal Article | IST-REx-ID: 3467 | OA
Bräu, M., Dreyer, F., Jonas, P. M., Repp, H., & Vogel, W. (1990). A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. Journal of Physiology, 420, 365–385. https://doi.org/10.1113/jphysiol.1990.sp017918
View | DOI | Download (ext.)
 

1990 | Book Chapter | IST-REx-ID: 3565
Dobkin, D., Edelsbrunner, H., & Yap, C. (1990). Probing convex polytopes. In I. Cox & G. Wilfong (Eds.), Autonomous Robot Vehicles (pp. 328–341). Springer. https://doi.org/10.1007/978-1-4613-8997-2_25
View | DOI
 

1990 | Journal Article | IST-REx-ID: 3649
Turelli, M., & Barton, N. H. (1990). Dynamics of polygenic characters under selection. Theoretical Population Biology, 38(1), 1–57. https://doi.org/10.1016/0040-5809(90)90002-D
View | DOI
 

1990 | Journal Article | IST-REx-ID: 3650 | OA
Mallet, J., Barton, N. H., Lamas, G., Santisteban, J., Muedas, M., & Eeley, H. (1990). Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. Genetics, 124(4), 921–936.
View | Download (ext.)
 

1990 | Journal Article | IST-REx-ID: 3651 | OA
Barton, N. H. (1990). Pleiotropic models of quantitative variation. Genetics, 124(3), 773–782.
View | Download (ext.)
 

1990 | Journal Article | IST-REx-ID: 4060
Edelsbrunner, H., Preparata, F., & West, D. (1990). Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation, 10(3–4), 335–347. https://doi.org/10.1016/S0747-7171(08)80068-5
View | DOI | Download (ext.)
 

1990 | Journal Article | IST-REx-ID: 4063
Edelsbrunner, H., & Mücke, E. (1990). Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 9(1), 66–104. https://doi.org/10.1145/77635.77639
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4064
Edelsbrunner, H., & Souvaine, D. (1990). Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association, 85(409), 115–119. https://doi.org/10.1080/01621459.1990.10475313
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner, H., Robison, A., & Shen, X. (1990). Covering convex sets with non-overlapping polygons. Discrete Mathematics, 81(2), 153–164. https://doi.org/10.1016/0012-365X(90)90147-A
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4066
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. https://doi.org/10.1007/BF02187785
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner, H., & Sharir, M. (1990). A hyperplane Incidence problem with applications to counting distances (Vol. 450, pp. 419–428). Presented at the SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , Springer. https://doi.org/10.1007/3-540-52921-7_91
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner, H., & Sharir, M. (1990). The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry, 5(1), 35–42. https://doi.org/ 10.1007/BF02187778
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner, H. (1990). An acyclicity theorem for cell complexes in d dimension. Combinatorica, 10(3), 251–260. https://doi.org/10.1007/BF02122779
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner, H., Overmars, M., Welzl, E., Hartman, I., & Feldman, J. (1990). Ranking intervals under visibility constraints. International Journal of Computer Mathematics, 34(3–4), 129–144. https://doi.org/10.1080/00207169008803871
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner, H., Tan, T., & Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation (pp. 44–52). Presented at the SCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/98524.98535
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4072
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. https://doi.org/ 10.1007/BF02187784
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4073
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 (pp. 242–251). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FSCS.1990.89543
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4074
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. https://doi.org/10.1007/BF02187783
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4075
Dobkin, D., Edelsbrunner, H., & Overmars, M. (1990). Searching for empty convex polygons. Algorithmica, 5(4), 561–571. https://doi.org/10.1007/BF01840404
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., & Welzl, E. (1990). Euclidean minimum spanning trees and bichromatic closest pairs (pp. 203–210). Presented at the SCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/98524.98567
View | DOI
 

Search

Filter Publications