32935 articles – 26201 Notices  [english version]
.:. Consultation > Par auteur > Althaus .:.
8 documents classés par :

Computing H/D-exchange speeds of single residues from data of peptic fragments
Althaus E., Canzar S., Emmett M. R., Karrenbauer A., Marshall A. G., Meyer-Baese A., Zhang H.
In Symposium on Applied Computing - SAC 2008 (2008) 1273-1277 [hal-00388515 - version 1]
Approximating the Interval Constrained Coloring Problem
Althaus E., Canzar S., Karrenbauer A., Mestre J.
In SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory 5124 (2008) 210-221 [hal-00388513 - version 1]
Solving the extended pairwise alignment problem efficiently
Canzar S., Althaus E.
Research report (Max-Planck-Institut für Informatik). N° MPI-I-2007-1-002 (2007) [hal-00177235 - version 1]
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Canzar S., Althaus E.
In Combinatorial Optimization and Applications, First International Conference, COCOA 2007 4616 (2007) 267-278 [hal-00177224 - version 1]
Approximating k-hop minimum-spanning trees
Althaus E., Funke S., Har-Peled S., Könemann J., Ramos E. A., Skutella M.
Operations Research Letters 33, 2 (2005) 115-120 [inria-00001242 - version 1]
Computing Locally Coherent Discourses
Althaus E., Karamanis N., Koller A.
In 42nd Annual Meeting of the Association for Computational Linguistics - ACL 2004 (2004) 8 p [inria-00100116 - version 1]
fulltext access An Efficient Graph Algorithm for Dominance Constraints
Althaus E., Duchier D., Koller A., Mehlhorn K., Niehren J., Thiel S.
Journal of Algorithms 48, 1 (2003) 194-219 [inria-00536539 - version 1]
SCIL - Symbolic Constraints in Integer Linear Programming
Althaus E., Bockmayr A., Elf M., Kasper T., Jünger M., Mehlhorn K.
Dans 10th European Symposium on Algorithms - ESA'02 2461 (2002) 75-87 [inria-00100922 - version 1]