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.

6016 Publications


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.
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.
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.
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.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner H, Sharir M. 1990. A hyperplane Incidence problem with applications to counting distances. SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , LNCS, vol. 450. 419–428.
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.
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.
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.
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. SCG: Symposium on Computational Geometry 44–52.
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.
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. FOCS: Foundations of Computer Science 242–251.
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.
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.
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. SCG: Symposium on Computational Geometry 203–210.
View | DOI
 

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

1990 | Conference Paper | IST-REx-ID: 4078
Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1990. Slimming down by adding; selecting heavily covered points. SCG: Symposium on Computational Geometry 116–127.
View | DOI
 

1990 | Book Review | IST-REx-ID: 4310
Barton NH, Jones S. 1990. The language of the genes. Nature. 346, 415–416.
View | DOI
 

1990 | Book Chapter | IST-REx-ID: 4311
Barton NH, Clark A. 1990. Population structure. Population biology: ecological and evolutionary viewpoints. 115–174.
View
 

1990 | Conference Paper | IST-REx-ID: 4510
Henzinger TA, Manna Z, Pnueli A. 1990. An interleaving model for real time. JCIT: Jerusalem Conference on Information Technology 717–730.
View | Download (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4522
Henzinger TA. 1990. Half-order modal logic: How to prove real-time properties. PODC: Principles of Distributed Computing 281–296.
View | DOI | Download (ext.)
 

Search

Filter Publications