Detailed reconstruction of 3D plant root shape
Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, P. Benfey, Detailed Reconstruction of 3D Plant Root Shape, IEEE, 2011.

Diffusion runs low on persistence fast
C. Chen, H. Edelsbrunner, in:, Proceedings of the IEEE International Conference on Computer Vision, IEEE, 2011.

Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).

Specification-centered robustness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–185.

How the cslowd Ca(2+) buffer parvalbumin affects transmitter release in nanodomain coupling regimes at GABAergic synapses
E. Eggermann, P.M. Jonas, Nature Neuroscience 15 (2011) 20–22.

Learning multi-view neighborhood preserving projections
N. Quadrianto, C. Lampert, in:, ML Research Press, 2011, pp. 425–432.

Structured learning and prediction in computer vision
S. Nowozin, C. Lampert, Foundations and Trends in Computer Graphics and Vision 6 (2011) 185–365.

Maximum margin multi label structured prediction
C. Lampert, Maximum Margin Multi Label Structured Prediction, Neural Information Processing Systems Foundation, 2011.

An efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.

Decision procedures for automating termination proofs
R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.

Streaming transducers for algorithmic verification of single pass list processing programs
R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610.

What’s decidable about weighted automata 
S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.

Co-Büching them all
U. Boker, O. Kupferman, in:, M. Hofmann (Ed.), Springer, 2011, pp. 184–198.

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

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.

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

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

Letter from the new editors-in-chief
H. Edelsbrunner, J. Pach, G. Ziegler, Discrete &; Computational Geometry 45 (2011) 1–2.

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.

Enforcing topological constraints in random field image segmentation
C. Chen, D. Freedman, C. Lampert, in:, CVPR: Computer Vision and Pattern Recognition, IEEE, 2011, pp. 2089–2096.