| * | 2009 |
| 29 | | Ernst Althaus,
Stefan Canzar,
Carsten Ehrler,
Mark R. Emmett,
Andreas Karrenbauer,
Alan G. Marshall,
Anke Meyer-Bäse,
Jeremiah Tiptopn,
Huimin Zhang:
Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments.
BIOCOMP 2009: 496-502 |
| 28 | | Anke Meyer-Bäse,
Susanne Cappendijk,
Ernst Althaus:
Robust Stability Analysis of the Tryptophan Regulatory Network of E.Coli.
BIOCOMP 2009: 510-513 |
| 27 | EE | Ernst Althaus,
Gunnar W. Klau,
Oliver Kohlbacher,
Hans-Peter Lenhof,
Knut Reinert:
Integer Linear Programming in Computational Biology.
Efficient Algorithms 2009: 199-218 |
| 26 | EE | Ernst Althaus,
Evgeny Kruglov,
Christoph Weidenbach:
Superposition Modulo Linear Arithmetic SUP(LA).
FroCos 2009: 84-99 |
| 25 | EE | Ernst Althaus,
Daniel Dumitriu:
Fast and Accurate Bounds on Linear Programs.
SEA 2009: 40-50 |
| 2008 |
| 24 | EE | Ernst Althaus,
Stefan Canzar:
LASA: A Tool for Non-heuristic Alignment of Multiple Sequences.
BIRD 2008: 489-498 |
| 23 | EE | Ernst Althaus,
Stefan Canzar,
Mark R. Emmett,
Andreas Karrenbauer,
Alan G. Marshall,
Anke Meyer-Bäse,
Huimin Zhang:
Computing H/D-exchange speeds of single residues from data of peptic fragments.
SAC 2008: 1273-1277 |
| 22 | EE | Ernst Althaus,
Stefan Canzar,
Khaled M. Elbassioni,
Andreas Karrenbauer,
Julián Mestre:
Approximating the Interval Constrained Coloring Problem.
SWAT 2008: 210-221 |
| 21 | EE | Ernst Althaus,
Rouven Naujoks:
Reconstructing Phylogenetic Networks with One Recombination.
WEA 2008: 275-288 |
| 20 | EE | Ernst Althaus,
Stefan Canzar:
A Lagrangian relaxation approach for the multiple sequence alignment problem.
J. Comb. Optim. 16(2): 127-154 (2008) |
| 2007 |
| 19 | EE | Ernst Althaus,
Stefan Canzar:
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem.
COCOA 2007: 267-278 |
| 18 | EE | Ernst Althaus,
Tobias Baumann,
Elmar Schömer,
Kai Werth:
Trunk Packing Revisited.
WEA 2007: 420-432 |
| 2006 |
| 17 | EE | Ernst Althaus,
Rouven Naujoks:
Computing steiner minimum trees in Hamming metric.
SODA 2006: 172-181 |
| 16 | EE | Ernst Althaus,
Alberto Caprara,
Hans-Peter Lenhof,
Knut Reinert:
A branch-and-cut algorithm for multiple sequence alignment.
Math. Program. 105(2-3): 387-425 (2006) |
| 15 | EE | Ernst Althaus,
Gruia Calinescu,
Ion I. Mandoiu,
Sushil K. Prasad,
N. Tchervenski,
Alexander Zelikovsky:
Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks.
Wireless Networks 12(3): 287-299 (2006) |
| 2005 |
| 14 | EE | Ernst Althaus,
Stefan Funke,
Sariel Har-Peled,
Jochen Könemann,
Edgar A. Ramos,
Martin Skutella:
Approximating k-hop minimum-spanning trees.
Oper. Res. Lett. 33(2): 115-120 (2005) |
| 2004 |
| 13 | EE | Ernst Althaus,
Nikiforos Karamanis,
Alexander Koller:
Computing Locally Coherent Discourses.
ACL 2004: 399-406 |
| 12 | EE | Ernst Althaus,
Friedrich Eisenbrand,
Stefan Funke,
Kurt Mehlhorn:
Point containment in the integer hull of a polyhedron.
SODA 2004: 929-933 |
| 2003 |
| 11 | EE | Ernst Althaus,
Tobias Polzin,
Siavash Vahdati Daneshmand:
Improving Linear Programming Approaches for the Steiner Tree Problem.
WEA 2003: 1-14 |
| 10 | EE | Ernst Althaus,
Denys Duchier,
Alexander Koller,
Kurt Mehlhorn,
Joachim Niehren,
Sven Thiel:
An efficient graph algorithm for dominance constraints.
J. Algorithms 48(1): 194-219 (2003) |
| 2002 |
| 9 | | Ernst Althaus,
Alberto Caprara,
Hans-Peter Lenhof,
Knut Reinert:
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics.
ECCB 2002: 4-16 |
| 8 | EE | Ernst Althaus,
Alexander Bockmayr,
Matthias Elf,
Michael Jünger,
Thomas Kasper,
Kurt Mehlhorn:
SCIL - Symbolic Constraints in Integer Linear Programming.
ESA 2002: 75-87 |
| 7 | EE | Ernst Althaus,
Christian Fink:
A Polyhedral Approach to Surface Reconstruction from Planar Contours.
IPCO 2002: 258-272 |
| 6 | | Ernst Althaus,
Oliver Kohlbacher,
Hans-Peter Lenhof,
Peter Müller:
A Combinatorial Approach to Protein Docking with Flexible Side Chains.
Journal of Computational Biology 9(4): 597-612 (2002) |
| 2001 |
| 5 | EE | Ernst Althaus,
Denys Duchier,
Alexander Koller,
Kurt Mehlhorn,
Joachim Niehren,
Sven Thiel:
An efficient algorithm for the configuration problem of dominance graphs.
SODA 2001: 815-824 |
| 4 | EE | Ernst Althaus,
Kurt Mehlhorn:
Traveling Salesman-Based Curve Reconstruction in Polynomial Time.
SIAM J. Comput. 31(1): 27-66 (2001) |
| 2000 |
| 3 | EE | Ernst Althaus,
Oliver Kohlbacher,
Hans-Peter Lenhof,
Peter Müller:
A combinatorial approach to protein docking with flexible side-chains.
RECOMB 2000: 15-24 |
| 2 | EE | Ernst Althaus,
Kurt Mehlhorn:
TSP-based curve reconstruction in polynomial time.
SODA 2000: 686-695 |
| 1998 |
| 1 | EE | Ernst Althaus,
Kurt Mehlhorn:
Maximum Network Flow with Floating Point Arithmetic.
Inf. Process. Lett. 66(3): 109-113 (1998) |