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

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

Lumpability abstractions of rule based systems
J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.

Mean payoff pushdown games
K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.

Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35.

Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.

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.

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

Algorithmic analysis of array-accessing programs
R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic (TOCL) 13 (2012).

Strategy synthesis for multi-dimensional quantitative objectives
K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.

Generalized sequential tree-reweighted message passing
V. Kolmogorov, T. Schoenemann, ArXiv (n.d.).

Equivalence of games with probabilistic uncertainty and partial observation games
K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.

Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols
J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:, Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500.

An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.

Die Zeit des Abwartens ist vorbei!
P. Danowski, BuB - Forum Bibliothek und Information 64 (2012) 284.

Energy parity games
K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.

Interpretations in trees with countably many branches
A. Rabinovich, S. Rubin, in:, IEEE, 2012.

Mapping backbone and side-chain interactions in the transition state of a coupled protein folding and binding reaction
A. Bachmann, D. Wildemann, F.M. Praetorius, G. Fischer, T. Kiefhaber, PNAS 108 (2011) 3952–3957.

Spatio-temporal extraction of articulated models in a graph pyramid
N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin, Heidelberg, 2011, pp. 215–224.

POM121 and Sun1 play a role in early steps of interphase NPC assembly
J.A. Talamas, M. Hetzer, Journal of Cell Biology 194 (2011) 27–37.