Ernst Althaus, Prof. Dr.

Head of Algorithmics

Johannes Gutenberg University Mainz
Institute of Computer Science
Staudingerweg 9
55128 Mainz
Room: 03-423

 

Phone number:+49 6131 39 23610

 

Office Hours: Arrangement by mail

Short Scientific CV

since December 2008
Professor at the Johannes Gutenberg-Universität Mainz
Head of the research group on "Algorithmics"

December 2009 - December 2015
Senior Researcher at the Max-Planck-Institut für Informatik, Saarbrücken

April 2007 - November 2008
Senior Researcher at the Max-Planck-Insitut für Informatik, Saarbrücken
Heading research area "Combinatorial Optmization"

October 2005 - March 2007
Visiting Professor at the Johannes Gutenberg-Universität Mainz
Head of the research group on "Theoretical Computer Science"

April 2004 - September 2005
Head of an independent research group at the Laboratoire lorrain de recherche en informatique et ses applications (LORIA), Nancy
Heading a research group on "Optimization in Bioinformatics"

September 2002 - March 2004
Postdoc at the Max-Planck-Insitut für Informatik, Saarbrücken

September 2001 - August 2002
Postdoc at the International Computer Science Institute, Berkeley, CA

May 2001 - August 2001
Postdoc at the Max-Planck-Insitut für Informatik, Saarbrücken

February 1999 - April 2001
Researcher at the Max-Planck-Insitut für Informatik, Saarbrücken
Ph. D. candidate in Computer Science at University of Saarbrücken (Universität des Saarlandes) and at MPII.

 

Education

January 2008
Habilitation
Universität des Saarlandes, Saarbrücken

April 2001
Promotion
Supervisor: Kurt Mehlhorn
Title: Curve Reconstruction and the Traveling Salesman Problem

December 1998
Diploma
Supervisor: Kurt Mehlhorn
Title: Berechnung optimaler Steinerbäume in der Ebene

 

Publications (selection)

Althaus, E, Kohlbacher, O, Lenhof, H, and Müller, P (2000).
A branch-&-cut algorithm for the optimal solution of the side chain placement problem
Max-Planck-Institut für Informatik.

Althaus, E, Hoffmann, S, Kupilas, J, and Thaden, E (2012).
A Column Generation Approach to Scheduling of Real-Time Networks
In: Proceedings of the World Congress on Engineering and Computer Science (WCECS), vol. 1, pp. 224–229, IAENG, San Francisco, USA, IAENG (ISBN: 978-988-19251-6-9).

Althaus, E, Lenhof, H, Kohlbacher, O, and Müller, P (2001).
A combinatorial approach to protein docking with flexible side chains
Journal of Computational Biology, 9(4):597–612,".

Althaus, E, Kohlbacher, O, Lenhof, H, and Müller, P (2000).
A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), ed. by Shamir, Ron and Miyano, Satoru and Istrail, Sorin and Pezner, Pavel and Waterman, Michael, pp. 15–24, Association for Computing Machinery (ACM SIGACT), Tokyo, Japan, ACM Press (ISBN: 1-58113-186-0).

Althaus, E and Canzar, S (2008).
A Lagrangian relaxation approach for the multiple sequence alignment problem
Journal of Combinatorial Optimization, 16(2):127-154.

Althaus, E and Canzar, S (2007).
A Lagrangian relaxation approach for the multiple sequence alignment problem
Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany.

Althaus, E and Canzar, S (2007).
A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Proceedings of the First International Conference on Combinatorial Optimization and Applications, Xi'an, Shaanxi, China. Lecture Notes in Computer Science.

Althaus, E and Fink, C (2002).
A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, ed. by Cook, William J. and Schulz, Andreas S., vol. 2337, pp. 258–272, Cambridge, USA, Springer. LNCS (ISBN: 3-540-43676-6).

Althaus, E, Caprara, A, Lenhof, H, and Reinert, K (2006).
Aligning Multiple sequences by Cutting Planes
Mathematical Programming, 105.

Althaus, E, Duchier, D, Koller, A, Mehlhorn, K, Niehren, J, and Thiel, S (2003).
An Efficient Algorithm for the Configuration Problem of Dominance Graphs
Journal of Algorithms, 48(1):194–219.

Althaus, E, Duchier, D, Koller, A, Mehlhorn, K, Niehren, J, and Thiel, S (2001).
An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), pp. 815–824, ACM-SIAM, Washington DC, USA, ACM (ISBN: 0-89871-490-7).

Althaus, E, Funke, S, Har-Peled, S, K\"onemann, J, Ramos, EA, and Skutella, M (2005).
Approximating k-hop minimum-spanning trees
Operations Research Letters, 33(2):115–120.

Althaus, E, Canzar, S, Elbassioni, K, Karrenbauer, A, and Mestre, J (2008).
Approximating the Interval Constrained Coloring Problem
In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden.

Althaus, E and Dumitriu, D (2012).
Certifying Feasibility and Objective Value of Linear Programs
Operations Research Letters.

Ciobanu, G, Dumitriu, D, Huzum, D, Moruz, G, and Tanasă, B (2002).
Client-Server P Systems in Modeling Molecular Interaction
In: Proc. Int'l Workshop on Membrane Computing, WMC-CdeA 2002, Curtea de Arges, ed. by Gheorghe Păun and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron, vol. 2597, pp. 203-218, Springer. Lecture Notes in Computer Science (ISBN: 3-540-00611-7).

Althaus, E, Canzar, S, Ehrler, C, Emmett, MR, Karrenbauer, A, Marshall, AG, Meyer-Bäse, A, Tipton, JD, and Zhang, H (2010).
Computing H/D-Exchange rates of single residues from data of proteolytic fragments
BMC Bioinformatics, 11(424).

Althaus, E, Canzar, S, Emmett, MR, Karrenbauer, A, Marshall, AG, Meyer-Baese, A, and Zhang, H (2008).
Computing H/D-Exchange Speeds of Single Residues from Data of Peptic Fragments
In: Proceedings of the 23rd Annual ACM Symposium on Applied Computing, Fortaleza, Cear\'a, Brazil.

Althaus, E, Karamanis, N, and Koller, A (2004).
Computing Locally Coherent Discourses
In: Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL 2004), Barcelona, Spain.

Althaus, E and Naujoks, R (2006).
Computing Steiner Minimum Trees in Hamming Metric
In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-06), Miami, USA.

Althaus, E, Canzar, S, Ehrler, C, Emmett, MR, Karrenbauer, A, Marshall, AG, Meyer-Bäse, A, Tiptopn, J, and Zhang, H (2009).
Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments
In: BIOCOMP, pp. 496-502.

Hoffmann, S (2008).
Ein Zweipersonenspiel basierend auf dem Mean-Curvature-Flow (A two-person game based on Mean-Curvature-Flow)
Diploma Thesis, Institute of Mathematics, Johannes Gutenberg-University Mainz, Germany.

Althaus, E, Mehlhorn, K, Naeher, S, and Schirra, S (2000).
Experiments on curve reconstruction
In: Proceedings of the 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00) [Preliminary version], pp. 103–114, Albuquerque, USA, University of New Mexico.

Althaus, E and Dumitriu, D (2009).
Fast and Accurate Bounds on Linear Programs
In: Proc. 8th International Symposium on Experimental Algorithms, ed. by Jan Vahrenhold, vol. 5526, pp. 40-50, Springer. LNCS.

Meyer-Baese, A, Cappendijk, S, and Althaus, E (2009).
Global Uniform Stability Analysis of Biological Networks with Different Time-Scales under Pertubations
In: Proceedings of the 2009 International Joint Conference Neural Networks.

Dumitriu, D, Funke, S, Kutz, M, and Milosavljević, N (2008).
How much Geometry it takes to Reconstruct a 2-Manifold in ℝ³
In: Proc. Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, ed. by J. Ian Munro and Dorothea Wagner, pp. 65-74, SIAM.

Dumitriu, D, Funke, S, Kutz, M, and Milosavljević, N (2009).
How much geometry it takes to reconstruct a 2-manifold in ℝ³
ACM Journal of Experimental Algorithmics, 14.

Dumitriu, D, Funke, S, Kutz, M, and Milosavljević, N (2008).
How much Geometry it takes to Reconstruct a 2-Manifold in ℝ³
In: Proc. 10th ACM-SIAM ALENEX, pp. 65-74.

Band, hB (1997).
http://www.bongos-bigband.deBongos Big Band
Miscellaneous publication.

Althaus, E, Polzin, T, and Vahdati Daneshmand, S (2003).
Improving Linear Programming Approaches for the Steiner Tree Problem
Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany.

Althaus, E, Polzin, T, and Vahdati Daneshmand, S (2003).
Improving Linear Programming Approaches for the Steiner Tree Problem
In: Proceedings of the Second International Workshop on Experimental and Efficient Algorithms (WEA), Ascona, Switzerland, Springer. Lecture Notes in Computer Science.

Althaus, E, Klau, GW, Kohlbacher, O, Lenhof, H, and Reinert, K (2009).
Integer Linear Programming in Computational Biology
In: Efficient Algorithms, pp. 199-218.

Althaus, E, Becker, B, Dumitriu, D, and Kupferschmid, S (2011).
Integration of an LP Solver into Interval Constraint Propagation
In: Proc. 5th International Conference on Combinatorial Optimization and Applications (COCOA '11), ed. by Wang, Weifan and Zhu, Xuding and Du, Ding-Zhu, vol. 6831, pp. 343-356, Springer. LNCS (ISBN: 978-3-642-22615-1).

Althaus, E and Canzar, S (2008).
LASA: A tool for non-heuristic alignment of multiple sequences
In: Proceedings of the Workshop on Algorithms in Molecular Biology, Vienna, Austria.

Althaus, E and Mehlhorn, K (1998).
Maximum Network Flow with Floating Point Arithmetic
Information Processing Letters, 66(3):109–113.

Althaus, E and Mehlhorn, K (1997).
Maximum network flow with floating point arithmetic
Max-Planck-Institut für Informatik.

Althaus, E, Caprara, A, Lenhof, H, and Reinert, K (2002).
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics.
In: Proceedings of the European Conference on Computational Biology, ed. by Lengauer, Thomas and Lenhof, Hans-Peter, vol. 18(Supplement 2), pp. S4–S16, Saarbrücken, Oxford University Press. Bioinformatics.

Dumitriu, D, Funke, S, Kutz, M, and Milosavljević, N (2008).
On the Locality of Extracting a 2-Manifold in ℝ³
In: Proc. 11th Scandinavian Workshop on Algorithm Theory, Gothenburg (SWAT '08), ed. by Joachim Gudmundsson, vol. 5124, pp. 270-281, Springer. Lecture Notes in Computer Science.

Althaus, E, Kupilas, J, and Naujoks, R (2011).
On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation, ed. by Ogihara, Mitsunori and Tarui, Jun, vol. 6648, pp. 308-319, Springer Berlin / Heidelberg. Lecture Notes in Computer Science.

Hoffmann, S (2014).
Optimized Scheduling in Real-Time Environments with Column Generation
PhD Thesis, Department of Computer Science, Johannes Gutenberg-University Mainz, Germany.

Althaus, E, Eisenbrand, F, Funke, S, and Mehlhorn, K (2004).
Point Containment in the Integer Hull of a Polyhedron
In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA.

Althaus, E, Calinescu, G, Mandoiu, I, Prasad, S, Tchervenski, N, and Zelikovsly, A (2006).
Power Efficient Range Assignment for Symmetric Connectivity in Static Ad-hoc Wireless Networks
Wireless Networks, 12(3).

Althaus, E, Calinescu, G, Mandoiu, I, Prasad, S, Tchervenski, N, and Zelikovsly, A (2003).
Power Efficient Range Assignment in Ad-hoc Wireless Networks
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), pp. 1889–1894, New Orleans, USA, IEEE.

Althaus, E and Naujoks, R (2008).
Reconstructing Phylogenetic Networks with One Recombination
In: Proceedings of the 7th International Workshop on Experimental Algorithms, Provincetown, Cape Code, Massachusetts, USA.

Crauser, A, Mehlhorn, K, Althaus, E, Brengel, K, Buchheit, T, Keller, J, Krone, H, Lambert, O, Schulte, R, Thiel, S, Westphal, M, and Wirth, R (1998).
Research report: on the performance of LEDA-SM
Max-Planck-Institut für Informatik.

Meyer-Bäse, A, Cappendijk, S, and Althaus, E (2009).
Robust Stability Analysis of the Tryptophan Regulatory Network of E.Coli
In: BIOCOMP, pp. 510-513.

Althaus, E, Hoffmann, S, Kupilas, J, and Thaden, E (2014).
Scheduling of Real-Time Networks with a Column Generation Approach
In: IAENG Transactions on Engineering Technologies, ed. by Kim, Haeng Kon and Ao, Sio-Iong and Amouzegar, Mahyar A. and Rieger, Burghard B., vol. 247, pp. 397-412, Springer Netherlands. Lecture Notes in Electrical Engineering.

Althaus, E, Bockmayr, A, Elf, M, Kasper, T, Jünger, M, and Mehlhorn, K (2002).
SCIL - Symbolic Constraints in Integer Linear Programming.
In: Proceedings of the 10th Annual European Symposium on Algorithms, ed. by Möhring, Rolf and Raman, Rajeev, vol. 2461, pp. 75–87, Rom, Italy, Springer. Lecture Notes in Computer Science (ISBN: 3-540-44180-8).

Ciobanu, G, Tanasă, B, Dumitriu, D, Huzum, D, and Moruz, G (2002).
Simulation and prediction of T cell responses
In: 3rd International Conference on Systems Biology (Posters).

Ciobanu, G and Dumitriu, D (2003).
Space and Time over the Web
In: WWW (Posters).

Althaus, E, Kruglov, E, and Weidenbach, C (2009).
Superposition Modulo Linear Arithmetic SUP(LA)
In: FroCos, pp. 84-99.

Althaus, E and Mehlhorn, K (2001).
Traveling Salesman-Based Curve Reconstruction in Polynomial Time
SIAM Journal on Computing, 31(1):27–66.

Althaus, E, Baumann, T, Schömer, E, and Werth, K (2007).
Trunk packing revisited
In: Proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, (WEA 2007), Rome, Italy. Lecture Notes in Computer Science.

Althaus, E and Mehlhorn, K (2000).
TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), pp. 686–695, ACM Special Interest Group on Algorithms and Computation Theory and SIAM Activity Group on Discrete Mathematics, San Francisco, USA, ACM Press (ISBN: 0-89871-453-2).