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.

6122 Publications


1986 | Journal Article | IST-REx-ID: 4099
H. Edelsbrunner and E. Welzl, “Halfplanar range search in linear space and O(n0.695) query time,” Information Processing Letters, vol. 23, no. 5. Elsevier, pp. 289–293, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4103
H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces in an arrangement,” Journal of Combinatorial Theory Series A, vol. 41, no. 2. Elsevier, pp. 159–166, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4104
H. Edelsbrunner, L. Guibas, and J. Stolfi, “Optimal point location in a monotone subdivision,” SIAM Journal on Computing, vol. 15, no. 2. SIAM, pp. 317–340, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4105
H. Edelsbrunner, J. O’Rourke, and R. Seidel, “Constructing arrangements of lines and hyperplanes with applications,” SIAM Journal on Computing, vol. 15, no. 2. SIAM, pp. 341–363, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4106
H. Edelsbrunner and R. Waupotitsch, “Computing a ham-sandwich cut in two dimensions,” Journal of Symbolic Computation, vol. 2, no. 2. Elsevier, pp. 171–178, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4107
H. Edelsbrunner and D. Haussler, “The complexity of cells in 3-dimensional arrangements,” Discrete Mathematics, vol. 60, no. C. Elsevier, pp. 139–146, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4108
H. Edelsbrunner and R. Seidel, “Voronoi diagrams and arrangements,” Discrete & Computational Geometry, vol. 1, no. 1. Springer, pp. 25–44, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4109
H. Edelsbrunner, G. Haring, and D. Hilbert, “Rectangular point location in d-dimensions with applications,” Computer Journal, vol. 29, no. 1. Oxford University Press, pp. 76–82, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4110
H. Edelsbrunner and E. Welzl, “Constructing belts in two-dimensional arrangements with applications,” SIAM Journal on Computing, vol. 15, no. 1. SIAM, pp. 271–284, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4321
J. Szymura and N. H. Barton, “Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland,” Evolution; International Journal of Organic Evolution, vol. 40. Wiley-Blackwell, pp. 1141–1159, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4323
N. H. Barton and R. Post, “Sibling competition and the advantage of mixed families,” Journal of Theoretical Biology, vol. 120, no. 4. Elsevier, pp. 381–387, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4324
N. H. Barton, “The maintenance of polygenic variation through a balance between mutation and stabilising selection,” Genetical Research, vol. 47, no. 3. Cambridge University Press, pp. 209–216, 1986.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4120
B. Chazelle and H. Edelsbrunner, “Optimal solutions for a class of point retrieval problems,” Journal of Symbolic Computation, vol. 1, no. 1. Elsevier, pp. 47–56, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4111
H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and solving the post-office problem in the plane,” Information Processing Letters, vol. 21, no. 1. Elsevier, pp. 39–47, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4112
H. Edelsbrunner and M. Overmars, “Batched dynamic solutions to decomposable searching problems,” Journal of Algorithms, vol. 6, no. 4. Academic Press, pp. 515–542, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4113
H. Edelsbrunner and E. Welzl, “On the number of line separations of a finite set in the plane,” Journal of Combinatorial Theory Series A, vol. 38, no. 1. Elsevier, pp. 15–29, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4114
W. Day and H. Edelsbrunner, “Investigation of Proportional Link Linkage Clustering Methods,” Journal of Classification, vol. 2, no. 2–3. Springer, pp. 239–254, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4115
H. Edelsbrunner, “Computing the extreme distances between two convex polygons,” Journal of Algorithms, vol. 6, no. 2. Academic Press, pp. 213–224, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4116
H. Edelsbrunner, “Finding Transversals for Sets of Simple Geometric-Figures,” Theoretical Computer Science, vol. 35, no. 1. Elsevier, pp. 55–69, 1985.
View | DOI
 

1985 | Book Review | IST-REx-ID: 4325
S. Jones and N. H. Barton, “Haldane’s Rule OK,” Nature, vol. 314. Nature Publishing Group, pp. 668–668, 1985.
View | DOI
 

Search

Filter Publications