Arikati, S.; Chaudhuri, S.; Zaroliagis, C.: All-pairs min-cut in sparse networks. Max-Planck-Institut für Informatik, Saarbrücken (1996), 27 pp.

Basin, D.; Klarlund, N.: Beyond the finite in automatic hardware verification. Max-Planck-Institut für Informatik, Saarbrücken (1996), 51 pp.

Basin, D.; Matthews, S.; Viganò, L.: Natural deduction for non-classical logics. Max-Planck-Institut für Informatik, Saarbrücken (1996), 44 pp.

Basin, D.; Matthews, S.; Viganò, L.: Labelled propositional modal logics: theory and practice. Max-Planck-Institut für Informatik, Saarbrücken (1996), 46 pp.

Baumeister, H.: Using algebraic specification languages for model-oriented specifications. Max-Planck-Institut für Informatik, Saarbrücken (1996), 17 pp.

Bradford, P. G.; Reinert, K.: Lower bounds for row minima searching. Max-Planck-Institut für Informatik, Saarbrücken (1996), 12 pp.

Breslauer, D.; Jiang, T.; Jiang, Z.: Rotations of periodic strings and short superstrings. Max-Planck-Institut für Informatik, Saarbrücken (1996), 13 pp.

Brodal, G. S.; Chaudhuri, S.; Radhakrishnan, J.: The randomized complexity of maintaining the minimum. Max-Planck-Institut für Informatik, Saarbrücken (1996), 12 pp.

Burnikel, C.; Könemann, J.: High-precision floating point numbers in LEDA. Max-Planck-Institut für Informatik, Saarbrücken (1996), 47 pp.

Burnikel, C.; Mehlhorn, K.; Schirra, S.: The LEDA class real number. Max-Planck-Institut für Informatik, Saarbrücken (1996), 52 pp.

Christof, T.; Jünger, M.; Kececioglou, J.; Mutzel, P.; Reinelt, G.: A branch-and-cut approach to physical mapping with end-probes. Max-Planck-Institut für Informatik, Saarbrücken (1996), 10 pp.

Das, G.; Kapoor, S.; Smid, M.: On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees. Max-Planck-Institut für Informatik, Saarbrücken (1996), 14 pp.

De Simone, C.; Diehl, M.; Jünger, M.; Mutzel, P.; Reinelt, G.; Rinaldi, G.: Exact ground states of two-dimensional $\pm J$ Ising Spin Glasses. Max-Planck-Institut für Informatik, Saarbrücken (1996), 10 pp.

Diks, K.; Hagerup, T.: More general parallel tree contraction: Register allocation and broadcasting in a tree. Max-Planck-Institut für Informatik, Saarbrücken (1996), 24 pp.

Dubhashi, D. P.; Priebe, V.; Ranjan, D.: Negative dependence through the FKG Inequality. Max-Planck-Institut für Informatik, Saarbrücken (1996), 10 pp.

Finkler, U.; Mehlhorn, K.: Runtime prediction of real programs on real machines. Max-Planck-Institut für Informatik, Saarbrücken (1996), 10 pp.

Ganzinger, H.; Waldmann, U.: Theorem proving in cancellative abelian monoids. Max-Planck-Institut für Informatik, Saarbrücken (1996), 46 pp.

Garg, N.; Chaudhuri, S.; Ravi, R.: Generalized $k$-Center Problems. Max-Planck-Institut für Informatik, Saarbrücken (1996), 9 pp.

Garg, N.; Papatriantafilou, M.; Tsigas, P.: Distributed list coloring: how to dynamically allocate frequencies to mobile base stations. Max-Planck-Institut für Informatik, Saarbrücken (1996), 15 pp.

Gasieniec, L.; Indyk, P.; Krysta, P.: External inverse pattern matching. Max-Planck-Institut für Informatik, Saarbrücken (1996), 12 pp.