Kazakov, Y.; de Nivelle, H.: Subsumption of concepts in $DL$ ${\cal FL}_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. Max-Planck-Institut für Informatik, Saarbrücken (2003), 12 S.

Kovács, A.: Sum-Multicoloring on paths. Max-Planck-Institut für Informatik, Saarbrücken (2003), 20 S.

Krysta, P.; Czumaj, A.; Vöcking, B.: Selfish traffic allocation for server farms. Max-Planck-Institut für Informatik, Saarbrücken (2003), 43 S.

Krysta, P.; Sanders, P.; Vöcking, B.: Scheduling and traffic allocation for tasks with bounded splittability. Max-Planck-Institut für Informatik, Saarbrücken (2003), 15 S.

Maier, P.: Compositional circular assume-guarantee rules cannot be sound and complete. Max-Planck-Institut für Informatik, Saarbrücken (2003), 22 S.

Podelski, A.; Rybalchenko, A.: Software model checking of liveness properties via transition invariants. Max-Planck-Institut für Informatik, Saarbrücken (2003), 29 S.

Rössl, C.; Zeilfelder, F.; Nürnberger, G.; Seidel, H.-P.: Visualization of volume data with quadratic super splines. Max-Planck-Institut für Informatik, Saarbrücken (2003), 15 S.

Sanders, P.: Polynomial time algorithms for network information flow. Max-Planck-Institut für Informatik, Saarbrücken (2003), 18 S.

Sanders, P.; Dementiev, R.: Asynchronous parallel disk sorting. Max-Planck-Institut für Informatik, Saarbrücken (2003), 22 S.

Schäfer, G.: A note on the smoothed complexity of the single-source shortest path problem. Max-Planck-Institut für Informatik, Saarbrücken (2003), 8 S.

Schäfer, G.; Becchetti, L.; Leonardi, S.; Marchetti-Spaccamela, A.; Vredeveld, T.: Average case and smoothed competitive analysis of the multi-level feedback algorithm. Max-Planck-Institut für Informatik, Saarbrücken (2003), 31 S.

Schäfer, G.; Leonardi, S.: Cross-monotonic cost sharing methods for connected facility location games. Max-Planck-Institut für Informatik, Saarbrücken (2003), 10 S.

Schäfer, G.; Sivadasan, N.: Topology matters: smoothed competitive analysis of metrical task systems. Max-Planck-Institut für Informatik, Saarbrücken (2003), 28 S.

Schmitt, S.: The Diamond Operator for Real Algebraic Numbers. Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, FRANCE (2003)

Tamaki, H.: A linear time heuristic for the branch-decomposition of planar graphs. Max-Planck-Institut für Informatik, Saarbrücken (2003), 18 S.

Tamaki, H.: Alternating cycles contribution: a strategy of tour-merging for the traveling salesman problem. Max-Planck-Institut für Informatik, Saarbrücken (2003), 22 S.

Tarini, M.; Lensch, H. P. A.; Gösele, M.; Seidel, H.-P.: 3D acquisition of mirroring objects. Max-Planck-Institut für Informatik, Saarbrücken (2003), 37 S.

Theobalt, C.; Li, M.; Magnor, M. A.; Seidel, H.-P.: A flexible and versatile studio for synchronized multi-view video recording. Max-Planck-Institut für Informatik, Saarbrücken (2003), 18 S.

Zakaria, N.: FaceSketch: an interface for sketching and coloring cartoon faces. Max-Planck-Institut für Informatik, Saarbrücken (2003), 30 S.

Zayer, R.; Rössl, C.; Seidel, H.-P.: Convex boundary angle based flattening. Max-Planck-Institut für Informatik, Saarbrücken (2003), 16 S.