Dubhashi, D.; Ranjan, D.: On positive influence and negative dependence. Max-Planck-Institut für Informatik, Saarbrücken (1998), 12 pp.

Fabri, A.; Giezeman, G.-J.; Kettner, L.; Schirra, S.; Schönherr, S.: On the Design of CGAL, the Computational Geometry Algorithms Library. Max-Planck-Institut für Informatik, Saarbrücken (1998), 31 pp.

Frederickson, G. N.; Solis-Oba, R.: Robustness analysis in combinatorial optimization. Max-Planck-Institut für Informatik, Saarbrücken (1998), 66 pp.

Frigioni, D.; Marchetti-Spaccamela, A.; Nanni, U.: Fully dynamic shortest paths and negative cycle detection on diagraphs with Arbitrary Arc Weights. Max-Planck-Institut für Informatik, Saarbrücken (1998), 18 pp.

Ganzinger, H.; Jacquemard, F.; Veanes, M.: Rigid reachability. Max-Planck-Institut für Informatik, Saarbrücken (1998), 13 pp.

Gurevich, Y.; Veanes, M.: Partisan corroboration, and shifted pairing. Max-Planck-Institut für Informatik, Saarbrücken (1998), 35 pp.

Hagerup, T.: Simpler and faster static AC$^0$ dictionaries. Max-Planck-Institut für Informatik, Saarbrücken (1998), 13 pp.

Henzinger, M. R.; Leonardi, S.: Scheduling multicasts on unit-capacity trees and meshes. Max-Planck-Institut für Informatik, Saarbrücken (1998), 38 pp.

Jacquemard, F.; Meyer, C.; Weidenbach, C.: Unification in extensions of shallow equational theories. Max-Planck-Institut für Informatik, Saarbrücken (1998), 31 pp.

Jansen, K.: A new characterization for parity graphs and a coloring problem with costs. Max-Planck-Institut für Informatik, Saarbrücken (1998), 16 pp.

Jansen, K.: The mutual exclusion scheduling problem for permutation and comparability graphs. Max-Planck-Institut für Informatik, Saarbrücken (1998), 12 pp.

Jansen, K.; Porkolab, L.: Improved approximation schemes for scheduling unrelated parallel machines. Max-Planck-Institut für Informatik, Saarbrücken (1998), 14 pp.

Jansen, K.; Porkolab, L.: Linear-time approximation schemes for scheduling malleable parallel tasks. Max-Planck-Institut für Informatik, Saarbrücken (1998), 15 pp.

Jünger, M.; Leipert, S.; Mutzel, P.: A note on computing a maximal planar subgraph using PQ-trees. Max-Planck-Institut für Informatik, Saarbrücken (1998), 5 pp.

Klau, G. W.; Mutzel, P.: Optimal compaction of orthogonal grid drawings. Max-Planck-Institut für Informatik, Saarbrücken (1998), 20 pp.

Klau, G. W.; Mutzel, P.: Quasi-orthogonal drawing of planar graphs. Max-Planck-Institut für Informatik, Saarbrücken (1998), 15 pp.

Krysta, P.; Lorys, K.: New approximation algorithms for the achromatic number. Max-Planck-Institut für Informatik, Saarbrücken (1998), 26 pp.

Mahajan, S.; Ramos, E. A.; Subrahmanyam, K. V.: Solving some discrepancy problems in NC*. Max-Planck-Institut für Informatik, Saarbrücken (1998), 21 pp.

2nd Workshop on Algorithm Engineering WAE '98 -- Proceedings. Max-Planck-Institut für Informatik, Saarbrücken (1998), 213 pp.

Meyer, U.; Sibeyn, J.: Time-independent gossiping on full-port tori. Max-Planck-Institut für Informatik, Saarbrücken (1998), 20 pp.