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 pp.

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 pp.

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

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

Beldiceanu, N.; Carlsson, M.; Thiel, S.: Cost-filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint. Swedish Institute of Computer Science, Uppsala, Sweden (2002)

Charatonik, W.; Ganzinger, H.: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi. Max-Planck-Institut für Informatik, Saarbrücken (2002), 64 pp.

Charatonik, W.; Talbot, J.-M.: Atomic set constraints with projection. Max-Planck-Institut für Informatik, Saarbrücken (2002), 20 pp.

Drago, F.; Martens, W.; Myszkowski, K.; Seidel, H.-P.: Perceptual evaluation of tone mapping operators with regard to similarity and preference. Max-Planck-Institut für Informatik, Saarbrücken (2002), 30 pp.

Eigenwillig, A.; Schömer, E.; Wolpert, N.: Sweeping Arrangements of Cubic Segments Exactly and Efficiently. Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis (2002)

Gösele, M.; Kautz, J.; Lang, J.; Lensch, H. P. A.; Seidel, H.-P.: Tutorial notes ACM SM 02: a framework for the acquisition, processing and interactive display of high quality 3D models. Max-Planck-Institut für Informatik, Saarbrücken (2002), 50 pp.

Grandoni, F.: Incrementally Maintaining the Number of l-cliques. Max-Planck-Institut für Informatik, Saarbrücken (2002), 10 pp.

Hert, S.; Polzin, T.; Kettner, L.; Schäfer, G.: Exp Lab: a tool set for computational experiments. Max-Planck-Institut für Informatik, Saarbrücken (2002), 59 pp.

Hoefer, M.: Performance of heuristic and approximation algorithms for the uncapacitated facility location problem. Max-Planck-Institut für Informatik, Saarbrücken (2002), 27 pp.

Katriel, I.; Sanders, P.; Träff, J. L.: A practical minimum spanning tree algorithm using the cycle property. Max-Planck-Institut für Informatik, Saarbrücken (2002), 21 pp.

Polzin, T.; Vahdati, S.: Using (sub)graphs of small width for solving the Steiner problem. Max-Planck-Institut für Informatik, Saarbrücken (2002), 9 pp.

Sanders, P.; Träff, J. L.: The factor algorithm for all-to-all communication on clusters of SMP nodes. Max-Planck-Institut für Informatik, Saarbrücken (2002), 8 pp.

Fifth Biennial Report: June 1999 - August 2001 (Biennial Report / Max-Planck-Institut für Informatik, 5). Max-Planck-Institut für Informatik, Saarbrücken (2001), 278 pp.

Björklund, H.; Petersson, V.; Vorobyov, S.: Experiments with iterative improvement algorithms on completely unimodel hypercubes. Max-Planck-Institut für Informatik, Saarbrücken (2001), 25 pp.

Choi, S. W.; Seidel, H.-P.: Linear one-sided stability of MAT for weakly injective domain. Max-Planck-Institut für Informatik, Saarbrücken (2001), 18 pp.

Csaba, B.; Lodha, S.: A Randomized On-line Algorithm for the k-Server Problem on a Line. DIMACS-Center for Discrete Mathematics & Theoretical Computer Science, Piscataway, NJ (2001)