dblp.uni-trier.dewww.uni-trier.de

Ernst Althaus Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*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
27EEErnst Althaus, Gunnar W. Klau, Oliver Kohlbacher, Hans-Peter Lenhof, Knut Reinert: Integer Linear Programming in Computational Biology. Efficient Algorithms 2009: 199-218
26EEErnst Althaus, Evgeny Kruglov, Christoph Weidenbach: Superposition Modulo Linear Arithmetic SUP(LA). FroCos 2009: 84-99
25EEErnst Althaus, Daniel Dumitriu: Fast and Accurate Bounds on Linear Programs. SEA 2009: 40-50
2008
24EEErnst Althaus, Stefan Canzar: LASA: A Tool for Non-heuristic Alignment of Multiple Sequences. BIRD 2008: 489-498
23EEErnst 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
22EEErnst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre: Approximating the Interval Constrained Coloring Problem. SWAT 2008: 210-221
21EEErnst Althaus, Rouven Naujoks: Reconstructing Phylogenetic Networks with One Recombination. WEA 2008: 275-288
20EEErnst Althaus, Stefan Canzar: A Lagrangian relaxation approach for the multiple sequence alignment problem. J. Comb. Optim. 16(2): 127-154 (2008)
2007
19EEErnst Althaus, Stefan Canzar: A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem. COCOA 2007: 267-278
18EEErnst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth: Trunk Packing Revisited. WEA 2007: 420-432
2006
17EEErnst Althaus, Rouven Naujoks: Computing steiner minimum trees in Hamming metric. SODA 2006: 172-181
16EEErnst 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)
15EEErnst 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
14EEErnst 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
13EEErnst Althaus, Nikiforos Karamanis, Alexander Koller: Computing Locally Coherent Discourses. ACL 2004: 399-406
12EEErnst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn: Point containment in the integer hull of a polyhedron. SODA 2004: 929-933
2003
11EEErnst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand: Improving Linear Programming Approaches for the Steiner Tree Problem. WEA 2003: 1-14
10EEErnst 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
8EEErnst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn: SCIL - Symbolic Constraints in Integer Linear Programming. ESA 2002: 75-87
7EEErnst 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
5EEErnst 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
4EEErnst Althaus, Kurt Mehlhorn: Traveling Salesman-Based Curve Reconstruction in Polynomial Time. SIAM J. Comput. 31(1): 27-66 (2001)
2000
3EEErnst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller: A combinatorial approach to protein docking with flexible side-chains. RECOMB 2000: 15-24
2EEErnst Althaus, Kurt Mehlhorn: TSP-based curve reconstruction in polynomial time. SODA 2000: 686-695
1998
1EEErnst Althaus, Kurt Mehlhorn: Maximum Network Flow with Floating Point Arithmetic. Inf. Process. Lett. 66(3): 109-113 (1998)

Coauthor Index

1Tobias Baumann [18]
2Alexander Bockmayr [8]
3Gruia Calinescu [15]
4Stefan Canzar [19] [20] [22] [23] [24] [29]
5Susanne Cappendijk [28]
6Alberto Caprara [9] [16]
7Siavash Vahdati Daneshmand [11]
8Denys Duchier [5] [10]
9Daniel Dumitriu [25]
10Carsten Ehrler [29]
11Friedrich Eisenbrand [12]
12Khaled M. Elbassioni [22]
13Matthias Elf [8]
14Mark R. Emmett [23] [29]
15Christian Fink [7]
16Stefan Funke [12] [14]
17Sariel Har-Peled [14]
18Michael Jünger [8]
19Nikiforos Karamanis [13]
20Andreas Karrenbauer [22] [23] [29]
21Thomas Kasper [8]
22Gunnar W. Klau [27]
23Oliver Kohlbacher [3] [6] [27]
24Alexander Koller [5] [10] [13]
25Jochen Könemann [14]
26Evgeny Kruglov [26]
27Hans-Peter Lenhof [3] [6] [9] [16] [27]
28Ion I. Mandoiu [15]
29Alan G. Marshall [23] [29]
30Kurt Mehlhorn [1] [2] [4] [5] [8] [10] [12]
31Julián Mestre [22]
32Anke Meyer-Bäse [23] [28] [29]
33Peter Müller [3] [6]
34Rouven Naujoks [17] [21]
35Joachim Niehren [5] [10]
36Tobias Polzin [11]
37Sushil K. Prasad [15]
38Edgar A. Ramos [14]
39Knut Reinert [9] [16] [27]
40Elmar Schömer [18]
41Martin Skutella [14]
42N. Tchervenski [15]
43Sven Thiel [5] [10]
44Jeremiah Tiptopn [29]
45Christoph Weidenbach [26]
46Kai Werth [18]
47Alexander Zelikovsky [15]
48Huimin Zhang [23] [29]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)