Your search returned the following 33 documents:

33. Approximation Algorithms for the Interval Constrained Coloring Problem
    Ernst Althaus, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, and Julian Mestre
    Algorithmica 61 (2): 342-361, 2011
    
32. On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
    Ernst Althaus, Joschka Kupilas, and Rouven Naujoks
    In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, Tokyo, Japan, 2011, 308-319. Note: to appear
    
31. A New Combinatorial Approach to Parametric Path Analysis
    Bernd Becker, Werner Damm, Martin Fränzle, Ernst-Rüdiger Olderog, Andreas Podelski, and Reinhard Wilhelm(Ed.)
    Ernst Althaus, Sebastian Altmeyer, and Rouven Naujoks
    SFB/TR 14 AVACS, SFB/TR 14 AVACS, ATR 58, Reports of SFB/TR 14 AVACS
    
30. Fast and Accurate Bounds on Linear Programs
    Ernst Althaus and Daniel Dumitriu
    In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), Dortmund, Germany, 2009, 40-50
    
29. A Lagrangian relaxation approach for the multiple sequence alignment problem
    Ernst Althaus and Stefan Canzar
    Journal of Combinatorial Optimization 16: 127-154, 2008
    
28. Approximating the Interval Constrained Coloring Problem
    Ernst Althaus, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, and Julián Mestre
    In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), Gothenburg, Sweden, 2008, 210-221
    
27. Computing H/D-exchange speeds of single residues from data of peptic fragments
    Ernst Althaus, Stefan Canzar, Mark Emmett, Andreas Karrenbauer, Alan Marshall, Anke Meyer-Bäse, and Huimin Zhang
    In: 23rd Annual ACM Symposium on Applied Computing (SAC), Fortaleza, Brazil, 2008, 1273-1277
    
26. LASA: A tool for non-heuristic alignment of multiple sequences
    Ernst Althaus and Stefan Canzar
    In: Bioinformatics Research and Development (BIRD’08), Vienna, Austria, 2008, 489-498
    
25. Reconstructing Phylogenetic Networks with One Recombination
    Ernst Althaus and Rouven Naujoks
    In: Experimental Algorithms, 7th International Workshop, WEA 2008, Massachusetts, USA, 2008, 275-288
    
24. A Lagrangian relaxation approach for the multiple sequence alignment problem
    Ernst Althaus and Stefan Canzar
    In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, Xi'an, Shaanxi, China, 2007, 267-278
    
23. Trunk Packing Revisited
    Ernst Althaus, Tobias Baumann, Elmar Schömer, and Kai Werth
    In: Experimental Algorithms, 6th International Workshop, Rome, Italy, 2007, 420-432
    
22. Aligning multiple sequences by cutting planes
    Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, and Knut Reinert
    Mathematical Programming 2006: 387-425, 2006
    
21. Computing Steiner Minimal Trees in Hamming Metric
    Ernst Althaus and Rouven Naujoks
    In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, Miami, USA, 2006, 172-181
    [PDF: Download: soda.pdf]
    
20. Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
    Ernst Althaus, Gruia Calinescu, Ion Mandoiu, Sushil Prasad, Nickolay Tchervenski, and Alexander Zelikovsly
    Wireless Networks 12 (3): 287-299, 2006
    
19. Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
    Ernst Althaus, Gruia Calinescu, Ion Mandoiu, Sushil Prasad, Nickolay Tchervenski, and Alexander Zelikovsly
    Wireless Networks 12 (3): 287-299, 2006
    
18. Approximating k-Hop Minimum-Spanning Trees
    Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, and Martin Skutella
    Operations Research Letters 33 (2): 115-120, 2005
    
17. Computing Locally Coherent Discourses.
    Ernst Althaus, Nikiforos Karamanis, and Alexander Koller
    In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, Barcelona, Spain, 2004, 399-406
    
16. Point Containment in the Integer Hull of a Polyhedron
    Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, and Kurt Mehlhorn
    In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, 2004, 929-933
    
    
15. An Efficient Algorithm for the Configuration Problem of Dominance Graphs
    Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel
    Journal of Algorithms 48: 194-219, 2003
    
    
14. Improving Linear Programming Approaches for the Steiner Tree Problem
    Ernst Althaus, Tobias Polzin, and Siavash Vahdati Daneshmand
    In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, Ascona, Switzerland, May, 26 - May, 28, 2003, 1-14. Note: Pages are not yet known
    
13. Power Efficient Range Assignment in Ad-hoc Wireless
    Ernst Althaus, Gruia Calinescu, Ion Mandoiu, Sushil Prasad, Nickolay Tchervenski, and Alexander Zelikovsly
    In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), New Orleans, USA, March, 16 - March, 20, 2003, 1889-1894
    
12. A combinatorial approach to protein docking with flexible side chains
    Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, and Peter Müller
    Journal of Computational Biology 9 (4): 597-612, 2002
    
11. A Polyhedral Approach to Surface Reconstruction from Planar Contours.
    Ernst Althaus and Christian Fink
    In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, Cambridge, USA, 2002, 258-272
    
10. Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
    Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, and Knut Reinert
    In: Proceedings of the European Conference on Computational Biology (ECCB 2002), Saarbrücken, 2002, S4-S16
    
9. SCIL - Symbolic Constraints in Integer Linear Programming.
   Ernst Althaus, Alexander Bockmayr, Matthias Elf, Thomas Kasper, Michael Jünger, and Kurt Mehlhorn
   In: Algorithms - ESA 2002 : 10th Annual European Symposium, Rom, Italy, 2002, 75-87
   
   
8. An Efficient Algorithm for the Configuration Problem of Dominance Graphs
   Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel
   In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), Washington DC, USA, January, 7 - January, 9, 2001, 815-824
   
7. Curve Reconstruction and the Traveling Salesman Problem
   Ernst Althaus
   Doctoral dissertation, Universität des Saarlandes, 2001
   
6. Traveling Salesman-Based Curve Reconstruction in Polynomial Time
   Ernst Althaus and Kurt Mehlhorn
   SIAM Journal on Computing 31 (1): 27-66, 2001
   [PDF: Download: Mehlhorn_a_2001_j.pdf] [PDF: Download: 143.pdf]
   
5. A Combinatorial Approach to Protein Docking with Flexible Side-Chains
   Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, and Peter Müller
   In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), Tokyo, Japan, April 8-11, 2000, 2000, 15-24
   
4. Experiments on curve reconstruction
   Ernst Althaus, Kurt Mehlhorn, Stefan Näher, and Stefan Schirra
   In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), San Francisco, USA, Jan, 6-11, 2000, 103-114
   
   
3. TSP-Based Curve Reconstruction in Polynomial Time
   Ernst Althaus and Kurt Mehlhorn
   In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), San Francisco, USA, January, 9-11, 2000, 686-695
   
2. Berechnung optimaler Steinerbäume in der Ebene
   Ernst Althaus
   Master's thesis, Universität des Saarlandes, 1998
   [PS: Download: diplom.ps]
   
1. Maximum Network Flow with Floating Point Arithmetic
   Ernst Althaus and Kurt Mehlhorn
   Information Processing Letters 66 (3): 109-113, 1998