Klein, C.: A fast root checking algorithm. INRIA, Sophia Antipolis (2004), 11 pp.

Krandick, W.; Mehlhorn, K.: New bounds for the Descartes method. Drexel University, Philadelphia, Pa. (2004), 18 pp.

Sanders, P.; Pettie, S.: A simpler linear time 2/3-epsilon approximation. Max-Planck-Institut für Informatik, Saarbrücken (2004), 7 pp.

Sanders, P.; Pettie, S.: A simpler linear time 2/3 - epsilon approximation for maximum weight matching. Max-Planck-Institut für Informatik, Saarbrücken (2004), 10 pp.

Schmitt, S.: Common subexpression search in LEDA_reals: a study of the diamond-operator. INRIA, Sophia Antipolis (2004), 5 pp.

Schmitt, S.: Improved separation bounds for the diamond operator. INRIA, Sophia Antipolis (2004), 13 pp.

Sivadasan, N.; Sanders, P.; Skutella, M.: Online scheduling with bounded migration. Max-Planck-Institut für Informatik, Saarbrücken (2004), 21 pp.

Sixth Biennial Report: August 2001 - May 2003 (Biennial Report / Max-Planck-Institut für Informatik, 6). Max-Planck-Institut für Informatik, Saarbrücken (2003), 526 pp.

Althaus, E.; Polzin, T.; Daneshmand, S.: Improving linear programming approaches for the Steiner tree problem. Max-Planck-Institut für Informatik, Saarbrücken (2003), 19 pp.

Beier, R.; Vöcking, B.: Random knapsack in expected polynomial time. Max-Planck-Institut für Informatik, Saarbrücken (2003), 22 pp.

Bekaert, P.; Slusallek, P.; Cools, R.; Havran, V.; Seidel, H.-P.: A custom designed density estimation method for light transport. Max-Planck-Institut für Informatik, Saarbrücken (2003), 28 pp.

Chandran Leela, S.; Subramanian, C. R.: Girth and treewidth. Max-Planck-Institut für Informatik, Saarbrücken (2003), 11 pp.

Csaba, B.: On the Bollob\'as -- Eldridge conjecture for bipartite graphs. Max-Planck-Institut für Informatik, Saarbrücken (2003), 29 pp.

Dietzfelbinger, M.; Tamaki, H.: On the probability of rendezvous in graphs. Max-Planck-Institut für Informatik, Saarbrücken (2003), 30 pp.

Dietzfelbinger, M.; Woelfel, P.: Almost random graphs with simple hash functions. Max-Planck-Institut für Informatik, Saarbrücken (2003), 23 pp.

Eisenbrand, F.: Fast Integer Programming in Fixed Dimension. Max-Planck-Institut für Informatik, Saarbrücken (2003), 14 pp.

Fogel, E.; Halperin, D.; Wein, R.; Teillaud, M.; Berberich, E.; Eigenwillig, A.; Hert, S.; Kettner, L.: Specification of the Traits Classes for CGAL Arrangements of Curves. INRIA, Sophia-Antipolis (2003)

Hangelbroek, T.; Nürnberger, G.; Rössl, C.; Seidel, H.-P.; Zeilfelder, F.: The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition. Max-Planck-Institut für Informatik, Saarbrücken (2003), 39 pp.

Jaeger, M.: A representation theorem and applications to measure selection and noninformative priors. Max-Planck-Institut für Informatik, Saarbrücken (2003), 35 pp.

Katriel, I.; Thiel, S.: Fast bound consistency for the global cardinality constraint. Max-Planck-Institut für Informatik, Saarbrücken (2003), 30 pp.