Chaudhuri, S.; Zaroliagis, C.: Shortest paths in digraphs of small treewidth part II: optimal parallel algirithms. Max-Planck-Institut für Informatik, Saarbrücken (1995), 20 pp.

Chaudhuri, S.; Zaroliagis, C.: Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Max-Planck-Institut für Informatik, Saarbrücken (1995), 17 pp.

Diehl, M.; De Simone, C.; Jünger, M.; Mutzel, P.; Reinelt, G.; Rinaldi, G.: Exact ground states of Ising spin classes: new experimental results with a branch and cut algorithm. Max-Planck-Institut für Informatik, Saarbrücken (1995), 17 pp.

Dubhashi, D. P.; Pantziou, G. E.; Spirakis, P. G.; Zaroliagis, C.: The fourth moment in Luby`s distribution. Max-Planck-Institut für Informatik, Saarbrücken (1995), 10 pp.

Hoepmann, J.-H.; Papatriantafilou, M.; Tsigas, P.: Towards self-stabilizing wait-free shared memory objects. Max-Planck-Institut für Informatik, Saarbrücken (1995), 15 pp.

Jünger, M.; Mutzel, P.: Exact and heuristic algorithms for 2-layer straightline crossing minimization. Max-Planck-Institut für Informatik, Saarbrücken (1995), 12 pp.

Jünger, M.; Mutzel, P.; Odenthal, T.; Scharbrodt, M.: The thickness of a minor-excluded class of graphs. Max-Planck-Institut für Informatik, Saarbrücken (1995), 9 pp.

Kapoor, S.: Dynamic maintenance of 2-d convex hulls and order decomposable problems. Max-Planck-Institut für Informatik, Saarbrücken (1995), 22 pp.

Könemann, J.; Schmitz, C.; Schwarz, C.: Radix heaps an efficient implementation for priority queues. Max-Planck-Institut für Informatik, Saarbrücken (1995), 27 pp.

Lenhof, H.-P.: An algorithm for the protein docking problem. Max-Planck-Institut für Informatik, Saarbrücken (1995), 11 pp.

Mehlhorn, K.; Näher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Universität Halle, Halle (1995)

Mutzel, P.: A polyhedral approach to planar augmentation and related problems. Max-Planck-Institut für Informatik, Saarbrücken (1995), 14 pp.

Mutzel, P.: Automatisiertes Zeichnen von Diagrammen. Max-Planck-Institut für Informatik, Saarbrücken (1995), 5 pp.

Näher, S.; Uhrig, C.: LEDA user manual (version R 3.2). Max-Planck-Institut für Informatik, Saarbrücken (1995), 184 pp.

Nonnengart, A.; Szalas, A.: A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. Max-Planck-Institut für Informatik, Saarbrücken (1995), 16 pp.

Ohlbach, H. J.; Schmidt, R. A.: Functional translation and second-order frame properties of modal logics. Max-Planck-Institut für Informatik, Saarbrücken (1995), 27 pp.

Ohlbach, H. J.; Schmidt, R. A.; Hustadt, U.: Translating graded modalities into predicate logic. Max-Planck-Institut für Informatik, Saarbrücken (1995), 37 pp.

Papatriantafilou, M.; Tsigas, P.: Wait-free consensus in "in-phase" multiprocessor systems. Max-Planck-Institut für Informatik, Saarbrücken (1995), 12 pp.

Pellegrini, M.: New deterministic algorithms for counting pairs of intersecting segments and off-line triangle range searching. Max-Planck-Institut für Informatik, Saarbrücken (1995), 12 pp.

Plaisted, D.: Special cases and substitutes for rigid $E$-unification. Max-Planck-Institut für Informatik, Saarbrücken (1995), 46 pp.