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.

31 Publications


1990 | Journal Article | IST-REx-ID: 2480
Shigemoto, Ryuichi, et al. “Cloning and Expression of a Rat Neuromedin K Receptor CDNA.” Journal of Biological Chemistry, vol. 265, no. 2, American Society for Biochemistry and Molecular Biology, 1990, pp. 623–28.
View
 

1990 | Journal Article | IST-REx-ID: 2481
Tsuchida, Kunihiro, et al. “Tissue Distribution and Quantitation of the MRNAs for Three Rat Tachykinin Receptors.” European Journal of Biochemistry, vol. 193, no. 3, Wiley-Blackwell, 1990, pp. 751–57, doi:10.1111/j.1432-1033.1990.tb19396.x.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 2528
Sugimoto, Tetsuo, et al. “Immunohistochemical Study of a Rat Membrane Protein Which Induces a Selective Potassium Permeation: Its Localization in the Apical Membrane Portion of Epithelial Cells.” Journal of Membrane Biology, vol. 113, no. 1, Springer, 1990, pp. 39–47, doi:10.1007/BF01869604.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4060
Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:10.1016/S0747-7171(08)80068-5.
View | DOI | Download (ext.)
 

1990 | Journal Article | IST-REx-ID: 4063
Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” ACM Transactions on Graphics, vol. 9, no. 1, ACM, 1990, pp. 66–104, doi:10.1145/77635.77639.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4064
Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.” Journal of the American Statistical Association, vol. 85, no. 409, American Statistical Association, 1990, pp. 115–19, doi:10.1080/01621459.1990.10475313.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.” Discrete Mathematics, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:10.1016/0012-365X(90)90147-A.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner, Herbert, and Micha Sharir. A Hyperplane Incidence Problem with Applications to Counting Distances. Vol. 450, Springer, 1990, pp. 419–28, doi:10.1007/3-540-52921-7_91.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi: 10.1007/BF02187778.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” Combinatorica, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi:10.1007/BF02122779.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor & Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner, Herbert, et al. An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation. ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi: 10.1007/BF02187784.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4073
Chazelle, Bernard, et al. Counting and Cutting Cycles of Lines and Rods in Space. IEEE, 1990, pp. 242–51, doi:10.1109/FSCS.1990.89543.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4074
Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4075
Dobkin, David, et al. “Searching for Empty Convex Polygons.” Algorithmica, vol. 5, no. 4, Springer, 1990, pp. 561–71, doi:10.1007/BF01840404.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, Pankaj, et al. Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4077
Aronov, Boris, et al. Points and Triangles in the Plane and Halving Planes in Space. ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4078
Chazelle, Bernard, et al. Slimming down by Adding; Selecting Heavily Covered Points. ACM, 1990, pp. 116–27, doi:10.1145/98524.98551.
View | DOI
 

Filters and Search Terms

year=1990

Search

Filter Publications