H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of dn,” Discrete &; Computational Geometry, vol. 47, no. 2. Springer, pp. 393–414, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3256
DOI: 10.1007/s00454-011-9382-4

A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground composition into maximal cliques,” presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3265
DOI: 10.1109/ICCV.2011.6126486

E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” Discrete &; Computational Geometry, vol. 48, no. 4. Springer, pp. 964–989, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3115
DOI: 10.1007/s00454-012-9441-5
arXiv: 1109.2158

M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,”  Journal of Symbolic Computation, vol. 47, no. 3. Elsevier, pp. 239–258, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3331
DOI: 10.1016/j.jsc.2011.11.001

O. Busaryev, S. Cabello, C. Chen, T. Dey, and Y. Wang, “Annotating simplices with a homology basis and its applications,” presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland, 2012, vol. 7357, pp. 189–200.
LibreCat: https://research-explorer.ista.ac.at/record/3129
DOI: 10.1007/978-3-642-31155-0_17
arXiv: 1107.3793

Y. Mileyko, H. Edelsbrunner, C. Price, and J. Weitz, “Hierarchical ordering of reticular networks,” PLoS One, vol. 7, no. 6. Public Library of Science, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3159
DOI: 10.1371/journal.pone.0036715

P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” Pattern Recognition Letters, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3310
DOI: 10.1016/j.patrec.2011.10.007

F. Pausinger, “Elementary solutions of the Bernstein problem on two intervals,” Journal of Mathematical Physics, Analysis, Geometry, vol. 8, no. 1. B. Verkin Institute for Low Temperature Physics and Engineering, pp. 63–78, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/6588
WoS: 000301173600004

H. Edelsbrunner and N. Strelkova, “On the configuration space for the shortest networks,” Russian Mathematical Surveys, vol. 67, no. 6. Russian Academy of Sciences, pp. 1167–1168, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2912
DOI: 10.4213/rm9503

N. Quadrianto, C. Lampert, and C. Chen, “The most persistent soft-clique in a set of sampled graphs,” in Proceedings of the 29th International Conference on Machine Learning, Edinburgh, United Kingdom, 2012, pp. 211–218.
LibreCat: https://research-explorer.ista.ac.at/record/3127

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