Publications

Found 8 results
Author Title Type [ Year(Asc)]
Filters: Author is Ernst Althaus  [Clear All Filters]
2002
Althaus, E., Caprara A.., Lenhof H-P., & Reinert K.. (2002).  Multiple Sequence Alighment with Arbitrary Gap Costs: Computing an Optimal Solution Using Polydhedral Combinatorics.
Althaus, E., & Fink C.. (2002).  A Polyhedral Approach to Surface Reconstruction from Planar Contours. Proceedings of the Ninth Conference on Integer Programming and Combinatorial Optimization.
2001
Althaus, E. (2001).  Curve Reconstruction and the Traveling Salsman Problem..
Althaus, E., & Mehlhorn K. (2001).  TSP-Based Curve Reconstruction in Polynomial Time. 31(1), 
2000
Althaus, E., Kohlbacher O., Lenhof H-P., & Müller P. (2000).  A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem.
Althaus, E., Kohlbacher O., Lenhof H-P., & Müller P. (2000).  A Combinatorial Approach to Protein Docking with Flexible Side-Chains. Proceedings of the Fourth Annual International conference on Computational Molecular Biology (RECOMB-00).
Althaus, E., Mehlhorn K., Naher S.., & Schirra S. (2000).  Experiments on Curve Reconstruction.
Althaus, E., & Mehlhorn K. (2000).  TSP-Based Curve Reconstruction in Polynomial Time. Proceedings of the Eleventh Symposium on Discrete Algorithms. 686-695.