The SCEAS System
| |||||||

## Search the dblp DataBase
Ernst Althaus:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ernst Althaus, Nikiforos Karamanis, Alexander Koller
**Computing Locally Coherent Discourses.**[Citation Graph (0, 0)][DBLP] ACL, 2004, pp:399-406 [Conf] - Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert
**Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics.**[Citation Graph (0, 0)][DBLP] ECCB, 2002, pp:4-16 [Conf] - Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn
**SCIL - Symbolic Constraints in Integer Linear Programming.**[Citation Graph (0, 0)][DBLP] ESA, 2002, pp:75-87 [Conf] - Ernst Althaus, Christian Fink
**A Polyhedral Approach to Surface Reconstruction from Planar Contours.**[Citation Graph (0, 0)][DBLP] IPCO, 2002, pp:258-272 [Conf] - Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller
**A combinatorial approach to protein docking with flexible side-chains.**[Citation Graph (0, 0)][DBLP] RECOMB, 2000, pp:15-24 [Conf] - Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
**An efficient algorithm for the configuration problem of dominance graphs.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:815-824 [Conf] - Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn
**Point containment in the integer hull of a polyhedron.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:929-933 [Conf] - Ernst Althaus, Kurt Mehlhorn
**TSP-based curve reconstruction in polynomial time.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:686-695 [Conf] - Ernst Althaus, Rouven Naujoks
**Computing steiner minimum trees in Hamming metric.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:172-181 [Conf] - Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand
**Improving Linear Programming Approaches for the Steiner Tree Problem.**[Citation Graph (0, 0)][DBLP] WEA, 2003, pp:1-14 [Conf] - Ernst Althaus, Kurt Mehlhorn
**Maximum Network Flow with Floating Point Arithmetic.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:66, n:3, pp:109-113 [Journal] - Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
**An efficient graph algorithm for dominance constraints.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:194-219 [Journal] - Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller
**A Combinatorial Approach to Protein Docking with Flexible Side Chains.**[Citation Graph (0, 0)][DBLP] Journal of Computational Biology, 2002, v:9, n:4, pp:597-612 [Journal] - Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert
**A branch-and-cut algorithm for multiple sequence alignment.**[Citation Graph (0, 0)][DBLP] Math. Program., 2006, v:105, n:2-3, pp:387-425 [Journal] - Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella
**Approximating**[Citation Graph (0, 0)][DBLP]*k*-hop minimum-spanning trees. Oper. Res. Lett., 2005, v:33, n:2, pp:115-120 [Journal] - Ernst Althaus, Kurt Mehlhorn
**Traveling Salesman-Based Curve Reconstruction in Polynomial Time.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:1, pp:27-66 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Wireless Networks, 2006, v:12, n:3, pp:287-299 [Journal] - Ernst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth
**Trunk Packing Revisited.**[Citation Graph (0, 0)][DBLP] WEA, 2007, pp:420-432 [Conf] - Ernst Althaus, Stefan Canzar
**A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem.**[Citation Graph (0, 0)][DBLP] COCOA, 2007, pp:267-278 [Conf] **Robust Stability Analysis of the Tryptophan Regulatory Network of E.Coli.**[Citation Graph (, )][DBLP]**Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments.**[Citation Graph (, )][DBLP]**Integer Linear Programming in Computational Biology.**[Citation Graph (, )][DBLP]**Superposition Modulo Linear Arithmetic SUP(LA).**[Citation Graph (, )][DBLP]**Computing H/D-exchange speeds of single residues from data of peptic fragments.**[Citation Graph (, )][DBLP]**Approximating the Interval Constrained Coloring Problem.**[Citation Graph (, )][DBLP]**Fast and Accurate Bounds on Linear Programs.**[Citation Graph (, )][DBLP]**Reconstructing Phylogenetic Networks with One Recombination.**[Citation Graph (, )][DBLP]**LASA: A Tool for Non-heuristic Alignment of Multiple Sequences.**[Citation Graph (, )][DBLP]**Fully Automatic Trunk Packing with Free Placements**[Citation Graph (, )][DBLP]
Search in 0.058secs, Finished in 0.059secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |