F. Pausinger, “Weak multipliers for generalized van der Corput sequences,” Journal de Theorie des Nombres des Bordeaux, vol. 24, no. 3. Université de Bordeaux, pp. 729–749, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2904
DOI: 10.5802/jtnb.819

H. Edelsbrunner et al., “Fractal and computational geometry for generalizing cartographic objects,” Modeling and Analysis of Information Systems, vol. 19, no. 6. Russian Academy of Sciences, pp. 152–160, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2902

A. Ion, J. Carreira, and C. Sminchisescu, “Probabilistic joint image segmentation and labeling,” in NIPS Proceedings, Granada, Spain, 2011, vol. 24, pp. 1827–1835.
LibreCat: https://research-explorer.ista.ac.at/record/3266

Y. Sheng, B. Cutler, C. Chen, and J. Nasman, “Perceptual global illumination cancellation in complex projection environments,” Computer Graphics Forum, vol. 30, no. 4. Wiley-Blackwell, pp. 1261–1268, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3269
DOI: 10.1111/j.1467-8659.2011.01985.x

C. Chen and D. Freedman, “Hardness results for homology localization,” Discrete &; Computational Geometry, vol. 45, no. 3. Springer, pp. 425–448, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3267
DOI: 10.1007/s00454-010-9322-8

R. Van De Weygaert et al., “Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web,” in Transactions on Computational Science XIV, vol. 6970, M. Gavrilova, K. Tan, and M. Mostafavi, Eds. Springer, 2011, pp. 60–101.
LibreCat: https://research-explorer.ista.ac.at/record/3335
DOI: 10.1007/978-3-642-25249-5_3
arXiv: 1306.3640

E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” in Proceedings of the twenty-seventh annual symposium on Computational geometry, Paris, France, 2011, pp. 187–196.
LibreCat: https://research-explorer.ista.ac.at/record/3329
DOI: 10.1145/1998196.1998225

M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3. Springer, pp. 419–430, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3332
DOI: 10.1007/s00373-011-1020-7

M. Kerber and M. Sagraloff, “Root refinement for real polynomials,” presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA, 2011, pp. 209–216.
LibreCat: https://research-explorer.ista.ac.at/record/3330
DOI: 10.1145/1993886.1993920
arXiv: 1104.1362

E. Berberich, M. Hemmer, and M. Kerber, “A generic algebraic kernel for non linear geometric applications,” presented at the SCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 179–186.
LibreCat: https://research-explorer.ista.ac.at/record/3328
DOI: 10.1145/1998196.1998224

H. Edelsbrunner, J. Pach, and G. Ziegler, “Letter from the new editors-in-chief,” Discrete &; Computational Geometry, vol. 45, no. 1. Springer, pp. 1–2, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3334
DOI: 10.1007/s00454-010-9313-9

C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” presented at the SoCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 207–216.
LibreCat: https://research-explorer.ista.ac.at/record/3367
DOI: 10.1145/1998196.1998228

B. T. Fasy, “The difference in length of curves in R^n,” Acta Sci. Math. (Szeged), vol. 77, no. 1–2. Szegedi Tudományegyetem, pp. 359–367, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3781

H. Edelsbrunner and M. Kerber, “Covering and packing with spheres by diagonal distortion in R^n,” in Rainbow of Computer Science, vol. 6570, C. Calude, G. Rozenberg, and A. Salomaa, Eds. Springer, 2011, pp. 20–35.
LibreCat: https://research-explorer.ista.ac.at/record/3796
DOI: 10.1007/978-3-642-19391-0_2

B. Wang, H. Edelsbrunner, and D. Morozov, “Computing elevation maxima by searching the Gauss sphere,” Journal of Experimental Algorithmics, vol. 16, no. 2.2. ACM, pp. 1–13, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3965
DOI: 10.1145/1963190.1970375

H. Wagner, C. Chen, and E. Vuçini, “Efficient computation of persistent homology for cubical data,” in Topological Methods in Data Analysis and Visualization II, R. Peikert, H. Hauser, H. Carr, and R. Fuchs, Eds. Springer, 2011, pp. 91–106.
LibreCat: https://research-explorer.ista.ac.at/record/3271
DOI: 10.1007/978-3-642-23175-9_7

C. Chen and M. Kerber, “Persistent homology computation with a twist,” presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland, 2011, pp. 197–200.
LibreCat: https://research-explorer.ista.ac.at/record/3270

Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, and P. Benfey, Detailed reconstruction of 3D plant root shape. IEEE, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3312
DOI: 10.1109/ICCV.2011.6126475

C. Chen and H. Edelsbrunner, “Diffusion runs low on persistence fast,” in Proceedings of the IEEE International Conference on Computer Vision, Barcelona, Spain, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3313
DOI: 10.1109/ICCV.2011.6126271

H. Edelsbrunner, “Alpha shapes - a survey,” in Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, R. van de Weygaert, G. Vegter, J. Ritzerveld, and V. Icke, Eds. Springer.
LibreCat: https://research-explorer.ista.ac.at/record/3311