Publikationen

Althaus, E, Kohlbacher, O, Lenhof, H, and Müller, P (2000).
A branch-&-cut algorithm for the optimal solution of the side chain placement problem
Max-Planck-Institut für Informatik.

Althaus, E, Hoffmann, S, Kupilas, J, and Thaden, E (2012).
A Column Generation Approach to Scheduling of Real-Time Networks
In: Proceedings of the World Congress on Engineering and Computer Science (WCECS), vol. 1, pp. 224–229, IAENG, San Francisco, USA, IAENG (ISBN: 978-988-19251-6-9).

Althaus, E, Lenhof, H, Kohlbacher, O, and Müller, P (2001).
A combinatorial approach to protein docking with flexible side chains
Journal of Computational Biology, 9(4):597–612,".

Althaus, E, Kohlbacher, O, Lenhof, H, and Müller, P (2000).
A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), ed. by Shamir, Ron and Miyano, Satoru and Istrail, Sorin and Pezner, Pavel and Waterman, Michael, pp. 15–24, Association for Computing Machinery (ACM SIGACT), Tokyo, Japan, ACM Press (ISBN: 1-58113-186-0).

Althaus, E and Canzar, S (2008).
A Lagrangian relaxation approach for the multiple sequence alignment problem
Journal of Combinatorial Optimization, 16(2):127-154.

Althaus, E and Canzar, S (2007).
A Lagrangian relaxation approach for the multiple sequence alignment problem
Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany.

Althaus, E and Canzar, S (2007).
A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Proceedings of the First International Conference on Combinatorial Optimization and Applications, Xi'an, Shaanxi, China. Lecture Notes in Computer Science.

Althaus, E and Fink, C (2002).
A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, ed. by Cook, William J. and Schulz, Andreas S., vol. 2337, pp. 258–272, Cambridge, USA, Springer. LNCS (ISBN: 3-540-43676-6).

Althaus, E, Caprara, A, Lenhof, H, and Reinert, K (2006).
Aligning Multiple sequences by Cutting Planes
Mathematical Programming, 105.

Althaus, E, Duchier, D, Koller, A, Mehlhorn, K, Niehren, J, and Thiel, S (2003).
An Efficient Algorithm for the Configuration Problem of Dominance Graphs
Journal of Algorithms, 48(1):194–219.

Althaus, E, Duchier, D, Koller, A, Mehlhorn, K, Niehren, J, and Thiel, S (2001).
An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), pp. 815–824, ACM-SIAM, Washington DC, USA, ACM (ISBN: 0-89871-490-7).

Althaus, E, Funke, S, Har-Peled, S, K\"onemann, J, Ramos, EA, and Skutella, M (2005).
Approximating k-hop minimum-spanning trees
Operations Research Letters, 33(2):115–120.

Althaus, E, Canzar, S, Elbassioni, K, Karrenbauer, A, and Mestre, J (2008).
Approximating the Interval Constrained Coloring Problem
In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden.

Althaus, E and Dumitriu, D (2012).
Certifying Feasibility and Objective Value of Linear Programs
Operations Research Letters.

Ciobanu, G, Dumitriu, D, Huzum, D, Moruz, G, and Tanasă, B (2002).
Client-Server P Systems in Modeling Molecular Interaction
In: Proc. Int'l Workshop on Membrane Computing, WMC-CdeA 2002, Curtea de Arges, ed. by Gheorghe Păun and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron, vol. 2597, pp. 203-218, Springer. Lecture Notes in Computer Science (ISBN: 3-540-00611-7).

Althaus, E, Canzar, S, Ehrler, C, Emmett, MR, Karrenbauer, A, Marshall, AG, Meyer-Bäse, A, Tipton, JD, and Zhang, H (2010).
Computing H/D-Exchange rates of single residues from data of proteolytic fragments
BMC Bioinformatics, 11(424).

Althaus, E, Canzar, S, Emmett, MR, Karrenbauer, A, Marshall, AG, Meyer-Baese, A, and Zhang, H (2008).
Computing H/D-Exchange Speeds of Single Residues from Data of Peptic Fragments
In: Proceedings of the 23rd Annual ACM Symposium on Applied Computing, Fortaleza, Cear\'a, Brazil.

Althaus, E, Karamanis, N, and Koller, A (2004).
Computing Locally Coherent Discourses
In: Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL 2004), Barcelona, Spain.

Althaus, E and Naujoks, R (2006).
Computing Steiner Minimum Trees in Hamming Metric
In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-06), Miami, USA.

Althaus, E, Canzar, S, Ehrler, C, Emmett, MR, Karrenbauer, A, Marshall, AG, Meyer-Bäse, A, Tiptopn, J, and Zhang, H (2009).
Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments
In: BIOCOMP, pp. 496-502.