Please note that ISTA 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.

1832 Publications


1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, Pankaj, et al. “ Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4077
Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.
View | DOI | Download None (ext.)
 

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 | Download None (ext.)
 

1990 | Book Chapter | IST-REx-ID: 4311
Barton, Nicholas H., and A. Clark. “Population Structure and Processes in Evolution.” Population Biology: Ecological and Evolutionary Viewpoints, edited by Klaus Wöhrmann and Subodh Jain, Springer, 1990, pp. 115–74, doi:10.1007/978-3-642-74474-7_5.
View | DOI | Download None (ext.)
 

1989 | Journal Article | IST-REx-ID: 4088 | OA
Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4083 | OA
Yao, F., et al. “Partitioning Space for Range Queries.” SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4084 | OA
Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:10.1016/0304-3975(89)90133-3.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” International Symposium on Symbolic and Algebraic Computation, vol. 358, Springer, 1989, pp. 315–31, doi:10.1007/3-540-51084-2_31.
View | DOI | Download None (ext.)
 

1989 | Journal Article | IST-REx-ID: 3465
Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve Fibers.” Journal of Membrane Biology, vol. 112, no. 3, Springer, 1989, pp. 277–89, doi:10.1007/BF01870958.
View | DOI | Download None (ext.) | PubMed | Europe PMC
 

1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner, Herbert, et al. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” 15th International Colloquium on Automata, Languages and Programming, vol. 317, Springer, 1988, pp. 214–29, doi:10.1007/3-540-19488-6_118.
View | DOI | Download None (ext.)
 

1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner, Herbert. “Geometric Structures in Computational Geometry.” 15th International Colloquium on Automata, Languages and Programming, vol. 317, Springer, 1988, pp. 201–13, doi:10.1007/3-540-19488-6_117.
View | DOI | Download None (ext.)
 

1988 | Journal Article | IST-REx-ID: 4091
Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.” SIAM Journal on Computing, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:10.1137/0217054 .
View | DOI | Download None (ext.)
 

1988 | Book Chapter | IST-REx-ID: 4317
Barton, Nicholas H. “Speciation.” Analytical Biogeography: An Integrated Approach to the Study of Animal and Plant Distributions, edited by Alan Myers and Paul Giller, 1st ed., Springer, 1988, pp. 185–218, doi:10.1007/978-94-009-0435-4.
View | DOI | Download None (ext.)
 

1987 | Journal Article | IST-REx-ID: 4100
Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.” Discrete & Computational Geometry, vol. 2, no. 1, Springer, 1987, pp. 113–26, doi:10.1007/BF02187875.
View | DOI
 

1987 | Book | IST-REx-ID: 3900
Edelsbrunner, Herbert. Algorithms in Combinatorial Geometry. Vol. 10, Springer, 1987, doi:10.1007/978-3-642-61568-9.
View | Files available | DOI
 

1986 | Journal Article | IST-REx-ID: 4104
Edelsbrunner, Herbert, et al. “Optimal Point Location in a Monotone Subdivision.” SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 317–40, doi:10.1137/0215023.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4103 | OA
Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” Journal of Combinatorial Theory Series A, vol. 41, no. 2, Elsevier, 1986, pp. 159–66, doi:10.1016/0097-3165(86)90078-6.
[Published Version] View | DOI | Download Published Version (ext.)
 

1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” Algorithmica, vol. 1, no. 1–4, Springer, 1986, pp. 93–109, doi:10.1007/BF01840438.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4098 | OA
Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” Journal of Combinatorial Theory Series A, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi:10.1016/0097-3165(86)90075-0.
View | DOI | Download None (ext.)
 

1986 | Journal Article | IST-REx-ID: 4107
Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” Discrete Mathematics, vol. 60, no. C, Elsevier, 1986, pp. 139–46, doi:10.1016/0012-365X(86)90008-7.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4112
Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” Journal of Algorithms, vol. 6, no. 4, Elsevier, 1985, pp. 515–42, doi:10.1016/0196-6774(85)90030-6.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4111
Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” Information Processing Letters, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi:10.1016/0020-0190(85)90107-3.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4120 | OA
Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” Journal of Symbolic Computation, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi:10.1016/S0747-7171(85)80028-6.
[Published Version] View | DOI | Download Published Version (ext.)
 

1984 | Journal Article | IST-REx-ID: 4121
Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” Journal of Classification, vol. 1, Springer, 1984, pp. 7–24, doi:10.1007/BF01890115.
View | DOI | Download None (ext.)
 

1984 | Conference Paper | IST-REx-ID: 4122
Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.” 1st Symposium of Theoretical Aspects of Computer Science, vol. 166, Springer, 1984, pp. 1–13, doi:10.1007/3-540-12920-0_1.
View | DOI
 

1984 | Conference Paper | IST-REx-ID: 3513
Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems.” 9th International Workshop on Graph Theoretic Concepts in Computer Science, Teubner, 1984, pp. 88–99.
View | Download None (ext.)
 

1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications.” 11th International Symposium on Mathematical Foundations of Computer Science, vol. 176, Springer, 1984, pp. 265–72, doi:10.1007/BFb0030307.
View | DOI
 

1983 | Book Chapter | IST-REx-ID: 3563
Edelsbrunner, Herbert, et al. “Graphics in Flatland: A Case Study.” Computational Geometry: Theory and Applications, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 35–59.
View
 

1983 | Book Review | IST-REx-ID: 4329
Barton, Nicholas H. “The Extended Phenotype: The Gene as the Unit of Selection (Review of Dawkins R 1982).” Animal Behaviour, vol. 31, no. 2, Elsevier, 1983, pp. 626–27, doi:10.1016/S0003-3472(83)80100-6.
View | DOI
 

1981 | Journal Article | IST-REx-ID: 4132 | OA
Edelsbrunner, Herbert, and Hermann Maurer. “On the Intersection of Orthogonal Objects.” Information Processing Letters, vol. 13, no. 4–5, Elsevier, 1981, pp. 177–81, doi:10.1016/0020-0190(81)90053-3.
[Published Version] View | DOI | Download Published Version (ext.)
 

1981 | Book Chapter | IST-REx-ID: 4332
Barton, Nicholas H., and Godfrey Hewitt. “Hybrid Zones and Speciation.” Evolution and Speciation, edited by William Atchley and David Woodruff, Cambridge University Press, 1981, pp. 109–45.
View | Files available
 

1981 | Journal Article | IST-REx-ID: 4333 | OA
Barton, Nicholas H., and Godfrey Hewitt. “The Genetic Basis of Hybrid Inviability between Two Chromosomal Races of the Grasshopper Podisma Pedestris.” Heredity, vol. 47, no. 3, Springer Nature, 1981, pp. 367–83, doi:10.1038/hdy.1981.98.
[Published Version] View | DOI | Download Published Version (ext.)
 

Filters and Search Terms

isbn%3D978-3-030-00150-6

Search

Filter Publications