Doomsday equilibria for omega-regular games
K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.

PHAT – Persistent Homology Algorithms Toolbox
U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, in:, ICMS 2014: International Congress on Mathematical Software, Springer Berlin Heidelberg, Berlin, Heidelberg, 2014, pp. 137–143.

Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190.

How to travel between languages
K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg, 2013, pp. 214–225.

Persistent homology in image processing
H. Edelsbrunner, in:, Graph-Based Representations in Pattern Recognition, Springer Nature, Berlin, Heidelberg, 2013, pp. 182–183.

On multiple keyword sponsored search auctions with budgets
R. Colini-Baldeschi, M.H. Henzinger, S. Leonardi, M. Starnberger, in:, 39th International Colloquium on Automata, Languages, and Programming, Springer Nature, 2012, pp. 1–12.

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.

Accurate invariant checking for programs manipulating lists and arrays with infinite data
A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.

Polynomial-time algorithms for energy games with special weight structures
K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms – ESA 2012, Springer, 2012, pp. 301–312.

HSF(C): A software verifier based on Horn clauses
S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.

Improved Single Pass Algorithms for Resolution Proof Reduction
A. Gupta, in:, Automated Technology for Verification and Analysis, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 107–121.

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.

ABC: Algebraic Bound Computation for loops
R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.

Instance Deadlock: A Mystery behind Frozen Programs
G. Juhás, I. Kazlov, A. Juhásová, in:, Applications and Theory of Petri Nets, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 1–17.

Algorithmic aspects of web search engines
M.H. Henzinger, in:, 2th Annual European Symposium on Algorithms, Springer Nature, 2004, p. 3.

The past, present, and future of web search engines
M.H. Henzinger, in:, 31st International Colloquium on Automata, Languages and Programming, Springer Nature, 2004, p. 3.

Web information retrieval - an algorithmic perspective
M.H. Henzinger, in:, 8th Annual European Symposium on Algorithms, Springer Nature, 2000, pp. 1–8.

Maintaining minimum spanning trees in dynamic graphs
M.H. Henzinger, V. King, in:, 24th International Colloquium on Automata, Languages and Programming, Springer Nature, 1997, pp. 594–604.

Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
M.H. Henzinger, J.A. Telle, in:, 5th Scandinavian Workshop on Algorithm Theory, Springer Nature, 1996, pp. 16–27.

Improved sampling with applications to dynamic graph algorithms
M.H. Henzinger, M. Thorup, in:, 23rd International Colloquium on Automata, Languages, and Programming, Springer Nature, 1996, pp. 290–299.