Publikationen

Crauser, A, Mehlhorn, K, Althaus, E, Brengel, K, Buchheit, T, Keller, J, Krone, H, Lambert, O, Schulte, R, Thiel, S, Westphal, M, and Wirth, R (1998).
Research report: on the performance of LEDA-SM
Max-Planck-Institut für Informatik.

Meyer-Bäse, A, Cappendijk, S, and Althaus, E (2009).
Robust Stability Analysis of the Tryptophan Regulatory Network of E.Coli
In: BIOCOMP, pp. 510-513.

Althaus, E, Bockmayr, A, Elf, M, Kasper, T, Jünger, M, and Mehlhorn, K (2002).
SCIL - Symbolic Constraints in Integer Linear Programming.
In: Proceedings of the 10th Annual European Symposium on Algorithms, ed. by Möhring, Rolf and Raman, Rajeev, vol. 2461, pp. 75–87, Rom, Italy, Springer. Lecture Notes in Computer Science (ISBN: 3-540-44180-8).

Ciobanu, G, Tanasă, B, Dumitriu, D, Huzum, D, and Moruz, G (2002).
Simulation and prediction of T cell responses
In: 3rd International Conference on Systems Biology (Posters).

Ciobanu, G and Dumitriu, D (2003).
Space and Time over the Web
In: WWW (Posters).

Althaus, E, Kruglov, E, and Weidenbach, C (2009).
Superposition Modulo Linear Arithmetic SUP(LA)
In: FroCos, pp. 84-99.

Althaus, E and Mehlhorn, K (2001).
Traveling Salesman-Based Curve Reconstruction in Polynomial Time
SIAM Journal on Computing, 31(1):27–66.

Althaus, E, Baumann, T, Schömer, E, and Werth, K (2007).
Trunk packing revisited
In: Proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, (WEA 2007), Rome, Italy. Lecture Notes in Computer Science.

Althaus, E and Mehlhorn, K (2000).
TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), pp. 686–695, ACM Special Interest Group on Algorithms and Computation Theory and SIAM Activity Group on Discrete Mathematics, San Francisco, USA, ACM Press (ISBN: 0-89871-453-2).