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

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

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

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

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

Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of reticular networks. PLoS One. 7(6), e36715.
LibreCat: https://research-explorer.ista.ac.at/record/3159
DOI: 10.1371/journal.pone.0036715

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

Pausinger F. 2012. Elementary solutions of the Bernstein problem on two intervals. Journal of Mathematical Physics, Analysis, Geometry. 8(1), 63–78.
LibreCat: https://research-explorer.ista.ac.at/record/6588
WoS: 000301173600004

Edelsbrunner H, Strelkova N. 2012. On the configuration space for the shortest networks. Russian Mathematical Surveys. 67(6), 1167–1168.
LibreCat: https://research-explorer.ista.ac.at/record/2912
DOI: 10.4213/rm9503

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

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/2902

Ion A, Carreira J, Sminchisescu C. 2011. Probabilistic joint image segmentation and labeling. NIPS Proceedings. NIPS: Neural Information Processing Systems vol. 24, 1827–1835.
LibreCat: https://research-explorer.ista.ac.at/record/3266

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

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/3335
DOI: 10.1007/978-3-642-25249-5_3
arXiv: 1306.3640

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

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

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

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