Edelsbrunner, H., &; Kerber, M. (2012). Dual complexes of cubical subdivisions of dn. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-011-9382-4 

Ion, A., Carreira, J., &; Sminchisescu, C. (2012). Image segmentation by figure-ground composition into maximal cliques. Presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126486 

Berberich, E., Halperin, D., Kerber, M., &; Pogalnikova, R. (2012). Deconstructing approximate offsets. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-012-9441-5 

Kerber, M., &; Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. https://doi.org/10.1016/j.jsc.2011.11.001__Journal of Symbolic Computation. Elsevier.https://doi.org/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 (Vol. 7357, pp. 189–200). Presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland: Springer.https://doi.org/10.1007/978-3-642-31155-0_17 

Mileyko, Y., Edelsbrunner, H., Price, C., &; Weitz, J. (2012). Hierarchical ordering of reticular networks. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0036715 

Bendich, P., Cabello, S., &; Edelsbrunner, H. (2012). A point calculus for interlevel set homology. Pattern Recognition Letters. Elsevier.https://doi.org/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. B. Verkin Institute for Low Temperature Physics and Engineering.

Edelsbrunner, H., &; Strelkova, N. (2012). On the configuration space for the shortest networks. Russian Mathematical Surveys. Russian Academy of Sciences.https://doi.org/10.4213/rm9503 

Quadrianto, N., Lampert, C., &; Chen, C. (2012). The most persistent soft-clique in a set of sampled graphs. In Proceedings of the 29th International Conference on Machine Learning (pp. 211–218). Edinburgh, United Kingdom: ML Research Press.

Pausinger, F. (2012). Weak multipliers for generalized van der Corput sequences. Journal de Theorie Des Nombres Des Bordeaux. Université de Bordeaux.https://doi.org/10.5802/jtnb.819 

Edelsbrunner, H., Musin, O., Ukhalov, A., Yakimova, O., Alexeev, V., Bogaevskaya, V.,  Preobrazhenskaya, M. (2012). Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. Russian Academy of Sciences.

Ion, A., Carreira, J., &; Sminchisescu, C. (2011). Probabilistic joint image segmentation and labeling. In NIPS Proceedings (Vol. 24, pp. 1827–1835). Granada, Spain: Neural Information Processing Systems Foundation.

Sheng, Y., Cutler, B., Chen, C., &; Nasman, J. (2011). Perceptual global illumination cancellation in complex projection environments. Computer Graphics Forum. Wiley-Blackwell.https://doi.org/10.1111/j.1467-8659.2011.01985.x 

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

Van De Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B., Pranav, P., Park, C.,https://doi.org/10.1007/978-3-642-25249-5_3__Teillaud, M. (2011). Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In M. Gavrilova, K. Tan, &; M. Mostafavi (Eds.), Transactions on Computational Science XIV (Vol. 6970, pp. 60–101). Springer.https://doi.org/10.1007/978-3-642-25249-5_3 

Berberich, E., Halperin, D., Kerber, M., &; Pogalnikova, R. (2011). Deconstructing approximate offsets. In Proceedings of the twenty-seventh annual symposium on Computational geometry (pp. 187–196). Paris, France: ACM.https://doi.org/10.1145/1998196.1998225 

Kerber, M., &; Sagraloff, M. (2011). A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. Springer.https://doi.org/10.1007/s00373-011-1020-7 

Kerber, M., &; Sagraloff, M. (2011). Root refinement for real polynomials (pp. 209–216). Presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA: Springer.https://doi.org/10.1145/1993886.1993920 

Berberich, E., Hemmer, M., &; Kerber, M. (2011). A generic algebraic kernel for non linear geometric applications (pp. 179–186). Presented at the SCG: Symposium on Computational Geometry, Paris, France: ACM.https://doi.org/10.1145/1998196.1998224