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
Cloning and expression of a rat neuromedin K receptor cDNA
R. Shigemoto, Y. Yokota, K. Tsuchida, S. Nakanishi, Journal of Biological Chemistry 265 (1990) 623–628.
View
 

1990 | Journal Article | IST-REx-ID: 2481
Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors
K. Tsuchida, R. Shigemoto, Y. Yokota, S. Nakanishi, European Journal of Biochemistry 193 (1990) 751–757.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 2528
Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells
T. Sugimoto, Y. Tanabe, R. Shigemoto, M. Iwai, T. Takumi, H. Ohkubo, S. Nakanishi, Journal of Membrane Biology 113 (1990) 39–47.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 2721
Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier
L. Erdös, D. Tuyen, Journal of Statistical Physics 59 (1990) 1589–1602.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4060
Tetrahedrizing point sets in three dimensions
H. Edelsbrunner, F. Preparata, D. West, Journal of Symbolic Computation 10 (1990) 335–347.
View | DOI | Download (ext.)
 

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

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

1990 | Journal Article | IST-REx-ID: 4065
Covering convex sets with non-overlapping polygons
H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4066
The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4067
A hyperplane Incidence problem with applications to counting distances
H. Edelsbrunner, M. Sharir, in:, Springer, 1990, pp. 419–428.
View | DOI
 

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

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

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

1990 | Conference Paper | IST-REx-ID: 4071
An O(n^2log n) time algorithm for the MinMax angle triangulation
H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, ACM, 1990, pp. 44–52.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4072
The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4073
Counting and cutting cycles of lines and rods in space
B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, in:, IEEE, 1990, pp. 242–251.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4074
Combinatorial complexity bounds for arrangements of curves and spheres
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.
View | DOI
 

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

1990 | Conference Paper | IST-REx-ID: 4076
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, ACM, 1990, pp. 203–210.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4077
Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, ACM, 1990, pp. 112–115.
View | DOI
 

Filters and Search Terms

year=1990

Search

Filter Publications