Pausinger F. Weak multipliers for generalized van der Corput sequences. Journal de Theorie des Nombres des Bordeaux. 2012;24(3):729-749. doi:10.5802/jtnb.819

Edelsbrunner H, Musin O, Ukhalov A, et al. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 2012;19(6):152-160.

Ion A, Carreira J, Sminchisescu C. Probabilistic joint image segmentation and labeling. In: NIPS Proceedings. Vol 24. Neural Information Processing Systems Foundation; 2011:1827-1835.

Sheng Y, Cutler B, Chen C, Nasman J. Perceptual global illumination cancellation in complex projection environments. Computer Graphics Forum. 2011;30(4):1261-1268. doi:10.1111/j.1467-8659.2011.01985.x

Chen C, Freedman D. Hardness results for homology localization. Discrete &; Computational Geometry. 2011;45(3):425-448. doi:10.1007/s00454-010-9322-8

Van De Weygaert R, Vegter G, Edelsbrunner H, et al. Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In: Gavrilova M, Tan K, Mostafavi M, eds. Transactions on Computational Science XIV. Vol 6970. Special Issue on Voronoi Diagrams and Delaunay Triangulation. Springer; 2011:60-101. doi:10.1007/978-3-642-25249-5_3

Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. In: Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry. ACM; 2011:187-196. doi:10.1145/1998196.1998225

Kerber M, Sagraloff M. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 2011;27(3):419-430. doi:10.1007/s00373-011-1020-7

Kerber M, Sagraloff M. Root refinement for real polynomials. In: Springer; 2011:209-216. doi:10.1145/1993886.1993920

Berberich E, Hemmer M, Kerber M. A generic algebraic kernel for non linear geometric applications. In: ACM; 2011:179-186. doi:10.1145/1998196.1998224

Edelsbrunner H, Pach J, Ziegler G. Letter from the new editors-in-chief. Discrete &; Computational Geometry. 2011;45(1):1-2. doi:10.1007/s00454-010-9313-9

Chen C, Kerber M. An output sensitive algorithm for persistent homology. In: ACM; 2011:207-216. doi:10.1145/1998196.1998228

Fasy BT. The difference in length of curves in R^n. Acta Sci Math (Szeged). 2011;77(1-2):359-367.

Edelsbrunner H, Kerber M. Covering and packing with spheres by diagonal distortion in R^n. In: Calude C, Rozenberg G, Salomaa A, eds. Rainbow of Computer Science. Vol 6570. Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Springer; 2011:20-35. doi:10.1007/978-3-642-19391-0_2

Wang B, Edelsbrunner H, Morozov D. Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. 2011;16(2.2):1-13. doi:10.1145/1963190.1970375

Wagner H, Chen C, Vuçini E. Efficient computation of persistent homology for cubical data. In: Peikert R, Hauser H, Carr H, Fuchs R, eds. Topological Methods in Data Analysis and Visualization II. Springer; 2011:91-106. doi:10.1007/978-3-642-23175-9_7

Chen C, Kerber M. Persistent homology computation with a twist. In: TU Dortmund; 2011:197-200.

Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. Detailed Reconstruction of 3D Plant Root Shape. IEEE; 2011. doi:10.1109/ICCV.2011.6126475

Chen C, Edelsbrunner H. Diffusion runs low on persistence fast. In: Proceedings of the IEEE International Conference on Computer Vision. IEEE; 2011. doi:10.1109/ICCV.2011.6126271

Edelsbrunner H. Alpha shapes - a survey. In: van de Weygaert R, Vegter G, Ritzerveld J, Icke V, eds. Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. Springer.

Edelsbrunner H, Morozov D, Patel A. Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. 2011;11(3):345-361. doi:10.1007/s10208-011-9090-8

Bendich P, Harer J. Persistent intersection homology. Foundations of Computational Mathematics. 2011;11(3):305-336. doi:10.1007/s10208-010-9081-1

Chen C, Freedman D, Lampert C. Enforcing topological constraints in random field image segmentation. In: CVPR: Computer Vision and Pattern Recognition. IEEE; 2011:2089-2096. doi:10.1109/CVPR.2011.5995503

Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. Incremental-decremental algorithm for computing AT-models and persistent homology. In: Computer Analysis of Images and Patterns. Vol 6854. Springer Nature; 2011:286-293. doi:10.1007/978-3-642-23672-3_35

Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. Graph-Based Representations in Pattern Recognition. Vol 6658. LNIP. Berlin, Heidelberg: Springer; 2011:215-224. doi:10.1007/978-3-642-20844-7_22

Chen C, Freedman D. Hardness results for homology localization. In: Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2010:1594-1604. doi:10.1137/1.9781611973075.129

Chen C, Freedman D. Topology noise removal for curve  and surface evolution. In: 10.1007/978-3-642-18421-5_4__Conference Proceedings MCV 2010. Vol 6533. Springer; 2010:31-42. doi:10.1007/978-3-642-18421-5_4

Edelsbrunner H, Morozov D, Patel A. The stability of the apparent contour of an orientable 2-manifold. In: Topological Data Analysis and Visualization: Theory, Algorithms and Applications. Springer; 2010:27-42. doi:10.1007/978-3-642-15014-2_3

Bendich P, Edelsbrunner H, Morozov D, Patel A. The robustness of level sets. In: Vol 6346. Springer; 2010:1-10. doi:10.1007/978-3-642-15775-2_1

Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-payoff automaton expressions. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:269-283. doi:10.1007/978-3-642-15375-4_19

Bendich P, Edelsbrunner H, Kerber M, Patel A. Persistent homology under non-uniform error. In: Vol 6281. Springer; 2010:12-23. doi:10.1007/978-3-642-15155-2_2

Berberich E, Halperin D, Kerber M, Pogalnikova R. Polygonal reconstruction from approximate offsets. In: TU Dortmund; 2010:12-23.

Bendich P, Edelsbrunner H, Kerber M. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 2010;16(6):1251-1260. doi:10.1109/TVCG.2010.139

Edelsbrunner H, Harer J. The persistent Morse complex segmentation of a 3-manifold. In: Vol 5903. Springer; 2009:36-50. doi:10.1007/978-3-642-10470-1_4