Cultrera di Montesano S, Edelsbrunner H, Henzinger MH, Ost L. 2024. Dynamically maintaining the persistent homology of time series. Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SODA: Symposium on Discrete Algorigthms, 243–295.

Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic alpha complexes. arXiv, 2212.03128.

Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 85, 277–295.

Koehl P, Akopyan A, Edelsbrunner H. 2023. Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives. Journal of Chemical Information and Modeling. 63(3), 973–985.

Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. 2023. On angles in higher order Brillouin tessellations and related tilings in the plane. Discrete and Computational Geometry.

Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2023. Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology.

Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2022. Continuous and discrete radius functions on Voronoi tessellations and Delaunay mosaics. Discrete and Computational Geometry. 67, 811–842.

Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. A window to the persistence of 1D maps. I: Geometric characterization of critical point pairs. LIPIcs.

Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Depth in arrangements: Dehn–Sommerville–Euler relations with applications. Leibniz International Proceedings on Mathematics.

Biswas R, Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. On the size of chromatic Delaunay mosaics. arXiv, 2212.03121.

Edelsbrunner H, Nikitenko A, Osang GF. 2021. A step in the Delaunay mosaic of order k. Journal of Geometry. 112(1), 15.

Edelsbrunner H, Heiss T,  Kurlin  V, Smith P, Wintraecken M. 2021. The density fingerprint of a periodic point set. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 189, 32:1-32:16.

Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2021. Counting cells of order-k voronoi tessellations in d<sup>3</sup> with morse theory. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 16.

Edelsbrunner H, Osang GF. 2021. The multi-cover persistence of Euclidean balls. Discrete and Computational Geometry. 65, 1296–1313.

Akopyan A, Edelsbrunner H, Nikitenko A. 2021. The beauty of random polytopes inscribed in the 2-sphere. Experimental Mathematics., 1–15.

Osang GF, Edelsbrunner H, Saadatfar M. 2021. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 17(40), 9107–9115.

Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. 2020. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. Topological Data Analysis. , Abel Symposia, vol. 15, 181–218.

Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information space. Journal of Computational Geometry. 11(2), 162–182.

Edelsbrunner H, Nikitenko A. 2020. Weighted Poisson–Delaunay mosaics. Theory of Probability and its Applications. 64(4), 595–614.

Edelsbrunner H, Ölsböck K. 2020. Tri-partitions and bases of an ordered complex. Discrete and Computational Geometry. 64, 759–775.

Akopyan A, Edelsbrunner H. 2020. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 51–67.

Akopyan A, Edelsbrunner H. 2020. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 74–88.

Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. 2020. cech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 4(4), 455–480.

Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.

Pranav P, Adler RJ, Buchert T, Edelsbrunner H, Jones BJT, Schwartzman A, Wagner H, Van De Weygaert R. 2019. Unexpected topology of the temperature fluctuations in the cosmic microwave background. Astronomy and Astrophysics. 627, 3.

Edelsbrunner H, Nikitenko A. 2019. Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. 62(4), 865–878.

Edelsbrunner H, Ölsböck K. 2019. Holes and dependences in an ordered complex. Computer Aided Geometric Design. 73, 1–15.

Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.

Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34.

Edelsbrunner H, Iglesias Ham M. 2018. Multiple covers with balls I: Inclusion–exclusion. Computational Geometry: Theory and Applications. 68, 119–133.

Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.

Edelsbrunner H, Nikitenko A. 2018. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 28(5), 3215–3238.

Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.

Edelsbrunner H, Nikitenko A, Reitzner M. 2017. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 49(3), 745–767.

Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. 2017. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 37(5), 887–910.

Bauer U, Edelsbrunner H. 2017. The Morse theory of cech and delaunay complexes. Transactions of the American Mathematical Society. 369(5), 3741–3762.

Pranav P, Edelsbrunner H, Van De Weygaert R, Vegter G, Kerber M, Jones B, Wintraecken M. 2017. The topology of the cosmic web in terms of persistent Betti numbers. Monthly Notices of the Royal Astronomical Society. 465(4), 4281–4310.

Edelsbrunner H, Koehl P. 2017.Computational topology for structural molecular biology. In: Handbook of Discrete and Computational Geometry, Third Edition. , 1709–1735.

Edelsbrunner H, Iglesias Ham M. 2016. Multiple covers with balls II: Weighted averages. Electronic Notes in Discrete Mathematics. 54, 169–174.

Dunaeva O, Edelsbrunner H, Lukyanov A, Machin M, Malkova D, Kuvaev R, Kashin S. 2016. The classification of endoscopy images with persistent homology. Pattern Recognition Letters. 83(1), 13–22.

Edelsbrunner H, Pausinger F. 2016. Approximation and convergence of the intrinsic volume. Advances in Mathematics. 287, 674–703.

Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry vol. 2015–August, 128–135.

Dunaeva O, Edelsbrunner H, Lukyanov A, Machin M, Malkova D. 2015. The classification of endoscopy images with persistent homology. Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. SYNASC: Symbolic and Numeric Algorithms for Scientific Computing, 7034731.

Edelsbrunner H. 2015. Shape, homology, persistence, and stability. 23rd International Symposium. GD: Graph Drawing and Network Visualization, LNCS, vol. 9411.

Cao T, Edelsbrunner H, Tan T. 2015. Triangulations from topologically correct digital Voronoi diagrams. Computational Geometry. 48(7), 507–519.

Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a self-map. Foundations of Computational Mathematics. 15(5), 1213–1244.

Symonova O, Topp C, Edelsbrunner H. 2015. DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. 10(6), e0127657.

Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots for the maize root shown in fig 2, Public Library of Science,10.1371/journal.pone.0127657.s001 .

Dolbilin N, Edelsbrunner H, Glazyrin A, Musin O. 2014. Functionals on triangulations of delaunay sets. Moscow Mathematical Journal. 14(3), 491–504.

Alexeev VV, Bogaevskaya VG, Preobrazhenskaya MM, Ukhalov AY, Edelsbrunner H, Yakimova O. 2014. An algorithm for cartographic generalization that preserves global topology. Journal of Mathematical Sciences. 203(6), 754–760.

Bauer U, Edelsbrunner H. 2014. The morse theory of cech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.

Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.

Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.

Edelsbrunner H. 2014. A Short Course in Computational Geometry and Topology 1st ed., Cham: Springer Nature, IX, 110p.

Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177.

Topp C, Iyer Pascuzzi A, Anderson J, Lee C, Zurek P, Symonova O, Zheng Y, Bucksch A, Mileyko Y, Galkovskyi T, Moore B, Harer J, Edelsbrunner H, Mitchell Olds T, Weitz J, Benfey P. 2013. 3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture. PNAS. 110(18), 95–04.

Edelsbrunner H, Pausinger F. 2013. Stable length estimates of tube-like shapes. 17th IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: Discrete Geometry for Computer Imagery, LNCS, vol. 7749, XV–XIX.

Bendich P, Edelsbrunner H, Morozov D, Patel A. 2013. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. 15(1), 51–72.

Fang S, Clark R, Zheng Y, Iyer Pascuzzi A, Weitz J, Kochian L, Edelsbrunner H, Liao H, Benfey P. 2013. Genotypic recognition and spatial responses by rice roots. PNAS. 110(7), 2670–2675.

Kerber M, Edelsbrunner H. 2013. 3D kinetic alpha complexes and their implementation. 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, ALENEX, , 70–77.

Edelsbrunner H, Fasy BT, Rote G. 2013. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete &; Computational Geometry. 49(4), 797–822.

Edelsbrunner H. 2013. Persistent homology in image processing. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNCS vol. 7877, 182–183.

Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. 67(6), 1167–1168.

Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image. ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, 41–48.

Edelsbrunner H, Ivanov A, Karasev R. 2012. Open problems in discrete and computational geometry. Automatic Control and Computer Sciences. in print.

Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783.

Edelsbrunner H, Kerber M. 2012. Alexander duality for functions: The persistent behavior of land and water and shore. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 249–258.

Edelsbrunner H, Fasy B, Rote G. 2012. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 91–100.

Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of dn. Discrete &; Computational Geometry. 47(2), 393–414.

Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of reticular networks. PLoS One. 7(6), e36715.

Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.

Edelsbrunner H, Strelkova N. 2012. On the configuration space for the shortest networks. Russian Mathematical Surveys. 67(6), 1167–1168.

Edelsbrunner H, Musin O, Ukhalov A, Yakimova O, Alexeev V, Bogaevskaya V, Gorohov A, Preobrazhenskaya M. 2012. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 19(6), 152–160.

Van De Weygaert R, Vegter G, Edelsbrunner H, Jones B, Pranav P, Park C, Hellwing W, Eldering B, Kruithof N, Bos P, Hidding J, Feldbrugge J, Ten Have E, Van Engelen M, Caroli M, Teillaud M. 2011.Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In: Transactions on Computational Science XIV. LNCS, vol. 6970, 60–101.

Edelsbrunner H, Pach J, Ziegler G. 2011. Letter from the new editors-in-chief. Discrete &; Computational Geometry. 45(1), 1–2.

Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.

Wang B, Edelsbrunner H, Morozov D. 2011. Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. 16(2.2), 1–13.

Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. 2011. Detailed reconstruction of 3D plant root shape, IEEE,p.

Chen C, Edelsbrunner H. 2011. Diffusion runs low on persistence fast. Proceedings of the IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision, 6126271.

Edelsbrunner H.Alpha shapes - a survey. In: Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. .

Edelsbrunner H, Morozov D, Patel A. 2011. Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. 11(3), 345–361.

Edelsbrunner H, Morozov D, Patel A. 2010.The stability of the apparent contour of an orientable 2-manifold. In: Topological Data Analysis and Visualization: Theory, Algorithms and Applications. Mathematics and Visualization, , 27–42.

Bendich P, Edelsbrunner H, Morozov D, Patel A. 2010. The robustness of level sets. ESA: European Symposium on Algorithms, LNCS, vol. 6346, 1–10.

Edelsbrunner H, Harer J. 2010. Computational Topology: An Introduction, American Mathematical Society, XII, 241p.

Cohen Steiner D, Edelsbrunner H, Harer J, Mileyko Y. 2010. Lipschitz functions have L_p-stable persistence. Foundations of Computational Mathematics. 10(2), 127–139.

Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.

Bendich P, Edelsbrunner H, Kerber M, Patel A. 2010. Persistent homology under non-uniform error. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 12–23.

Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.

Attali D, Boissonnat J, Edelsbrunner H. 2009.Stability and computation of medial axes: a state-of-the-art report. In: Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration. Mathematics and Visualization, , 109–125.

Edelsbrunner H, Harer J. 2009. The persistent Morse complex segmentation of a 3-manifold. 3DPH: Modelling the Physiological Human, LNCS, vol. 5903, 36–50.

Cohen Steiner D, Edelsbrunner H, Harer J. 2009. Extending persistence using Poincare and Lefschetz duality. Foundations of Computational Mathematics. 9(1), 79–103.

Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. 2009. Persistent homology for kernels, images, and cokernels. SODA: Symposium on Discrete Algorithms, 1011–1020.

Edelsbrunner H, Harer J, Patel A. 2008. Reeb spaces of piecewise linear mappings. SCG: Symposium on Computational Geometry, 242–250.

Biasotti S, Attali D, Boissonnat J, Edelsbrunner H, Elber G, Mortara M, Sanniti Di Baja G, Spagnuolo M, Tanase M, Veltkam R. 2008.Skeletal structures. In: Shape Analysis and Structuring. Mathematics and Visualization, , 145–183.

Dequéant M, Ahnert S, Edelsbrunner H, Fink T, Glynn E, Hattem G, Kudlicki A, Mileyko Y, Morton J, Mushegian A, Pachter L, Rowicka M, Shiu A, Sturmfels B, Pourquie O. 2008. Comparison of pattern detection methods in microarray time series of the segmentation clock. PLoS One. 3(8).

Edelsbrunner H, Harer J, Mascarenhas A, Pascucci V, Snoeyink J. 2008. Time-varying Reeb graphs for continuous space-time data. Computational Geometry: Theory and Applications. 41(3), 149–166.

Edelsbrunner H, Harer J. 2008.Persistent homology - a survey. In: Surveys on Discrete and Computational Geometry: Twenty Years Later. Contemporary Mathematics, , 257–282.

Headd J, Ban YEA, Brown P, Edelsbrunner H, Vaidya M, Rudolph J. 2007. Protein-protein interfaces: Properties, preferences, and projections. Journal of Proteome Research. 6(7), 2576–2586.

Attali D, Edelsbrunner H, Harer J, Mileyko Y. 2007. Alpha-beta witness complexes. WADS: International Workshop on Algrithms and Data Structures, LNCS, vol. 4619, 386–397.

Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. 2007. Inferring local homology from sampled stratified spaces. FOCS: Foundations of Computer Science, 536–546.

Attali D, Edelsbrunner H. 2007. Inclusion-exclusion formulas from independent complexes. Discrete &; Computational Geometry. 37(1), 59–77.

Attali D, Edelsbrunner H, Mileyko Y. 2007. Weak witnesses for Delaunay triangulations of submanifolds. SPM: Symposium on Solid and Physical Modeling, 143–150.

Cohen Steiner D, Edelsbrunner H. 2007. Inequalities for the curvature of curves and surfaces. Foundations of Computational Mathematics. 7(4), 391–404.

Cohen Steiner D, Edelsbrunner H, Harer J. 2007. Stability of persistence diagrams. Discrete &; Computational Geometry. 37(1), 103–120.

Ban Y, Rudolph J, Zhou P, Edelsbrunner H. 2006. Evaluating the quality of NMR structures by local density of protons. Proteins: Structure, Function and Bioinformatics. 62(4), 852–864.

Ban Y, Edelsbrunner H, Rudolph J. 2006. Interface surfaces for protein-protein complexes. Journal of the ACM. 53(3), 361–378.

Agarwal P, Edelsbrunner H, Harer J, Wang Y. 2006. Extreme elevation on a 2-manifold. Discrete &; Computational Geometry. 36(4), 553–572.

Edelsbrunner H, Fu P, Nekhayev D, Facello M, Williams S. 2006. Method, apparatus and computer program products for automatically generating NURBS models of triangulated surfaces using homeomorphism.

Fu P, Nekhayev D, Edelsbrunner H. 2006. Manufacturing methods and systems for rapid production of hearing-aid shells.

Fletcher Y, Gloth T, Edelsbrunner H, Fu P. 2006. Method, apparatus and computer products that reconstruct surfaces from data points.

Cohen Steiner D, Edelsbrunner H, Morozov D. 2006. Vines and vineyards by updating persistence in linear time. SCG: Symposium on Computational Geometry, 119–126.

Edelsbrunner H, Morozov D, Pascucci V. 2006. Persistence-sensitive simplification of functions on 2-manifolds. SCG: Symposium on Computational Geometry, 127–134.

Edelsbrunner H. 2005. Surface tiling with differential topology. SGP: Eurographics Symposium on Geometry processing, 9–11.

Williams S, Edelsbrunner H, Fu P. 2005. Methods, apparatus and computer program products for modeling three-dimensional colored objects.

Attali D, Cohen Steiner D, Edelsbrunner H. 2005. Extraction and simplification of iso-surfaces in tandem. SGP: Eurographics Symposium on Geometry processing, 139–148.

Edelsbrunner H, Koehl P. 2005.The geometry of biomolecular solvation. In: Combinatorial and Computational Geometry. Mathematical Sciences Research Institute Publications, vol. 52, 243–275.

Sohn J, Parks J, Buhrman G, Brown P, Kristjánsdóttir K, Safi A, Edelsbrunner H, Yang W, Rudolph J. 2005. Experimental validation of the docking orientation of Cd with its Cdk2-CycA protein substrate. Biochemistry. 44(50), 16563–16573.

Wang Y, Agarwal P, Brown P, Edelsbrunner H, Rudolph J. 2005. Coarse and reliable geometric alignment for protein docking. PSB: Pacific Symposium on Biocomputing, 64–75.

Agarwal P, Edelsbrunner H, Wang Y. 2004. Computing the writhing number of a polygonal knot. Discrete &; Computational Geometry. 32(1), 37–53.

Edelsbrunner H, Harer J. 2004.Jacobi sets of multiple Morse functions. In: Foundations of Computational Mathematics. London Mathematical Society Lecture Note, vol. 312, 37–57.

Edelsbrunner H. 2004.Biological applications of computational topology. In: Handbook of Discrete and Computational Geometry. , 1395–1412.

Choi V, Agarwal P, Edelsbrunner H, Rudolph J. 2004. Local search heuristic for rigid protein docking. WABI: 4th International Workshop on Algorithms in Bioinformatics, LNCS, vol. 3240, 218–229.

Bryant R, Edelsbrunner H, Koehl P, Levitt M. 2004. The area derivative of a space-filling diagram. Discrete &; Computational Geometry. 32(3), 293–308.

Bremer P, Edelsbrunner H, Hamann B, Pascucci V. 2004. A topological hierarchy for functions on triangulated surfaces. IEEE Transactions on Visualization and Computer Graphics. 10(4), 385–396.

Natarajan V, Edelsbrunner H. 2004. Simplification of three-dimensional density maps. IEEE Transactions on Visualization and Computer Graphics. 10(5), 587–597.

Cole Mclaughlin K, Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2004. Loops in Reeb graphs of 2-manifolds. Discrete &; Computational Geometry. 32(2), 231–244.

Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2004. Local and global comparison of continuous functions. VIS: IEEE Visualization, 275–280.

Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2003. Morse-Smale complexes for piecewise linear 3-manifolds. SCG: Symposium on Computational Geometry, 361–370.

Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space. In: Discrete &; Computational Geometry. , 379–404.

Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 5(2), 19–37.

Edelsbrunner H, Harer J, Zomorodian A. 2003. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete &; Computational Geometry. 30(1), 87–107.

Cheng H, Edelsbrunner H. 2003. Area, perimeter and derivatives of a skin curve. Computational Geometry: Theory and Applications. 26(2), 173–192.

Edelsbrunner H, Koehl P. 2003. The weighted-volume derivative of a space-filling diagram. PNAS. 100(5), 2203–2208.

Edelsbrunner H, Üngör A. 2003. Relaxed scheduling in dynamic skin triangulation. Proceedings of the Japanese Conference on Discrete and Computational Geometry . JCDCG: Japanese Conference on Discrete and Computational Geometry, LNCS, vol. 2866, 135–151.

Bremer P, Edelsbrunner H, Hamann B, Pascucci V. 2003. A multi-resolution data structure for two-dimensional Morse-Smale functions. Proceedings of the 14th IEEE Conference on Visualization . VIS: IEEE Visualization, 139–146.

Cheng H, Edelsbrunner H. 2003.Area and perimeter derivatives of a union of disks. In: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann. LNCS, vol. 2598, 88–97.

Edelsbrunner H, Fu P. 2002. Methods of generating three-dimensional digital models of objects by wrapping point cloud data points.

Agarwal P, Edelsbrunner H, Wang Y. 2002. Computing the writhing number of a polygonal knot. Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms. SODA: Symposium on Discrete Algorithms, 791–799.

Agarwal P, Guibas L, Edelsbrunner H, Erickson J, Isard M, Har Peled S, Hershberger J, Jensen C, Kavraki L, Koehl P, Lin M, Manocha D, Metaxas D, Mirtich B, Mount D, Muthukrishnan S, Pai D, Sacks E, Snoeyink J, Suri S, Wolefson O. 2002. Algorithmic issues in modeling motion. ACM Computing Surveys. 34(4), 550–572.

Zomorodian A, Edelsbrunner H. 2002. Fast software for box intersections. International Journal of Computational Geometry and Applications. 12(1–2), 143–172.

Edelsbrunner H, Guoy D. 2002. An experimental study of sliver exudation. Engineering with Computers. 18(3), 229–240.

Edelsbrunner H, Letscher D, Zomorodian A. 2002. Topological persistence and simplification. Discrete &; Computational Geometry. 28(4), 511–533.

Liang J, Edelsbrunner H. 2001. Molecular classification for property prediction.

Edelsbrunner H. 2001. Geometry and Topology for Mesh Generation, Cambridge University Press, 190p.

Cheng S, Edelsbrunner H, Fu P, Lam K. 2001. Design and analysis of planar shape deformation. Computational Geometry: Theory and Applications. 19(2–3), 205–218.

Cheng H, Edelsbrunner H, Fu P. 2001. Shape space from deformation. Computational Geometry: Theory and Applications. 19(2–3), 191–204.

Cheng H, Dey T, Edelsbrunner H, Sullivan J. 2001. Dynamic skin triangulation. Proceedings of the 12th annual ACM-SIAM symposium on Discrete algorithms. SODA: Symposium on Discrete Algorithms, 47–56.

Cheng H, Dey T, Edelsbrunner H, Sullivan J. 2001. Dynamic skin triangulation. Discrete &; Computational Geometry. 25(4), 525–568.

Edelsbrunner H. 2001. 180 wrapped tubes. Journal of Universal Computer Science. 7(5), 379–399.

Edelsbrunner H, Waupotitsch R. 2000. Adaptive simplicial grids from cross-sections of monotone complexes. International Journal of Computational Geometry and Applications. 10(3), 267–284.

Cheng S, Dey T, Edelsbrunner H, Facello M, Teng S. 2000. Sliver exudation. Journal of the ACM. 47(5), 883–904.

Edelsbrunner H, Letscher D, Zomorodian A. 2000. Topological persistance and simplification. Proceedings 41st Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 454–463.

Edelsbrunner H, Grayson D. 2000. Edgewise subdivision of a simplex. Discrete &; Computational Geometry. 24(4), 707–719.

Edelsbrunner H, Li X, Miller G, Stathopoulos A, Talmor D, Teng S, Üngör A, Walkington N. 2000. Smoothing and cleaning up slivers. Proceedings of the 32nd annual ACM symposium on Theory of computing. STOC: Symposium on the Theory of Computing, 273–277.

Edelsbrunner H. 2000. Triangulations and meshes in computational geometry. Acta Numerica. 9, 133–213.

Edelsbrunner H. 2000.Spielereien mit Kreisen und Kugeln. Zum Thema Form und Verformung. In: Zur Kunst des formalen Denkens. , 153–171.

Jiao X, Edelsbrunner H, Heath M. 1999. Mesh association: formulation and algorithms. Proceedings of the 8th International Meshing Roundtable. IMR: International Meshing Roundtable, 75–82.

Dey T, Edelsbrunner H, Guha S. 1999.Computational topology. In: Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, 109–143.

Edelsbrunner H. 1999. Deformable smooth surface design. Discrete &; Computational Geometry. 21(1), 87–115.

Dey T, Edelsbrunner H, Guha S, Nekhayev D. 1999. Topology preserving edge contraction. Publications de l’Institut Mathématique. 66, 23–45.

Edelsbrunner H, Fu P. 1998. Apparatus and method for geometric morphing.

Axen U, Edelsbrunner H. 1998.Auditory Morse analysis of triangulated manifolds. In: Mathematical Visualization. , 223–236.

Liang J, Edelsbrunner H, Fu P, Sudhakar P, Subramaniam S. 1998. Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape. Proteins: Structure, Function and Bioinformatics. 33(1), 1–17.

Edelsbrunner H. 1998.Geometry for modeling biomolecules. In: Robotics: The Algorithmic Perspective. , 265–277.

Liang J, Edelsbrunner H, Woodward C. 1998. Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design. Protein Science. 7(9), 1884–1897.

Liang J, Edelsbrunner H, Fu P, Sudhakar P, Subramaniam S. 1998. Analytical shape computation of macromolecules: II. Inaccessible cavities in proteins. Proteins: Structure, Function and Bioinformatics. 33(1), 18–29.

Edelsbrunner H, Facello M, Liang J. 1998. On the definition and the construction of pockets in macromolecules. Discrete Applied Mathematics. 88(1–3), 83–102.

Edelsbrunner H. 1998. Shape reconstruction with Delaunay complex. Proceedingsof the 3rd Latin American Symposium on Theoretical Informatics. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 1380, 119–132.

Cheng H, Edelsbrunner H, Fu P. 1998. Shape space from deformation. Proceedings of the 6th Pacific Conference on Computer Graphics and Applications. CGA: Conference on Computer Graphics and Applications , 104–113.

Edelsbrunner H, Facello M, Fu P, Qian J, Nekhayev D. 1998. Wrapping 3D scanning data. Three-Dimensional Image Capture and Applications, SPIE, vol. 3313, 148–158.

Edelsbrunner H, Valtr P, Welzl E. 1997. Cutting dense point sets in half. Discrete &; Computational Geometry. 17(3), 243–255.

Edelsbrunner H, Waupotitsch R. 1997. A combinatorial approach to cartograms. Computational Geometry: Theory and Applications. 7(5–6), 343–360.

Edelsbrunner H, Ramos E. 1997. Inclusion-exclusion complexes for pseudodisk collections. Discrete &; Computational Geometry. 17(3), 287–306.

Edelsbrunner H, Shah N. 1997. Triangulating topological spaces. International Journal of Computational Geometry &; Applications. 7(4), 365–378.

Edelsbrunner H, Fu P, Quian J. 1996. Geometric modeling in CAVE. Proceedings of the ACM Symposium on Virtual Reality Software and Technology. VRST: Symposium on Virtual Reality Software and Technology, 35-41 and-193–194.

Akkiraju N, Edelsbrunner H, Fu P, Qian J. 1996. Viewing geometric protein structures from inside a CAVE. IEEE Computer Graphics and Applications. 16(4), 58–61.

Akkiraju N, Edelsbrunner H. 1996. Triangulating the surface of a molecule. Discrete Applied Mathematics. 71(1–3), 5–22.

Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. 1996. Lines in space: Combinatorics and algorithms. Algorithmica. 15(5), 428–447.

Edelsbrunner H, Shah N. 1996. Incremental topological flipping works for regular triangulations. Algorithmica. 15(3), 223–241.

Liang J, Edelsbrunner H, Subramaniam S. 1996. Effects of molecular shape representations on boundary element method for protein electrostatics computations, Cell Press,p.

Liang J, Edelsbrunner H, Pamidghantam S, Subramaniam S. 1996. Analytical method for molecular shapes: Area, volume, cavities, interface and pockets, Cell Press,p.

Edelsbrunner H, Facello M, Fu P, Liang J. 1995. Measuring proteins and voids in proteins. Proceedings of the 28th Annual Hawaii International Conference on System Sciences. HICSS: Hawaii International Conference on System Sciences, 256–264.

Akkiraju N, Edelsbrunner H, Facello M, Fu P, Mücke E, Varela C. 1995. Alpha shapes: definition and software. GCG: International Computational Geometry Software Workshop, 63–66.

Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Sharir M, Welzl E. 1995. Improved bounds on weak ;5-nets for convex sets. Discrete &; Computational Geometry. 13(1), 1–15.

Edelsbrunner H. 1995. Algebraic decomposition of non-convex polyhedra. Proceedings of IEEE 36th Annual Foundations of Computer Science. FOCS: Foundations of Computer Science, 248–257.

Edelsbrunner H. 1995. The union of balls and its dual shape. Discrete &; Computational Geometry. 13(1), 415–440.

Delfinado C, Edelsbrunner H. 1995. An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Computer Aided Geometric Design. 12(7), 771–784.

Edelsbrunner H. 1994. Modeling with simplicial complexes (topology, geometry and algorithms). Proceedings of the 6th Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry, 36–44.

Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1994. Ray shooting in polygons using geodesic triangulations. Algorithmica. 12(1), 54–68.

Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1994. Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica. 11(2), 116–132.

Edelsbrunner H, Mücke E. 1994. Three-dimensional alpha shapes. ACM Transactions on Graphics. 13(1), 43–72.

Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1994. Selecting heavily covered points. SIAM Journal on Computing. 23(6), 1138–1151.

Dey T, Edelsbrunner H. 1994. Counting triangle crossings and halving planes. Discrete &; Computational Geometry. 12(1), 281–289.

Edelsbrunner H. 1993.Computational geometry. In: Current Trends in Theoretical Computer Science, Essays and Tutorials. , 1–48.

Edelsbrunner H. 1993.Geometric algorithms. In: Handbook of Convex Geometry. , 699–735.

Edelsbrunner H, Seidel R, Sharir M. 1993. On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. 22(2), 418–429.

Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1993. Computing a face in an arrangement of line segments and related problems. SIAM Journal on Computing. 22(6), 1286–1302.

Edelsbrunner H, Tan T. 1993. An upper bound for conforming Delaunay triangulations. Discrete &; Computational Geometry. 10(1), 197–213.

Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1993. Edge insertion for optimal triangulations. Discrete &; Computational Geometry. 10(1), 47–65.

Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1993. Diameter, width, closest line pair, and parametric searching. Discrete &; Computational Geometry. 10(1), 183–196.

Edelsbrunner H, Tan T. 1993. A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. 22(3), 527–551.

Aronov B, Edelsbrunner H, Guibas L, Sharir M. 1992. The number of edges of many faces in a line segment arrangement. Combinatorica. 12(3), 261–274.

Edelsbrunner H. 1992. Guest editor’s foreword. Discrete &; Computational Geometry. 8(1), 217–217.

Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1992. Counting and cutting cycles of lines and rods in space. Computational Geometry: Theory and Applications. 1(6), 305–323.

Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1992. Edge insertion for optimal triangulations. 1st Latin American Symposium on Theoretical Informatics. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 583, 46–60.

Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1992. Arrangements of curves in the plane - topology, combinatorics, and algorithms. Theoretical Computer Science. 92(2), 319–336.

Chazelle B, Edelsbrunner H. 1992. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. 39(1), 1–54.

Edelsbrunner H, Tan T, Waupotitsch R. 1992. An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. 13(4), 994–1008.

Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. 1992. Optimal time bounds for some proximity problems in the plane. Information Processing Letters. 42(1), 55–60.

Edelsbrunner H, Sharir M. 1991.A hyperplane incidence problem with applications to counting distances. In: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, 253–263.

Edelsbrunner H. 1991.Lines in space – A collection of results. In: Discrete &; Computational Geometry: Papers from the Dimacs Special Year. DIAMCS Series in Discrete Mathematics and Theoretical Computer Science, vol. 6, 77–93.

Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1991. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. Theoretical Computer Science. 84(1), 77–105.

Edelsbrunner H, Hajnal P. 1991. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. 56(2), 312–316.

Edelsbrunner H, Seidel R, Sharir M. 1991. On the zone theorem for hyperplane arrangements. New Results and New Trends in Computer Science , LNCS, vol. 555, 108–123.

Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1991. Computing a face in an arrangement of line segments. Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms. SODA: Symposium on Discrete Algorithms, 441–448.

Edelsbrunner H, Tan T. 1991. A quadratic time algorithm for the minmax length triangulation. 32nd Annual Symposium of Foundations of Computer Science. FOCS: Foundations of Computer Science, 414–423.

Edelsbrunner H, Shi W. 1991. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. 20(2), 259–269.

Edelsbrunner H. 1991. Corrigendum. Journal of Computer and System Sciences. 42(2), 249–251.

Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. 18th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 510, 661–673.

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. 6(1), 407–422.

Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1991. Points and triangles in the plane and halving planes in space. Discrete &; Computational Geometry. 6(1), 435–442.

Edelsbrunner H, Sharir M. 1990. A hyperplane Incidence problem with applications to counting distances. Proceedings of the International Symposium on Algorithms. SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , LNCS, vol. 450, 419–428.

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.

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.

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. 31st Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 242–251.

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.

Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 44–52.

Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2. Discrete &; Computational Geometry. 5(1), 35–42.

Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 10(3), 251–260.

Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous Robot Vehicles. , 328–341.

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.

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.

Edelsbrunner H, Preparata F, West D. 1990. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 10(3–4), 335–347.

Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 81(2), 153–164.

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.

Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1990. Slimming down by adding; selecting heavily covered points. Proceedings of the 6th annual symposium on computational geometry. SCG: Symposium on Computational Geometry, 116–127.

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990.  Euclidean minimum spanning trees and bichromatic closest pairs. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 203–210.

Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1990. Points and triangles in the plane and halving planes in space. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 112–115.

Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.

Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl E. 1989. Implicitly representing arrangements of lines or segments. Discrete &; Computational Geometry. 4(1), 433–466.

Edelsbrunner H, Guibas L. 1989. Topologically sweeping an arrangement. Journal of Computer and System Sciences. 38(1), 165–194.

Edelsbrunner H, Guibas L, Hershberger J, Pach J, Pollack R, Seidel R, Sharir M, Snoeyink J. 1989. On arrangements of Jordan arcs with three intersections per pair. Discrete &; Computational Geometry. 4(1), 523–539.

Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.

Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180.

Edelsbrunner H, Preparata F, West D. 1989. Tetrahedrizing point sets in three dimensions.  International Symposium on Symbolic and Algebraic Computation. ISSAC: International Symposium on Symbolic and Algebraic Computation, LNCS, vol. 358, 315–331.

Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. Proceedings of the 5th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 145–151.

Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &; Computational Geometry. 4(4), 337–343.

Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions. International Workshop on Discrete Algorithms and Complexity, 83–89.

Edelsbrunner H, Guibas L, Sharir M. 1989. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete &; Computational Geometry. 4(1), 311–336.

Edelsbrunner H, Hasan N, Seidel R, Shen X. 1989. Circles through two points that always enclose many points. Geometriae Dedicata. 32(1), 1–12.

Edelsbrunner H, Skiena S. 1989. On the number of furthest neighbor pairs in a point set. American Mathematical Monthly. 96(7), 614–618.

Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1989. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. 16th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 372, 179–193.

Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes. Discrete &; Computational Geometry. 4(1), 139–181.

Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1988. Arrangements of curves in the plane - topology, combinatorics, and algorithms. 15th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 317, 214–229.

Edelsbrunner H, Preparata F. 1988. Minimum polygonal separation. Information and Computation. 77(3), 218–232.

Edelsbrunner H. 1988. Geometric structures in computational geometry. 15th International Colloquium on Automata, Languages and Programming. ALP: Automata, Languages and Programming, LNCS, vol. 317, 201–213.

Edelsbrunner H, Skiena S. 1988. Probing convex polygons with X-Rays. SIAM Journal on Computing. 17(5), 870–882.

Edelsbrunner H, Overmars M. 1987. Zooming by repeated range detection. Information Processing Letters. 24(6), 413–417.

Chazelle B, Edelsbrunner H. 1987. Linear space data structures for two types of range search. Discrete &; Computational Geometry. 2(1), 113–126.

Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361.

Edelsbrunner H, Pach J, Schwartz J, Sharir M. 1987. On the lower envelope of bivariate functions and its applications. 28th Annual Symposium on Foundations of Computer Science . FOCS: Foundations of Computer Science, 27–37.

Edelsbrunner H. 1987. Algorithms in Combinatorial Geometry, Berlinf; Heidelberg: Springer, XV, 423p.

Chazelle B, Edelsbrunner H. 1987. An improved algorithm for constructing kth-order Voronoi diagrams. IEEE Transactions on Computers. 36(11), 1349–1354.

Edelsbrunner H, Shen X. 1987. A tight lower bound on the size of visibility graphs. Information Processing Letters. 26(2), 61–64.

Edelsbrunner H, O’Rourke J, Seidel R. 1986. Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. 15(2), 341–363.

Edelsbrunner H, Guibas L, Stolfi J. 1986. Optimal point location in a monotone subdivision. SIAM Journal on Computing. 15(2), 317–340.

Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.

Edelsbrunner H, Welzl E. 1986. Halfplanar range search in linear space and O(n0.695) query time. Information Processing Letters. 23(5), 289–293.

Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.

Edelsbrunner H, Jaromczyk J. 1986. How often can you see yourself in a convex configuration of mirrors? Congressus Numerantium. 53, 193–200.

Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.

Edelsbrunner H, Seidel R. 1986. Voronoi diagrams and arrangements. Discrete &; Computational Geometry. 1(1), 25–44.

Edelsbrunner H, Welzl E. 1986. Constructing belts in two-dimensional arrangements with applications. SIAM Journal on Computing. 15(1), 271–284.

Edelsbrunner H, Waupotitsch R. 1986. Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. 2(2), 171–178.

Edelsbrunner H, Haring G, Hilbert D. 1986. Rectangular point location in d-dimensions with applications. Computer Journal. 29(1), 76–82.

Edelsbrunner H, Haussler D. 1986. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 60(C), 139–146.

Edelsbrunner H, Overmars M. 1985. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. 6(4), 515–542.

Edelsbrunner H, Welzl E. 1985. On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory Series A. 38(1), 15–29.

Edelsbrunner H, Maurer H. 1985. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 21(1), 39–47.

Chazelle B, Edelsbrunner H. 1985. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. 1(1), 47–56.

Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.

Day W, Edelsbrunner H. 1985. Investigation of Proportional Link Linkage Clustering Methods. Journal of Classification. 2(2–3), 239–254.

Edelsbrunner H. 1985. Computing the extreme distances between two convex polygons. Journal of Algorithms. 6(2), 213–224.

Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24.

Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry. 1st Symposium of Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer ScienceSTACS, LNCS, vol. 166, 1–13.

Edelsbrunner H, Overmars M, Seidel R. 1984. Some methods of computational geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing. 28(1), 92–108.

Dobkin D, Edelsbrunner H. 1984. Ham-sandwich theorems applied to intersection problems. 9th International Workshop on Graph Theoretic Concepts in Computer Science. WG: International Workshop on Graph Theoretic Concepts in Computer ScienceWG, 88–99.

Edelsbrunner H, Van Leeuwen J, Ottmann T, Wood D. 1984. Computing the connected components of simple rectilinear geometrical objects in D-Space. Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications. 18(2), 171–183.

Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. 11th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceMFCS, LNCS, vol. 176, 265–272.

Edelsbrunner H, O’Rourke J, Welzl E. 1984. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing. 27(2), 167–176.

Edelsbrunner H, Welzl E. 1983. On the number of equal-sized semispaces of a set of points in the plane. International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and ProgrammingLNCS, LNCS, vol. 154, 182–187.

Aurenhammer F, Edelsbrunner H. 1983. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition. 17(2), 251–257.

Edelsbrunner H, Kirkpatrick D, Seidel R. 1983. On the shape of a set of points in the plane. IEEE Transactions on Information Theory. 29(4), 551–559.

Edelsbrunner H. 1983. A new approach to rectangle intersections part 1. International Journal of Computer Mathematics. 13(3–4), 209–219.

Edelsbrunner H. 1983. A new approach to rectangle intersections part 2. International Journal of Computer Mathematics. 13(3–4), 221–229.

Edelsbrunner H, Overmars M, Wood D. 1983.Graphics in Flatland: a case study. In: Computational Geometry: Theory and Applications.  Advances in Computing Research, vol. 1, 35–59.

Bucher W, Edelsbrunner H. 1983.On expected- and worst-case segment trees. In: Computational Geometry: Theory and Applications. Advances in Computing Research , vol. 1, 109–125.

Edelsbrunner H. 1983.Neue Entwicklungen im Bereich Datenstrukturen. In: Überblicke Informationsverarbeitung . , 55–109.

Edelsbrunner H, Maurer H, Preparata F, Rosenberg A, Welzl E, Wood D. 1982. Stabbing line segments. BIT Numerical Mathematics. 22(3), 274–281.

Edelsbrunner H, Overmars M. 1982. On the equivalence of some rectangle problems. Information Processing Letters. 14(3), 124–127.

Edelsbrunner H, Maurer H, Kirkpatrick D. 1982. Polygonal intersection searching. Information Processing Letters. 14(2), 74–79.

Edelsbrunner H, Maurer H. 1981. A space-optimal solution of general region location. Theoretical Computer Science. 16(3), 329–336.

Edelsbrunner H, Maurer H. 1981. On the intersection of Orthogonal objects. Information Processing Letters. 13(4–5), 177–181.