Dual complexes of cubical subdivisions of dn
H. Edelsbrunner, M. Kerber, Discrete &; Computational Geometry 47 (2012) 393–414.

Image segmentation by figure-ground composition into maximal cliques
A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012.

Deconstructing approximate offsets
E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, Discrete &; Computational Geometry 48 (2012) 964–989.

A worst case bound for topology computation of algebraic curves
M. Kerber, M. Sagraloff,  Journal of Symbolic Computation 47 (2012) 239–258.

Annotating simplices with a homology basis and its applications
O. Busaryev, S. Cabello, C. Chen, T. Dey, Y. Wang, in:, Springer, 2012, pp. 189–200.

Hierarchical ordering of reticular networks
Y. Mileyko, H. Edelsbrunner, C. Price, J. Weitz, PLoS One 7 (2012).

A point calculus for interlevel set homology
P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012) 1436–1444.

Elementary solutions of the Bernstein problem on two intervals
F. Pausinger, Journal of Mathematical Physics, Analysis, Geometry 8 (2012) 63–78.

On the configuration space for the shortest networks
H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.

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

Weak multipliers for generalized van der Corput sequences
F. Pausinger, Journal de Theorie Des Nombres Des Bordeaux 24 (2012) 729–749.

Fractal and computational geometry for generalizing cartographic objects
H. Edelsbrunner, O. Musin, A. Ukhalov, O. Yakimova, V. Alexeev, V. Bogaevskaya, A. Gorohov, M. Preobrazhenskaya, Modeling and Analysis of Information Systems 19 (2012) 152–160.

Probabilistic joint image segmentation and labeling
A. Ion, J. Carreira, C. Sminchisescu, in:, NIPS Proceedings, Neural Information Processing Systems Foundation, 2011, pp. 1827–1835.

Perceptual global illumination cancellation in complex projection environments
Y. Sheng, B. Cutler, C. Chen, J. Nasman, Computer Graphics Forum 30 (2011) 1261–1268.

Hardness results for homology localization
C. Chen, D. Freedman, Discrete &; Computational Geometry 45 (2011) 425–448.

Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web
R. Van De Weygaert, G. Vegter, H. Edelsbrunner, B. Jones, P. Pranav, C. Park, W. Hellwing, B. Eldering, N. Kruithof, P. Bos, J. Hidding, J. Feldbrugge, E. Ten Have, M. Van Engelen, M. Caroli, M. Teillaud, in:, M. Gavrilova, K. Tan, M. Mostafavi (Eds.), Transactions on Computational Science XIV, Springer, 2011, pp. 60–101.

Deconstructing approximate offsets
E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–196.

A note on the complexity of real algebraic hypersurfaces
M. Kerber, M. Sagraloff, Graphs and Combinatorics 27 (2011) 419–430.

Root refinement for real polynomials
M. Kerber, M. Sagraloff, in:, Springer, 2011, pp. 209–216.

A generic algebraic kernel for non linear geometric applications
E. Berberich, M. Hemmer, M. Kerber, in:, ACM, 2011, pp. 179–186.