Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.”10.5802/jtnb.819__Journal de Theorie Des Nombres Des Bordeaux, vol. 24, no. 3, Université de Bordeaux, 2012, pp. 729–49, doi:10.5802/jtnb.819.

Edelsbrunner, Herbert, et al. “Fractal and computational geometry for generalizing cartographic objects.” Modeling and Analysis of Information Systems, vol. 19, no. 6, Russian Academy of Sciences, 2012, pp. 152–60.

Ion, Adrian, et al. “Probabilistic Joint Image Segmentation and Labeling.” NIPS Proceedings, vol. 24, Neural Information Processing Systems Foundation, 2011, pp. 1827–35.

Sheng, Yu, et al. “Perceptual Global Illumination Cancellation in Complex Projection Environments.”10.1111/j.1467-8659.2011.01985.x__Computer Graphics Forum, vol. 30, no. 4, Wiley-Blackwell, 2011, pp. 1261–68, doi:10.1111/j.1467-8659.2011.01985.x.

Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.”10.1007/s00454-010-9322-8__Discrete &; Computational Geometry, vol. 45, no. 3, Springer, 2011, pp. 425–48, doi:10.1007/s00454-010-9322-8.

Van De Weygaert, Rien, et al. “Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.”10.1007/978-3-642-25249-5_3__Transactions on Computational Science XIV, edited by Marina Gavrilova et al., vol. 6970, Springer, 2011, pp. 60–101, doi:10.1007/978-3-642-25249-5_3.

Berberich, Eric, et al. “Deconstructing Approximate Offsets.”10.1145/1998196.1998225__Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–96, doi:10.1145/1998196.1998225.

Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.”10.1007/s00373-011-1020-7__Graphs and Combinatorics, vol. 27, no. 3, Springer, 2011, pp. 419–30, doi:10.1007/s00373-011-1020-7.

Kerber, Michael, and Michael Sagraloff. Root Refinement for Real Polynomials. Springer, 2011, pp. 209–16, doi:10.1145/1993886.1993920.

Berberich, Eric, et al. A Generic Algebraic Kernel for Non Linear Geometric Applications. ACM, 2011, pp. 179–86, doi:10.1145/1998196.1998224.

Edelsbrunner, Herbert, et al. “Letter from the New Editors-in-Chief.”10.1007/s00454-010-9313-9__Discrete &; Computational Geometry, vol. 45, no. 1, Springer, 2011, pp. 1–2, doi:10.1007/s00454-010-9313-9.

Chen, Chao, and Michael Kerber. An Output Sensitive Algorithm for Persistent Homology. ACM, 2011, pp. 207–16, doi:10.1145/1998196.1998228.

Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” Acta Sci. Math. (Szeged), vol. 77, no. 1–2, Szegedi Tudományegyetem, 2011, pp. 359–67.

Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres by Diagonal Distortion in R^n.”10.1007/978-3-642-19391-0_2__Rainbow of Computer Science, edited by Cristian Calude et al., vol. 6570, Springer, 2011, pp. 20–35, doi:10.1007/978-3-642-19391-0_2.

Wang, Bei, et al. “Computing Elevation Maxima by Searching the Gauss Sphere.”10.1145/1963190.1970375__Journal of Experimental Algorithmics, vol. 16, no. 2.2, ACM, 2011, pp. 1–13, doi:10.1145/1963190.1970375.

Wagner, Hubert, et al. “Efficient Computation of Persistent Homology for Cubical Data.”10.1007/978-3-642-23175-9_7__Topological Methods in Data Analysis and Visualization II, edited by Ronald Peikert et al., Springer, 2011, pp. 91–106, doi:10.1007/978-3-642-23175-9_7.

Chen, Chao, and Michael Kerber. Persistent Homology Computation with a Twist. TU Dortmund, 2011, pp. 197–200.

Zheng, Ying, et al. “Detailed Reconstruction of 3D Plant Root Shape.”10.1109/ICCV.2011.6126475__Proceedings of the IEEE International Conference on Computer Vision, 6126475, IEEE, 2011, doi:10.1109/ICCV.2011.6126475.

Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.”10.1109/ICCV.2011.6126271__Proceedings of the IEEE International Conference on Computer Vision, 6126271, IEEE, 2011, doi:10.1109/ICCV.2011.6126271.

Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, edited by R van de Weygaert et al., Springer.